151 search results - page 28 / 31 » Propagation in CSP and SAT |
AAAI
2008
13 years 10 months ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
AI
2010
Springer
13 years 7 months ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
SUTC
2010
IEEE
13 years 11 months ago
2010
IEEE
Because radio waves decay rapidly in sea water, acoustic communication is the most popular choic for underwater sensor networks. However, since the propagation speed of acoustic w...
CP
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
CP
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...