Sciweavers

749 search results - page 55 / 150
» Dualities for Constraint Satisfaction Problems
Sort
View
TIME
2002
IEEE
15 years 3 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
15 years 9 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
15 years 23 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
15 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
CP
2006
Springer
15 years 2 months ago
Propagation in CSP and SAT
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
Yannis Dimopoulos, Kostas Stergiou