BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas
Notre Dame Journal of Formal Logic 34 (4):602-606 (1993)
Abstract
This article has no associated abstract. (fix it)DOI
10.1305/ndjfl/1093633909
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Conservative reduction classes of Krom formulas.Stål O. Aanderaa, Egon Börger & Harry R. Lewis - 1982 - Journal of Symbolic Logic 47 (1):110-130.
Satisfiability testing for Boolean formulas using δ-trees.G. Gutiérrez, I. P. de Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde - 2002 - Studia Logica 72 (1):85 - 112.
Decidable fragments of first-order modal logics.Frank Wolter & Michael Zakharyaschev - 2001 - Journal of Symbolic Logic 66 (3):1415-1438.
Theory and Applications of Satisfiability Testing: 7th International Conference, Sat 2004, Vancouver, Bc, Canada, May 10-13, 2004: Revised Selected Papers. [REVIEW]Holger H. Hoos & David G. Mitchell (eds.) - 2005 - Springer.
Theory and Applications of Satisfiability Testing: 8th International Conference, Sat 2005, St Andrews, Uk, June 19-23, 2005: Proceedings. [REVIEW]Fahiem Bacchus & Toby Walsh (eds.) - 2005 - Springer.
Guards, Bounds, and generalized semantics.Johan van Benthem - 2005 - Journal of Logic, Language and Information 14 (3):263-279.
Complexity Results for Modal Dependence Logic.Peter Lohmann & Heribert Vollmer - 2013 - Studia Logica 101 (2):343-366.
A reduction class containing formulas with one monadic predicate and one binary function symbol.Charles E. Hughes - 1976 - Journal of Symbolic Logic 41 (1):45-49.
A modal perspective on the computational complexity of attribute value grammar.Patrick Blackburn & Edith Spaan - 1993 - Journal of Logic, Language and Information 2 (2):129-169.
A tableau method for graded intersections of modalities: A case for concept languages. [REVIEW]Ani Nenkova - 2002 - Journal of Logic, Language and Information 11 (1):67-77.
On the expressiveness of frame satisfiability and fragments of second-order logic.Thomas Eiter & Georg Gottlob - 1998 - Journal of Symbolic Logic 63 (1):73-82.
Analytics
Added to PP
2010-08-24
Downloads
10 (#889,346)
6 months
1 (#447,993)
2010-08-24
Downloads
10 (#889,346)
6 months
1 (#447,993)
Historical graph of downloads
Citations of this work
Partition-based logical reasoning for first-order and propositional theories.Eyal Amir & Sheila McIlraith - 2005 - Artificial Intelligence 162 (1-2):49-88.
