By Topic

A Tree Decomposition Based Approach to Solve Structured SAT Instances

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
$33 $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)
Habet, D. ; LSIS, Univ. Paul Cezanne, Marseille, France ; Paris, L. ; Terrioux, C.

The main purpose of the paper is to solve structured instances of the satisfiability problem. The structure of a SAT instance is represented by an hypergraph, whose vertices correspond to the variables and the hyper-edges to the clauses. The proposed method is based on a tree decomposition of this hyper-graph which guides the enumeration process of a DPLL-like method. During the search, the method makes explicit some information which is recorded as structural goods and nogoods. By exploiting this information, the method avoids some redundancies in the search, and so it guarantees a bounded theoretical time complexity which is related to the tree-decomposition. Finally, the method is assessed on structured SAT benchmarks.

Published in:

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

Date of Conference:

2-4 Nov. 2009