Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I (Q2508787)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I |
scientific article |
Statements
Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I (English)
0 references
20 October 2006
0 references
reactive algorithms
0 references
specification
0 references
formula satisfiability
0 references
depth of formula
0 references
set of conjuncts
0 references
0 references
