BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas

&
Notre Dame Journal of Formal Logic 34 (4):602-606 (1993)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093633909

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

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.Holger H. Hoos & David G. Mitchell (eds.) - 2005 - New York: Springer.
Theory and applications of satisfiability testing: 8th international conference, SAT 2005, St Andrews, UK, June 19-23, 2005: proceedings.Fahiem Bacchus & Toby Walsh (eds.) - 2005 - New York: Springer.
Guards, Bounds, and generalized semantics.Johan van Benthem - 2005 - Journal of Logic, Language and Information 14 (3):263-279.
Geoff Sutcliffe.Francis Jeffry Pelletier - unknown
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.
Satisfiability on hypergraphs.Adam Kolany - 1993 - Studia Logica 52 (3):393-404.
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
15 (#923,100)

6 months
4 (#790,687)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Add more citations

References found in this work

No references found.

Add more references