Satisfiability solvers
Publisher Summary The past few years have seen enormous progress in the performance of
Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known …
Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known …
Symmetry in constraint programming
Publisher Summary This chapter reviews that symmetry in constraints has always been
important but in recent years has become a major research area in its own right. A key …
important but in recent years has become a major research area in its own right. A key …
[图书][B] Handbook of constraint programming
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …
that draws on a wide range of techniques from artificial intelligence, computer science …
[图书][B] Handbook of knowledge representation
Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Pairwise symmetry reasoning for multi-agent path finding search
Abstract Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem that asks
us to plan collision-free paths for a team of cooperative agents. In this work, we show that …
us to plan collision-free paths for a team of cooperative agents. In this work, we show that …
Certified dominance and symmetry breaking for combinatorial optimisation
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and
optimisation problems, but the correctness of these techniques sometimes relies on subtle …
optimisation problems, but the correctness of these techniques sometimes relies on subtle …
Exploiting structure in symmetry detection for CNF
PT Darga, MH Liffiton, KA Sakallah… - Proceedings of the 41st …, 2004 - dl.acm.org
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design
and verification. These instances are typically constructed from some human-designed …
and verification. These instances are typically constructed from some human-designed …
Certified symmetry and dominance breaking for combinatorial optimisation
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and
optimisation problems, but the correctness of these techniques sometimes relies on subtle …
optimisation problems, but the correctness of these techniques sometimes relies on subtle …
Predicate logic as a modeling language: the IDP system
Since the early days of artificial intelligence, it has been believed that logic could bring
important benefits in solving computational problems and tasks compared to standard …
important benefits in solving computational problems and tasks compared to standard …
The resolution of Keller's conjecture
We consider three graphs, G 7, 3, G 7, 4, and G 7, 6, related to Keller's conjecture in
dimension 7. The conjecture is false for this dimension if and only if at least one of the …
dimension 7. The conjecture is false for this dimension if and only if at least one of the …