##
Reports on Mathematical Logic

###
No. 25 (1991)

R. H. COWEN

HYPERGRAPH SATISFIABILITY
A b s t r a c t.
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.

Back to Main Menu