Satisfiability testing for Boolean formulas using \(\Delta\)-trees (Q1863824)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Satisfiability testing for Boolean formulas using \(\Delta\)-trees |
scientific article; zbMATH DE number 1880451
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Satisfiability testing for Boolean formulas using \(\Delta\)-trees |
scientific article; zbMATH DE number 1880451 |
Statements
Satisfiability testing for Boolean formulas using \(\Delta\)-trees (English)
0 references
12 March 2003
0 references
data structures
0 references
automated deduction
0 references
propositional formulas
0 references
\(\Delta\)-trees
0 references
negation normal forms
0 references
satisfiability
0 references
reduction strategies
0 references
size of search space
0 references
0.89107716
0 references
0.8901664
0 references
0.8752183
0 references
0.86581314
0 references
