default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 56 matches
- 2020
- Roberto Amadini, Graeme Gange, Peter J. Stuckey:
Dashed Strings and the Replace(-all) Constraint. CP 2020: 3-20 - Valentin Antuori, Emmanuel Hebrard, Marie-José Huguet, Siham Essodaigui, Alain Nguyen:
Leveraging Reinforcement Learning, Constraint Programming and Local Search: A Case Study in Car Manufacturing. CP 2020: 657-672 - Behrouz Babaki, Bilel Omrani, Gilles Pesant:
Combinatorial Search in CP-Based Iterated Belief Propagation. CP 2020: 21-36 - Jaroslav Bendík, Ivana Cerná:
Replication-Guided Enumeration of Minimal Unsatisfiable Subsets. CP 2020: 37-54 - Gustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey, Guido Tack:
Solving Satisfaction Problems Using Large-Neighbourhood Search. CP 2020: 55-71 - Kyle E. C. Booth, Bryan O'Gorman, Jeffrey Marshall, Stuart Hadfield, Eleanor Gilbert Rieffel:
Quantum-Accelerated Global Constraint Filtering. CP 2020: 72-89 - Céline Brouard, Simon de Givry, Thomas Schiex:
Pushing Data into CP Models Using Graphical Model Learning and Solving. CP 2020: 811-827 - Marko Kleine Büning, Philipp Kern, Carsten Sinz:
Verifying Equivalence Properties of Neural Networks with ReLU Activation Functions. CP 2020: 868-884 - Shaowei Cai, Xindi Zhang:
Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search. CP 2020: 90-106 - Yannick Carissan, Chisom-Adaobi Dim, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet:
Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming. CP 2020: 673-689 - Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet:
Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry. CP 2020: 690-706 - Quentin Cohen-Solal:
Tractable Fragments of Temporal Sequences of Topological Information. CP 2020: 107-125 - Mathieu Collet, Arnaud Gotlieb, Nadjib Lazaar, Mats Carlsson, Dusica Marijan, Morten Mossige:
RobTest: A CP Approach to Generate Maximal Test Trajectories for Industrial Robots. CP 2020: 707-723 - Martin C. Cooper:
Strengthening Neighbourhood Substitution. CP 2020: 126-142 - Ewan Davidson, Özgür Akgün, Joan Espasa, Peter Nightingale:
Effective Encodings of Constraint Programming Models to SMT. CP 2020: 143-159 - Jo Devriendt:
Watched Propagation of 0-1 Integer Linear Constraints. CP 2020: 160-176 - Paulius Dilkas, Vaishak Belle:
Generating Random Logic Programs Using Constraint Programming. CP 2020: 828-845 - Tomás Dlask, Tomás Werner:
Bounding Linear Programs by Constraint Propagation: Application to Max-SAT. CP 2020: 177-193 - Tomás Dlask, Tomás Werner:
On Relation Between Constraint Propagation and Block-Coordinate Descent in Linear Programs. CP 2020: 194-210 - Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi:
DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees. CP 2020: 211-230 - Alexander Ek, Maria Garcia de la Banda, Andreas Schutt, Peter J. Stuckey, Guido Tack:
Aggregation and Garbage Collection for Online Optimization. CP 2020: 231-247 - Johannes Klaus Fichte, Markus Hecher, Maximilian F. I. Kieler:
Treewidth-Aware Quantifier Elimination and Expansion for QCSP. CP 2020: 248-266 - Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
A Time Leap Challenge for SAT-Solving. CP 2020: 267-285 - Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
Breaking Symmetries with RootClique and LexTopSort. CP 2020: 286-303 - Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler:
Towards Faster Reasoners by Using Transparent Huge Pages. CP 2020: 304-322 - Graeme Gange, Peter J. Stuckey:
The Argmax Constraint. CP 2020: 323-337 - Rémy Garcia, Claude Michel, Michel Rueher:
A Branch-and-bound Algorithm to Rigorously Enclose the Round-Off Errors. CP 2020: 637-653 - Begum Genc, Barry O'Sullivan:
A Two-Phase Constraint Programming Model for Examination Timetabling at University College Cork. CP 2020: 724-742 - Rebecca Gentzel, Laurent Michel, Willem Jan van Hoeve:
HADDOCK: A Language and Architecture for Decision Diagram Compilation. CP 2020: 531-547 - Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser, James Trimble:
Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. CP 2020: 338-357
skipping 26 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-23 22:05 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint