Add to ORKGA general mechanism to extend decision algorithms to deal with additional predicates is described. The only conditions imposed on the predicates is stability with respect to some transitive relations
We propose a tableau-like decision procedure for deciding the satisfiability of set-theoretical for...
AbstractWe consider McCarthy's notions of predicate circumscription and formula circumscription. We ...
As proved recently. the satisfaction problem for all prenex formulae in the set-theoretic Bernays-Sh...
A general mechanism to extend decision algorithms to deal with additional predicates is described. T...
A general mechanism to extend decision algorithms to deal with additional predicates is described. T...
An extension of results on the decidability of classes of formulas in set theory is proved. In parti...
This paper surveys various decidability results in the set theory. In the first part, we focus on ce...
Some extension of results on the decidability of classes of formulas in set theory is proved. In pa...
Positive solutions to the decision problem for a class of quantified formulae of the first order set...
In 1985, van den Dries showed that the theory of the reals with a predicate for the integer powers o...
The problem is addressed of establishing the satisfiability of prenex formulas involving a single un...
The aim of these lectures is to give a clear and explicit overview of the most important decidable a...
AbstractIn 1985, van den Dries showed that the theory of the reals with a predicate for the integer ...
85 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.Given an (undecidable) element...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
We propose a tableau-like decision procedure for deciding the satisfiability of set-theoretical for...
AbstractWe consider McCarthy's notions of predicate circumscription and formula circumscription. We ...
As proved recently. the satisfaction problem for all prenex formulae in the set-theoretic Bernays-Sh...
A general mechanism to extend decision algorithms to deal with additional predicates is described. T...
A general mechanism to extend decision algorithms to deal with additional predicates is described. T...
An extension of results on the decidability of classes of formulas in set theory is proved. In parti...
This paper surveys various decidability results in the set theory. In the first part, we focus on ce...
Some extension of results on the decidability of classes of formulas in set theory is proved. In pa...
Positive solutions to the decision problem for a class of quantified formulae of the first order set...
In 1985, van den Dries showed that the theory of the reals with a predicate for the integer powers o...
The problem is addressed of establishing the satisfiability of prenex formulas involving a single un...
The aim of these lectures is to give a clear and explicit overview of the most important decidable a...
AbstractIn 1985, van den Dries showed that the theory of the reals with a predicate for the integer ...
85 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.Given an (undecidable) element...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
We propose a tableau-like decision procedure for deciding the satisfiability of set-theoretical for...
AbstractWe consider McCarthy's notions of predicate circumscription and formula circumscription. We ...
As proved recently. the satisfaction problem for all prenex formulae in the set-theoretic Bernays-Sh...