Sciweavers

Share
TABLEAUX
1995
Springer

Constraint Model Elimination and a PTTP-Implementation

10 years 6 months ago
Constraint Model Elimination and a PTTP-Implementation
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 constraint processing into a general, non-Horn theorem proving calculus. A framework for a new calculus is introduced which combines model elimination with constraint solving, following the lines of B¨urckert (1991). A prototype system has been implemented rapidly by only combining a PROLOG technology implementation of model elimination and PROLOG with constraints. Some example studies, e.g. taxonomic reasoning, show the advantages and some problems with this procedure.
Peter Baumgartner, Frieder Stolzenburg
Added 26 Aug 2010
Updated 26 Aug 2010
Type Conference
Year 1995
Where TABLEAUX
Authors Peter Baumgartner, Frieder Stolzenburg
Comments (0)
books