Abstract is missing.
- Dashed Strings and the Replace(-all) ConstraintRoberto Amadini, Graeme Gange, Peter J. Stuckey. 3-20 [doi]
- Combinatorial Search in CP-Based Iterated Belief PropagationBehrouz Babaki, Bilel Omrani, Gilles Pesant. 21-36 [doi]
- Replication-Guided Enumeration of Minimal Unsatisfiable SubsetsJaroslav Bendík, Ivana Cerná. 37-54 [doi]
- Solving Satisfaction Problems Using Large-Neighbourhood SearchGustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey, Guido Tack. 55-71 [doi]
- Quantum-Accelerated Global Constraint FilteringKyle E. C. Booth, Bryan O'Gorman, Jeffrey Marshall, Stuart Hadfield, Eleanor Gilbert Rieffel. 72-89 [doi]
- Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local SearchShaowei Cai, Xindi Zhang. 90-106 [doi]
- Tractable Fragments of Temporal Sequences of Topological InformationQuentin Cohen-Solal. 107-125 [doi]
- Strengthening Neighbourhood SubstitutionMartin C. Cooper. 126-142 [doi]
- Effective Encodings of Constraint Programming Models to SMTEwan Davidson, Özgür Akgün, Joan Espasa, Peter Nightingale. 143-159 [doi]
- Watched Propagation of 0-1 Integer Linear ConstraintsJo Devriendt. 160-176 [doi]
- Bounding Linear Programs by Constraint Propagation: Application to Max-SATTomás Dlask, Tomás Werner. 177-193 [doi]
- On Relation Between Constraint Propagation and Block-Coordinate Descent in Linear ProgramsTomás Dlask, Tomás Werner. 194-210 [doi]
- DPMC: Weighted Model Counting by Dynamic Programming on Project-Join TreesJeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi. 211-230 [doi]
- Aggregation and Garbage Collection for Online OptimizationAlexander Ek, Maria Garcia de la Banda, Andreas Schutt, Peter J. Stuckey, Guido Tack. 231-247 [doi]
- Treewidth-Aware Quantifier Elimination and Expansion for QCSPJohannes Klaus Fichte, Markus Hecher, Maximilian F. I. Kieler. 248-266 [doi]
- A Time Leap Challenge for SAT-SolvingJohannes Klaus Fichte, Markus Hecher, Stefan Szeider. 267-285 [doi]
- Breaking Symmetries with RootClique and LexTopSortJohannes Klaus Fichte, Markus Hecher, Stefan Szeider. 286-303 [doi]
- Towards Faster Reasoners by Using Transparent Huge PagesJohannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler. 304-322 [doi]
- The Argmax ConstraintGraeme Gange, Peter J. Stuckey. 323-337 [doi]
- Certifying Solvers for Clique and Maximum Common (Connected) Subgraph ProblemsStephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser, James Trimble 0001. 338-357 [doi]
- Phase Transition Behavior in Knowledge CompilationRahul Gupta, Subhajit Roy, Kuldeep S. Meel. 358-374 [doi]
- A Faster Exact Algorithm to Count X3SAT SolutionsGordon Hoi, Sanjay Jain 0001, Frank Stephan 0001. 375-391 [doi]
- Visualizations to Summarize Search BehaviorIan Howell, Berthe Y. Choueiry, Hongfeng Yu. 392-409 [doi]
- Parallelization of TSP Solving in CPNicolas Isoart, Jean-Charles Régin. 410-426 [doi]
- Using Resolution Proofs to Analyse CDCL SolversJanne I. Kokkala, Jakob Nordström. 427-444 [doi]
- Core-Guided Model ReformulationKevin Leo, Graeme Gange, Maria Garcia de la Banda, Mark Wallace 0001. 445-461 [doi]
- Filtering Rules for Flow Time Minimization in a Parallel Machine Scheduling ProblemMargaux Nattaf, Arnaud Malapert. 462-477 [doi]
- MaxSAT-Based Postprocessing for TreedepthVaidyanathan Peruvemba Ramaswamy, Stefan Szeider. 478-495 [doi]
- Perturbing Branching Heuristics in Constraint SolvingAnastasia Paparrizou, Hugues Wattez. 496-513 [doi]
- Finding the Hardest Formulas for ResolutionTomás Peitl, Stefan Szeider. 514-530 [doi]
- HADDOCK: A Language and Architecture for Decision Diagram CompilationRebecca Gentzel, Laurent Michel, Willem Jan van Hoeve. 531-547 [doi]
- Towards a Generic Interval Solver for Differential-Algebraic CSPSimon Rohou, Abderahmane Bedouhene, Gilles Chabert, Alexandre Goldsztejn, Luc Jaulin, Bertrand Neveu, Victor Reyes, Gilles Trombettoni. 548-565 [doi]
- abstractXOR: A global constraint dedicated to differential cryptanalysisLoïc Rouquette, Christine Solnon. 566-584 [doi]
- In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle ProblemNeng-Fa Zhou. 585-602 [doi]
- Large Neighborhood Search for Temperature Control with Demand ResponseEdward Lam 0001, Frits de Nijs, Peter J. Stuckey, Donald Azuatalam, Ariel Liebman. 603-619 [doi]
- Solving the Group Cumulative Scheduling Problem with CPO and ACOLucas Groleaz, Samba Ndojh Ndiaye, Christine Solnon. 620-636 [doi]
- A Branch-and-bound Algorithm to Rigorously Enclose the Round-Off ErrorsRémy Garcia, Claude Michel, Michel Rueher. 637-653 [doi]
- Leveraging Reinforcement Learning, Constraint Programming and Local Search: A Case Study in Car ManufacturingValentin Antuori, Emmanuel Hebrard, Marie-José Huguet, Siham Essodaigui, Alain Nguyen. 657-672 [doi]
- Computing the Local Aromaticity of Benzenoids Thanks to Constraint ProgrammingYannick Carissan, Chisom-Adaobi Dim, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet. 673-689 [doi]
- Using Constraint Programming to Generate Benzenoid Structures in Theoretical ChemistryYannick Carissan, Denis Hagebaum-Reignier, Nicolas Prcovic, Cyril Terrioux, Adrien Varet. 690-706 [doi]
- RobTest: A CP Approach to Generate Maximal Test Trajectories for Industrial RobotsMathieu Collet, Arnaud Gotlieb, Nadjib Lazaar, Mats Carlsson, Dusica Marijan, Morten Mossige. 707-723 [doi]
- A Two-Phase Constraint Programming Model for Examination Timetabling at University College CorkBegum Genc, Barry O'Sullivan. 724-742 [doi]
- Exact Approaches to the Multi-agent Collective Construction ProblemEdward Lam 0001, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar. 743-758 [doi]
- The Confidence Constraint: A Step Towards Stochastic CP SolversAlexandre Mercier-Aubin, Ludwig Dumetz, Jonathan Gaudreault, Claude-Guy Quimper. 759-773 [doi]
- Parity (XOR) Reasoning for the Index Calculus AttackMonika Trimoska, Sorina Ionica, Gilles Dequen. 774-790 [doi]
- Constraint-Based Software Diversification for Efficient Mitigation of Code-Reuse AttacksRodothea-Myrsini Tsoupidi, Roberto Castañeda Lozano, Benoit Baudry. 791-808 [doi]
- Pushing Data into CP Models Using Graphical Model Learning and SolvingCéline Brouard, Simon de Givry, Thomas Schiex. 811-827 [doi]
- Generating Random Logic Programs Using Constraint ProgrammingPaulius Dilkas, Vaishak Belle. 828-845 [doi]
- Towards Formal Fairness in Machine LearningAlexey Ignatiev, Martin C. Cooper, Mohamed Siala 0002, Emmanuel Hebrard, João Marques-Silva 0001. 846-867 [doi]
- Verifying Equivalence Properties of Neural Networks with ReLU Activation FunctionsMarko Kleine Büning, Philipp Kern, Carsten Sinz. 868-884 [doi]
- Learning the Satisfiability of Pseudo-Boolean Problem with Graph Neural NetworksMinghao Liu 0001, Fan Zhang, Pei Huang 0002, Shuzi Niu, Feifei Ma, Jian Zhang 0001. 885-898 [doi]
- A Machine Learning Based Splitting Heuristic for Divide-and-Conquer SolversSaeed Nejati, Ludovic Le Frioux, Vijay Ganesh. 899-916 [doi]
- Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition ModelsBuser Say, Jo Devriendt, Jakob Nordström, Peter J. Stuckey. 917-934 [doi]
- Omissions in Constraint AcquisitionDimosthenis C. Tsouros, Kostas Stergiou 0001, Christian Bessiere. 935-951 [doi]
- Computing Optimal Decision Sets with SATJinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic. 952-970 [doi]