- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
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)Author's Profile
Other Versions
No versions found
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
A Generalization of the Satisfiability Coding Lemma and Its Applications.Milan Mossé, Harry Sha & Li-Yang Tan - 2022 - 25Th International Conference on Theory and Applications of Satisfiability Testing 236:1-18.
Matrix satisfiability and axiomatization.Robert Ackermann - 1971 - Notre Dame Journal of Formal Logic 12 (3):309-321.
Satisfiability in a larger domain.R. L. Goodstein - 1974 - Notre Dame Journal of Formal Logic 15 (4):598-600.
More on trees and finite satisfiability: the taming of terms.Miodrag Kapetanović & Aleksandar Krapež - 1987 - Notre Dame Journal of Formal Logic 28 (3):392-394.
Some examples of different methods of formal proofs with generalizations of the satisfiability definition.Juliusz Reichbach - 1969 - Notre Dame Journal of Formal Logic 10 (2):214-224.
Trees and finite satisfiability: proof of a conjecture of Burgess.George Boolos - 1984 - Notre Dame Journal of Formal Logic 25 (3):193-197.
Some preservation results for classical and intuitionistic satisfiability in Kripke models.Zoran Marković - 1983 - Notre Dame Journal of Formal Logic 24 (3):395-398.
Recognizable algebras of formulas.John Grant - 1972 - Notre Dame Journal of Formal Logic 13 (4):521-526.
Partially generic formulas in arithmetic.Per Lindström - 1988 - Notre Dame Journal of Formal Logic 29 (2):185-192.
On generating the finitely satisfiable formulas.Arthur M. Bullock & Hubert H. Schneider - 1973 - Notre Dame Journal of Formal Logic 14 (3):373-376.
Analytics
Added to PP
2010-08-24
Downloads
24 (#894,641)
6 months
6 (#812,813)
2010-08-24
Downloads
24 (#894,641)
6 months
6 (#812,813)
Historical graph of downloads
Author's Profile
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.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7f8ff5d46-qj788 uwo