Sciweavers

101 search results - page 2 / 21
» Understanding the Power of Clause Learning
Sort
View
AAAI
2010
13 years 6 months ago
A Restriction of Extended Resolution for Clause Learning SAT Solvers
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretical...
Gilles Audemard, George Katsirelos, Laurent Simon
IEAAIE
2005
Springer
13 years 10 months ago
Inferring Definite-Clause Grammars to Express Multivariate Time Series
In application domains such as medicine, where a large amount of data is gathered, a medical diagnosis and a better understanding of the underlying generating process is an aim. Re...
Gabriela Guimarães, Luís Moniz Perei...
SAT
2009
Springer
113views Hardware» more  SAT 2009»
13 years 11 months ago
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
Albert Atserias, Johannes Klaus Fichte, Marc Thurl...
AAAI
2008
13 years 7 months ago
On the Power of Top-Down Branching Heuristics
We study the relative best-case performance of DPLL-based structure-aware SAT solvers in terms of the power of the underlying proof systems. The systems result from (i) varying th...
Matti Järvisalo, Tommi A. Junttila
CP
2003
Springer
13 years 10 months ago
Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search
Abstract. In 1997 we presented ten challenges for research on satisfiability testing [1]. In this paper we review recent progress towards each of these challenges, including our o...
Henry A. Kautz, Bart Selman