Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Davis-Putnam Style Rules for Deciding Property S

Cowen R., Kolany A.

Fundamenta Informaticae

2007

Vol. 79, nr 1-2

5-15

Two set systems E, F on an underlying set V will be said to have Property S if there exists a subset [sigma] of V, such that [formula] (see [8], [9]). We give rules for deciding Property S, which generalizes the very successful Davis-Putnam rules for deciding satisfiability in propositional logic.

Property S

Cowen R.

Reports on Mathematical Logic

2001

No. 35

61-74

A set-theoretic property called Property S is introduced as a generalization of the well-known Property B. Property S is named for Schrijver who first used it in a paper [13] in connection with the Boolean prime ideal theorem. It was independently introduced by Kolany [10] to give a uniform treatment for a variety of satisfiability problems using an abstract resolution method to determine satisfiability. We further investigate Property S and resolution.

A compactness theorem for infinite constraint satisfaction

Cowen R.

Reports on Mathematical Logic

1998

No. 32

97-107

A useful compactness theorem for constraint satisfaction problems is proved equivalent to BPI, the Boolean Prime Ideal Theorem. The relation of various restricted versions of the Theorem to each other and to BPI is also explored.