Searching for "Incompleteness in Linear Time." – sorted by Relevance.
-
Model-Theoretic Semantics and Tractable Algorithm for CNF-BCP
- ), is widely used for incomplete linear-time reasoning with clausal propositional theories. However, all
- Cited by 1 (0 self) – Add To MetaCart
-
State
- variant of unit resolution [McAllester, 1990]. BCP is a sound, but incomplete linear-time reasoner
- Add To MetaCart

