- 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
Hypergraph Satisfiability
Abstract
A notion of satisfiability is defined for collections of vertex sets of a hypergraph and a method for determining satisfiability, called resolution, is introduced. An important special case is the resolution technique for determining satisfiability of a set of clauses in propositional logic.My notes
Similar books and articles
Analytics
Added to PP
2015-02-12
Downloads
0
6 months
0
2015-02-12
Downloads
0
6 months
0
Historical graph of downloads
Sorry, there are not enough data points to plot this chart.
Citations of this work
Consequence Operations Based on Hypergraph Satisfiability.Kolany Adam - 1997 - Studia Logica 58 (2):261-272.
Reversed Resolution in Reducing General Satisfiability Problem.Adam Kolany - 2010 - Studia Logica 95 (3):407-416.
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-5ff6c685cb-rv6xt uwo