By Topic

Local Autarkies Searching for the Dynamic Partition of CNF Formulae

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gregoire, E. ; CRIL-CNRS, Univ. Lille-Nord de France, Lens, France ; Mazure, B. ; Sais, L.

In this paper an original dynamic partition of formulae in conjunctive normal form (CNF) is presented. It is based on the autarky concept first introduced by Monien and Speckenmeyer and further investigated by Kullmann and Van Gelder. Intuitively, an autarky is a partial assignment satisfying some clauses while not affecting any literal in any other clause, leading to a partition of the CNF formula. Autarkies can play a dramatic role in the efficiency of modern SAT solvers. The approach in this paper aims to dynamically extend the current partial assignment to a local autarky thanks to an inference rule based on unit propagation. More precisely, at each node of the search tree, it is checked whether the current decision literal can be made monotone by subsuming all the clauses where it appears negatively. The formal framework is detailed and its technical features discussed.

Published in:

Tools with Artificial Intelligence, 2009. ICTAI '09. 21st International Conference on

Date of Conference:

2-4 Nov. 2009