Sciweavers

193 search results - page 35 / 39
» sat 2007
Sort
View
ICTAI
2007
IEEE
15 years 3 months 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
MEMOCODE
2007
IEEE
15 years 3 months ago
Combining Multi-Valued Logics in SAT-based ATPG for Path Delay Faults
Due to the rapidly growing speed and the decreasing size of gates in modern chips, the probability of faults caused by the production process grows. Already small variations lead ...
Stephan Eggersglüß, Görschwin Fey,...
ATVA
2007
Springer
108views Hardware» more  ATVA 2007»
15 years 3 months ago
A New Approach to Bounded Model Checking for Branching Time Logics
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
Rotem Oshman, Orna Grumberg
CP
2007
Springer
15 years 3 months ago
Limitations of Restricted Branching in Clause Learning
The techniques for making decisions, i.e., branching, play a central role in complete methods for solving structured CSP instances. In practice, there are cases when SAT solvers be...
Matti Järvisalo, Tommi A. Junttila
CSCLP
2007
Springer
15 years 3 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth