Davis-Putnam Style Rules for Deciding Property S

Authors:
Robert Cowen;Adam Kolany
Affiliations:
Mathematics Department, Queens College, CUNY Flushing, NY 11367, USA;Theoretical Computer Science Department, Jagiellonian University, Gronostajowa 3, 30-072 Kraków, Poland
Venue:
Fundamenta Informaticae
Year:
2007

Citing 3
Cited 0

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two set systems E, F on an underlying set V will be said to haveProperty 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 rulesfor deciding Property S, which generalizes the very successfulDavis-Putnam rules for deciding satisfiability in propositionallogic.