Sciweavers

942 search results - page 82 / 189
» Cooperating Constraint Solvers
Sort
View
ICTAI
2007
IEEE
16 years 17 days ago
Adaptive Lookahead for Answer Set Computation
Lookahead is a well-known constraint propagation technique for DPLL-based SAT and answer set solvers. Despite its space pruning power, it can also slow down the search, due to its...
Guohua Liu, Jia-Huai You
SAT
2004
Springer
106views Hardware» more  SAT 2004»
15 years 11 months ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski
FMCAD
2006
Springer
15 years 10 months ago
Finite Instantiations for Integer Difference Logic
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
Hyondeuk Kim, Fabio Somenzi
AAAI
1990
15 years 7 months ago
Exploiting Locality in a TMS
This paper presents a new approach for exploiting Truth Maintenance Systems(TMSs) which makes them simpler to use without necessarily incurring a substantial performance penalty. ...
Johan de Kleer
JMLR
2006
125views more  JMLR 2006»
15 years 6 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss