276 search results - page 20 / 56 » Constraint Propagation as a Proof System |
ERSHOV
1999
Springer
13 years 12 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
AAAI
1997
13 years 9 months ago
1997
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
FROCOS
2000
Springer
13 years 11 months ago
2000
Springer
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
FM
2009
Springer
14 years 2 months ago
2009
Springer
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
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...