Switch to: References

Citations of:

Satisfiability on hypergraphs

Studia Logica 52 (3):393-404 (1993)

Add citations

You must login to add citations.

Reversed Resolution in Reducing General Satisfiability Problem.Adam Kolany - 2010 - Studia Logica 95 (3):407-416.details In the following we show that general property S considered by Cowen [1], Cowen and Kolany in [3] and earlier by Cowen in [2] and Kolany in [4] as hypergraph satisfiability, can be constructively reduced to (3, 2) · SAT , that is to satisfiability of (at most) triples with two-element forbidden sets. This is an analogue of the“classical” result on the reduction of SAT to 3 · SAT. Download Export citation Bookmark
Generalized Davis-Putnam and satisfiability problems in mathematics.Robert Cowen - 2010 - Logic Journal of the IGPL 18 (3):456-463.details The well-known Davis-Putnam Procedure used to decide the Sat Problem in Logic is shown to be combinatorial in nature and thus directly applicable to solving various Mathematical “Satisfiability” Problems. Download Export citation Bookmark
Consequence Operations Based on Hypergraph Satisfiability.Kolany Adam - 1997 - Studia Logica 58 (2):261-272.details Four consequence operators based on hypergraph satisfiability are defined. Their properties are explored and interconnections are displayed. Finally their relation to the case of the Classical Propositional Calculus is shown. Download Export citation Bookmark

1