400 search results - page 26 / 80 » Backtracking |
134
click to vote
CP
2007
Springer
16 years 20 days ago
2007
Springer
In this paper we argue that an attractive and potentially very general way of achieving generalized arc consistency (GAC) on a constraint is by using unit propagation (UP) over a C...
127
click to vote
CP
2007
Springer
16 years 20 days 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...
178
click to vote
CCECE
2006
IEEE
16 years 16 days ago
2006
IEEE
Several approaches have been proposed to accelerate the NP-complete Boolean Satisfiability problem (SAT) using reconfigurable computing. We present an FPGA based clause evaluator,...
153
click to vote
CAV
2004
Springer
15 years 12 months ago
2004
Springer
The logic of equality with uninterpreted functions (EUF) and its extensions have been widely applied to processor verification, by means of a large variety of progressively more s...
158
click to vote
ICTAI
2003
IEEE
15 years 11 months ago
2003
IEEE
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...