Sciweavers

20 search results - page 3 / 4
» Finite Domain Constraint Solver Learning
Sort
View
ECAI
2006
Springer
13 years 9 months ago
Automatic Generation of Implied Constraints
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
John Charnley, Simon Colton, Ian Miguel
CP
2010
Springer
13 years 3 months ago
A Complete Multi-valued SAT Solver
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
Siddhartha Jain, Eoin O'Mahony, Meinolf Sellmann
AIPS
2011
12 years 9 months ago
Cross-Domain Action-Model Acquisition for Planning via Web Search
Applying learning techniques to acquire action models is an area of intense research interest. Most previous works in this area have assumed that there is a significant amount of...
Hankz Hankui Zhuo, Qiang Yang, Rong Pan, Lei Li
JNSM
2008
130views more  JNSM 2008»
13 years 5 months ago
Declarative Infrastructure Configuration Synthesis and Debugging
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
Sanjai Narain, Gary Levin, Sharad Malik, Vikram Ka...
CSCLP
2006
Springer
13 years 9 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan