Hypergraph Satisfiability

Reports on Mathematical Logic (1991)
  Copy   BIBTEX

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.

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,010

External links

  • This entry has no external links. Add one.
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

Consequence Operations Based on Hypergraph Satisfiability.Kolany Adam - 1997 - Studia Logica 58 (2):261-272.
Combinatorial Analytic Tableaux.Robert Cowen - 1993 - Reports on Mathematical Logic:29-39.
Reversed Resolution in Reducing General Satisfiability Problem.Adam Kolany - 2010 - Studia Logica 95 (3):407-416.
Satisfiability on hypergraphs.Adam Kolany - 1993 - Studia Logica 52 (3):393-404.
Property S.Robert Cowen - 2001 - Reports on Mathematical Logic:61-74.
Pool resolution is NP-hard to recognize.Samuel R. Buss - 2009 - Archive for Mathematical Logic 48 (8):793-798.
On α-satisfiability and its α-lock resolution in a finite lattice-valued propositional logic.Xingxing He, Jun Liu, Yang Xu, Luis Martínez & Da Ruan - 2012 - Logic Journal of the IGPL 20 (3):579-588.
Introduction to Mathematics of Satisfiability.Victor W. Marek - 2009 - Taylor & Francis.
Two notions of compactness in Gödel logics.Petr Cintula - 2005 - Studia Logica 81 (1):99-123.
Propositional Logic: Deduction and Algorithms.Anthony Hunter - 1999 - Cambridge University Press.

Analytics

Added to PP
2015-02-12

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references