Constraint programming
F Rossi, P Van Beek, T Walsh - Foundations of Artificial Intelligence, 2008 - Elsevier
Publisher Summary Constraint programming is a powerful paradigm for solving
combinatorial search problems that draws on a wide range of techniques from artificial …
combinatorial search problems that draws on a wide range of techniques from artificial …
Propositional satisfiability and constraint programming: A comparative survey
Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two
relatively independent threads of research cross-fertilizing occasionally. These two …
relatively independent threads of research cross-fertilizing occasionally. These two …
Conflict-driven clause learning SAT solvers
One of the most important paradigm shifts in the use of SAT solvers for solving industrial
problems has been the introduction of clause learning. Clause learning entails adding a …
problems has been the introduction of clause learning. Clause learning entails adding a …
[图书][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 …
Temporal constraint networks
This paper extends network-based methods of constraint satisfaction to include continuous
variables, thus providing a framework for processing temporal constraints. In this framework …
variables, thus providing a framework for processing temporal constraints. In this framework …
[图书][B] Constraint processing
R Dechter - 2003 - books.google.com
This book provides a comprehensive and much needed introduction to the field by one of its
foremost experts. It is beautifully written and presents a unifying framework capturing a wide …
foremost experts. It is beautifully written and presents a unifying framework capturing a wide …
GRASP: A search algorithm for propositional satisfiability
JP Marques-Silva, KA Sakallah - IEEE Transactions on …, 1999 - ieeexplore.ieee.org
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a
new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several …
new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several …
GRASP-a new search algorithm for satisfiability
JPM Silva, KA Sakallah - Proceedings of International …, 1996 - ieeexplore.ieee.org
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an
integrated algorithmic framework for SAT that unifies several previously proposed search …
integrated algorithmic framework for SAT that unifies several previously proposed search …
Metaheuristics: A bibliography
Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …
the last two decades. They have had widespread successes in attacking a variety of difficult …