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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,140

External links

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

Through your library

Similar books and articles

Decidable fragments of first-order modal logics.Frank Wolter & Michael Zakharyaschev - 2001 - Journal of Symbolic Logic 66 (3):1415-1438.
Guards, Bounds, and generalized semantics.Johan van Benthem - 2005 - Journal of Logic, Language and Information 14 (3):263-279.
Satisfiability on hypergraphs.Adam Kolany - 1993 - Studia Logica 52 (3):393-404.

Analytics

Added to PP
2010-08-24

Downloads
10 (#889,346)

6 months
1 (#447,993)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references