34 search results - page 3 / 7 » The Representational Power of Conjunctive Normal Form |
DDECS
2007
IEEE
13 years 11 months ago
2007
IEEE
— Recently, there is a renewed interest in Automatic Test Pattern Generation (ATPG) based on Boolean Satisfiability (SAT). This results from the availability of very powerful SA...
IJCAI
2007
13 years 6 months ago
2007
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
PPDP
2009
Springer
13 years 12 months ago
2009
Springer
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
DAC
2009
ACM
14 years 6 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
SAT
2009
Springer
13 years 12 months ago
2009
Springer
State-of-the-art solvers for Quantified Boolean Formulas (QBF) have employed many techniques from the field of Boolean Satisfiability (SAT) including the use of Conjunctive Norm...