A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Some Connections Between Set Theory and Computer Science
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
Hi-index | 0.00 |
Two set systems E, F on an underlying set V will be said to have Property S if there exists a subset σ of V , such that σ∩ e ≠Ø, for all e ∈ E and f ⊈σ, for all f ∈ F (see [8], [9]]). We give rules for deciding Property S, which generalizes the very successful Davis-Putnam rules for deciding satisfiability in propositional logic.