Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ISMIS
1999
Springer

favoriteEmaildiscussreport

106views Artificial Intelligence» more ISMIS 1999»

Improving Backtrack Search for SAT by Means of Redundancy

13 years 8 months ago

Improving Backtrack Search for SAT by Means of Redundancy

Download www.cril.univ-artois.fr

In this paper, a new heuristic that can be grafted to many of the most e cient branching strategies for Davis and Putnam procedures for SAT is described. This heuristic gives a higher weight to clauses that have been shown unsatis able at some previous steps of the search process. It is shown e cient for many classes of SAT instances, in particular structured ones.

Laure Brisoux, Éric Grégoire, Lakhda

Real-time Traffic

Artificial Intelligence | Cient Branching Strategies | Heuristic | ISMIS 1999 | Particular Structured Ones |

claim paper

Related Content

» Heuristic Backtracking Algorithms for SAT

» Improving Firstorder Model Searching by Propositional Reasoning and Lemma Learning

» Eliminating Redundancies in SAT Search Trees

» Using SAT in QBF

» Unrestricted Nogood Recording in CSP Search

» Answer Set Programming with Clause Learning

» Local and Global Complete Solution Learning Methods for QBF

» Applying Local Search to Temporal Reasoning

» Algorithmics in Exponential Time

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	ISMIS
Authors	Laure Brisoux, Éric Grégoire, Lakhdar Sais

Comments (0)