Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics. The aim of this handbook is to capture the full breadth and depth of the constraint programming field and to be encyclopedic in its scope and coverage. While there are several excellent books...
Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intel...
Research in propositional and quantified Boolean formula satisfiability testing is covered. This book also includes information on proof systems, search techniques, probabilistic analysis of algorithms and their properties, problem encodings, industrial applications, specific tools, case studies, and empirical results.
Research in propositional and quantified Boolean formula satisfiability testing is covered. This book also includes information on proof systems, sear...
This book constitutes the refereed proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, CP 2001, held in Paphos, Cyprus, in November/December 2001. The 37 revised full papers, 9 innovative applications presentations, and 14 short papers presented were carefully reviewed and selected from a total of 135 submissions. All current issues in constraint processing are addressed, ranging from theoretical and foundational issues to advanced and innovative applications in a variety of fields.
This book constitutes the refereed proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, CP 2001, held...
This book is devoted to recent progress made in solving propositional satisfiability and related problems. Propositional satisfiability is a powerful and general formalism used to solve a wide range of important problems including hardware and software verification. The core of many reasoning problems in automated deduction are propositional. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. In 1957, Allen Newell and Herb Simon introduced the Logic Theory Machine to prove propositional theorems from Whitehead and Russel's "Principia...
This book is devoted to recent progress made in solving propositional satisfiability and related problems. Propositional satisfiability is a powerf...
This book is devoted to recent progress made in solving propositional satisfiability and related problems. Propositional satisfiability is a powerful and general formalism used to solve a wide range of important problems including hardware and software verification. The core of many reasoning problems in automated deduction are propositional. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. In 1957, Allen Newell and Herb Simon introduced the Logic Theory Machine to prove propositional theorems from Whitehead and Russel's "Principia...
This book is devoted to recent progress made in solving propositional satisfiability and related problems. Propositional satisfiability is a powerf...
This book constitutes the thoroughly refereed conference proceedings of the 4th International Conference on Algorithmic Decision Theory , ADT 2015, held in September 2015 in Lexington, USA. The 32 full papers presented were carefully selected from 76 submissions. The papers are organized in topical sections such as preferences;
This book constitutes the thoroughly refereed conference proceedings of the 4th International Conference on Algorithmic Decision Theory , ADT 2015, he...
This book constitutes the refereed proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, held in Melbourne, Australia, in August/September 2017. The 22 revised full papers, 5 short papers, and 3 tool papers were carefully reviewed and selected from 64 submissions. The papers are organized in the following topical sections: algorithms, complexity, and lower bounds; clause learning and symmetry handling; maximum satisfiability and minimal correction sets; parallel SAT solving; quantified Boolean formulas; satisfiability modulo...
This book constitutes the refereed proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, he...
