Dynamic Flexible Constraint Satisfaction and its Application to AI Planning (2001)

Cached

Download Links

by Ian Miguel
Citations:19 - 5 self

Active Bibliography

4 Hard, flexible and dynamic constraint satisfaction – Ian Miguel, Qiang Shen - 1999
Réseaux De Contraintes – Thomas Schiex - 2000
160 Improvements To Propositional Satisfiability Search Algorithms – Jon William Freeman - 1995
28 Backtracking algorithms for constraint satisfaction problems – Rina Dechter, Daniel Frost - 1999
37 Backjump-based Backtracking for Constraint Satisfaction Problems – Rina Dechter, Daniel Frost - 2002
941 Constraint Networks – Rina Dechter - 1992
50 Resolution versus Search: Two Strategies for SAT – Irina Rish, Rina Dechter - 2000
Chapter 7 Combining Search and Inference; – unknown authors
5 Tractable structures for constraint satisfaction problems – Rina Dechter - 2006
Processing probabilistic and deterministic graphical models – Rina Dechter - 2013
3 Representation and Reasoning with Non-Binary Constraints – Kostas Stergiou - 2001
47 Intelligent Backtracking On Constraint Satisfaction Problems: Experimental And Theoretical Results – Andrew B. Baker - 1995
7 Efficient flexible planning via dynamic flexible constraint satisfaction – Ian Miguel, Qiang Shen, Peter Jarvis - 2001
94 Bridging the gap between planning and scheduling – David E. Smith, Jeremy Frank, Ari K. Jónsson
368 Algorithms for Constraint Satisfaction Problems: A Survey – Vipin Kumar - 1992
Consistency Techniques in Constraint Networks – Yuanlin Zhang - 2003
Bounding Inference: mini-bucket and mini-clustering schemes – n.n.
Chapter 4 Constraint Programming – Edited F. Van Harmelen, V. Lifschitz, B. Porter, Francesca Rossi, Peter Van Beek, Toby Walsh
Constraint Programming – The Constraint Programming Working Group - 1996