A satisfiability tester for non-clausal propositional calculus (Q1111774)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4076675
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A satisfiability tester for non-clausal propositional calculus |
scientific article; zbMATH DE number 4076675 |
Statements
A satisfiability tester for non-clausal propositional calculus (English)
0 references
1988
0 references
An algorithm for satisfiability testing in propositional calculus with worst case complexity \(2^{(0.25+\epsilon)L}\) is presented, where L can be either the length of the input or the number of occurrences of literals in the expression. The algorithm proceeds by a careful choice of the ``branch'' variable and has the important feature that it does not need the testing expression to be in any normal form.
0 references
divide and conquer algorithm
0 references
algorithm for satisfiability testing
0 references
propositional calculus
0 references
0.8366081118583679
0 references
0.8275346755981445
0 references
0.8200444579124451
0 references
