Sciweavers

714 search results - page 53 / 143
» Lexicographically-ordered constraint satisfaction problems
Sort
View
AAAI
2006
14 years 17 days ago
Constraint Symmetry and Solution Symmetry
Symmetry in constraint satisfaction problems (CSPs) has been considered in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or as an o...
David A. Cohen, Peter Jeavons, Christopher Jeffers...
TIME
2002
IEEE
14 years 4 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
AAAI
1996
14 years 15 days ago
Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
Subbarao Kambhampati
ECAI
2008
Springer
14 years 28 days ago
The Impact of Constraint Programming
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
Pascal Van Hentenryck
CP
2005
Springer
14 years 4 months ago
Encoding HTN Planning as a Dynamic CSP
Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...
Pavel Surynek, Roman Barták