Principles and Practice of Constraint Programming – CP 2003

DOI10.1007/b13743zbMath1273.68332OpenAlexW2497660909MaRDI QIDQ5897193

Yacine Boufkhad, Olivier Bailleux

Publication date: 2 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13743

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology, On an MCS-based inconsistency measure, Exploiting Resolution-Based Representations for MaxSAT Solving, A SAT encoding to compute aperiodic tiling rhythmic canons, An efficient approach to solving random \(k\)-SAT problems, Some computational aspects of DISTANCE SAT, Solving satisfiability problems with preferences, Weighted positive binary decision diagrams for exact probabilistic inference, WPM3: an (in)complete algorithm for weighted partial MaxSAT, An efficient strategy to construct a better differential on multiple-branch-based designs: application to Orthros, Computing optimal hypertree decompositions with SAT, Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems, Sorting nine inputs requires twenty-five comparisons, Exact and approximate determination of the Pareto front using minimal correction subsets, A Boolean satisfiability approach to the resource-constrained project scheduling problem, QMaxSATpb: a certified MaxSAT solver, GAC Via Unit Propagation, Towards Robust CNF Encodings of Cardinality Constraints, Curriculum-based course timetabling with SAT and MaxSAT, Resizing cardinality constraints for MaxSAT, On preprocessing for weighted MaxSAT, Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions, Cardinality networks: a theoretical and empirical study, \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT, Propagation via lazy clause generation, A lower bound on CNF encodings of the at-most-one constraint, Cardinality Networks and Their Applications, New Encodings of Pseudo-Boolean Constraints into CNF, SAT encodings for pseudo-Boolean constraints together with at-most-one constraints, Boolean satisfiability in quantum compilation, Multi-agent path finding with mutex propagation, On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving, Hard satisfiable 3-SAT instances via autocorrelation, Iterative and core-guided maxsat solving: a survey and assessment, Learning Optimal Decision Sets and Lists with SAT, Set constraint model and automated encoding into SAT: application to the social golfer problem

Uses Software

• Chaff