26 search results - page 1 / 6 » A Model Elimination Calculus for Generalized Clauses |
TABLEAUX
1992
Springer
13 years 9 months ago
1992
Springer
TABLEAUX
1995
Springer
13 years 8 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
IJCAI
1989
13 years 6 months ago
1989
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
LOGCOM
2010
13 years 3 months ago
2010
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...