Abstract
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.
Similar content being viewed by others
References
COWEN, R. H., 1991, “Hypergraph satisfiability”, Reports on Mathematical Logic 24, 113-118.
COWEN, R. H., 1993, “Combinatorial Analytic Tableaux”, Reports on Mathematical Logic 27, 29-39.
KOLANY, A., 1993, “Satisfiability on hypergraphs”, Studia Logica 52, 393-404.
LINIAL, N., M. TARSI, 1985, “Deciding hypergraph 2-colorability by H-resolution”, Theoretical Computer Science 38, 343-347.
Rights and permissions
About this article
Cite this article
Kolany, A. Consequence Operations Based on Hypergraph Satisfiability. Studia Logica 58, 261–272 (1997). https://doi.org/10.1023/A:1004923723916
Issue Date:
DOI: https://doi.org/10.1023/A:1004923723916