Algorithms for the Satisfiability (SAT) Problem

Jun Gu (), Paul W. Purdom (), John Franco () and Benjamin W. Wah ()
Additional contact information
Jun Gu: University of Calgary, Dept. of Electrical and Computer Engineering
Paul W. Purdom: Indiana University, Dept. of Computer Science
John Franco: University of Cincinnati, Dept. of Computer Science
Benjamin W. Wah: Univ. of Illinois at Urbana-Champaign, Dept. of Electrical and Computer Engineering

A chapter in Handbook of Combinatorial Optimization, 1999, pp 379-572 from Springer

Abstract: Abstract An instance of the satisfiability (SAT) problem is a Boolean formula that has three components [102, 191]: A set of n variables: x 1, x 2, x n . A set of literals. A literal is a variable (Q = x) or a negation of a variable $$ \left( {Q = \bar x} \right)$$ . A set of m distinct clauses: C 1, C 2, ..., C m. Each clause consists of only literals combined by just logical or (V) connectives.

Keywords: Local Search; Constraint Satisfaction Problem; Local Search Algorithm; Conjunctive Normal Form; Disjunctive Normal Form (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-3023-4_7

Ordering information: This item can be ordered from
http://www.springer.com/9781475730234

DOI: 10.1007/978-1-4757-3023-4_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().