default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th CP 2020: Louvain-la-Neuve, Belgium
- Helmut Simonis:
Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings. Lecture Notes in Computer Science 12333, Springer 2020, ISBN 978-3-030-58474-0
Technical Track
- Roberto Amadini
, Graeme Gange, Peter J. Stuckey:
Dashed Strings and the Replace(-all) Constraint. 3-20 - Behrouz Babaki, Bilel Omrani, Gilles Pesant:
Combinatorial Search in CP-Based Iterated Belief Propagation. 21-36 - Jaroslav Bendík, Ivana Cerná:
Replication-Guided Enumeration of Minimal Unsatisfiable Subsets. 37-54 - Gustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey, Guido Tack:
Solving Satisfaction Problems Using Large-Neighbourhood Search. 55-71 - Kyle E. C. Booth, Bryan O'Gorman, Jeffrey Marshall, Stuart Hadfield, Eleanor Gilbert Rieffel:
Quantum-Accelerated Global Constraint Filtering. 72-89 - Shaowei Cai, Xindi Zhang:
Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search. 90-106 - Quentin Cohen-Solal:
Tractable Fragments of Temporal Sequences of Topological Information. 107-125 - Martin C. Cooper:
Strengthening Neighbourhood Substitution. 126-142 - Ewan Davidson, Özgür Akgün, Joan Espasa, Peter Nightingale:
Effective Encodings of Constraint Programming Models to SMT. 143-159 - Jo Devriendt:
Watched Propagation of 0-1 Integer Linear Constraints. 160-176 - Tomás Dlask, Tomás Werner:
Bounding Linear Programs by Constraint Propagation: Application to Max-SAT. 177-193 - Tomás Dlask, Tomás Werner:
On Relation Between Constraint Propagation and Block-Coordinate Descent in Linear Programs. 194-210 - Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi:
DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees. 211-230 - Alexander Ek, Maria Garcia de la Banda, Andreas Schutt, Peter J. Stuckey, Guido Tack:
Aggregation and Garbage Collection for Online Optimization. 231-247 - Johannes Klaus Fichte, Markus Hecher, Maximilian F. I. Kieler:
Treewidth-Aware Quantifier Elimination and Expansion for QCSP. 248-266 - Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
A Time Leap Challenge for SAT-Solving. 267-285 - Johannes Klaus Fichte, Markus Hecher, Stefan Szeider:
Breaking Symmetries with RootClique and LexTopSort. 286-303 - Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler:
Towards Faster Reasoners by Using Transparent Huge Pages. 304-322 - Graeme Gange, Peter J. Stuckey:
The Argmax Constraint. 323-337 - Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser, James Trimble:
Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. 338-357 - Rahul Gupta, Subhajit Roy, Kuldeep S. Meel:
Phase Transition Behavior in Knowledge Compilation. 358-374 - Gordon Hoi, Sanjay Jain, Frank Stephan:
A Faster Exact Algorithm to Count X3SAT Solutions. 375-391 - Ian Howell, Berthe Y. Choueiry, Hongfeng Yu:
Visualizations to Summarize Search Behavior. 392-409 - Nicolas Isoart, Jean-Charles Régin:
Parallelization of TSP Solving in CP. 410-426 - Janne I. Kokkala, Jakob Nordström:
Using Resolution Proofs to Analyse CDCL Solvers. 427-444 - Kevin Leo, Graeme Gange, Maria Garcia de la Banda, Mark Wallace:
Core-Guided Model Reformulation. 445-461 - Margaux Nattaf, Arnaud Malapert:
Filtering Rules for Flow Time Minimization in a Parallel Machine Scheduling Problem. 462-477 - Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
MaxSAT-Based Postprocessing for Treedepth. 478-495 - Anastasia Paparrizou, Hugues Wattez:
Perturbing Branching Heuristics in Constraint Solving. 496-513 - Tomás Peitl, Stefan Szeider:
Finding the Hardest Formulas for Resolution. 514-530 - Rebecca Gentzel, Laurent Michel, Willem Jan van Hoeve:
HADDOCK: A Language and Architecture for Decision Diagram Compilation. 531-547 - Simon Rohou, Abderahmane Bedouhene, Gilles Chabert, Alexandre Goldsztejn, Luc Jaulin, Bertrand Neveu, Victor Reyes, Gilles Trombettoni:
Towards a Generic Interval Solver for Differential-Algebraic CSP. 548-565 - Loïc Rouquette, Christine Solnon:
abstractXOR: A global constraint dedicated to differential cryptanalysis. 566-584 - Neng-Fa Zhou:
In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem. 585-602 - Edward Lam, Frits de Nijs, Peter J. Stuckey, Donald Azuatalam, Ariel Liebman:
Large Neighborhood Search for Temperature Control with Demand Response. 603-619 - Lucas Groleaz, Samba Ndojh Ndiaye, Christine Solnon:
Solving the Group Cumulative Scheduling Problem with CPO and ACO. 620-636 - Rémy Garcia, Claude Michel, Michel Rueher:
A Branch-and-bound Algorithm to Rigorously Enclose the Round-Off Errors. 637-653
Application Track
- 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. 657-672 - Yannick Carissan, Chisom-Adaobi Dim, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet:
Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming. 673-689 - Yannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet:
Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry. 690-706 - Mathieu Collet, Arnaud Gotlieb, Nadjib Lazaar, Mats Carlsson, Dusica Marijan, Morten Mossige:
RobTest: A CP Approach to Generate Maximal Test Trajectories for Industrial Robots. 707-723 - Begum Genc, Barry O'Sullivan:
A Two-Phase Constraint Programming Model for Examination Timetabling at University College Cork. 724-742 - Edward Lam, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar:
Exact Approaches to the Multi-agent Collective Construction Problem. 743-758 - Alexandre Mercier-Aubin, Ludwig Dumetz, Jonathan Gaudreault, Claude-Guy Quimper:
The Confidence Constraint: A Step Towards Stochastic CP Solvers. 759-773 - Monika Trimoska, Sorina Ionica, Gilles Dequen:
Parity (XOR) Reasoning for the Index Calculus Attack. 774-790 - Rodothea-Myrsini Tsoupidi, Roberto Castañeda Lozano, Benoit Baudry:
Constraint-Based Software Diversification for Efficient Mitigation of Code-Reuse Attacks. 791-808
CP and Data Science and Machine Learning
- Céline Brouard, Simon de Givry, Thomas Schiex:
Pushing Data into CP Models Using Graphical Model Learning and Solving. 811-827 - Paulius Dilkas, Vaishak Belle:
Generating Random Logic Programs Using Constraint Programming. 828-845 - Alexey Ignatiev, Martin C. Cooper, Mohamed Siala, Emmanuel Hebrard, João Marques-Silva:
Towards Formal Fairness in Machine Learning. 846-867 - Marko Kleine Büning, Philipp Kern, Carsten Sinz:
Verifying Equivalence Properties of Neural Networks with ReLU Activation Functions. 868-884 - Minghao Liu, Fan Zhang, Pei Huang, Shuzi Niu, Feifei Ma, Jian Zhang:
Learning the Satisfiability of Pseudo-Boolean Problem with Graph Neural Networks. 885-898 - Saeed Nejati, Ludovic Le Frioux, Vijay Ganesh:
A Machine Learning Based Splitting Heuristic for Divide-and-Conquer Solvers. 899-916 - Buser Say, Jo Devriendt, Jakob Nordström, Peter J. Stuckey:
Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models. 917-934 - Dimosthenis C. Tsouros, Kostas Stergiou, Christian Bessiere:
Omissions in Constraint Acquisition. 935-951 - Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic:
Computing Optimal Decision Sets with SAT. 952-970
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.
last updated on 2025-11-29 00:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
