Replacing unification by constraint satisfaction to improve logic program expressiveness |
| |
Authors: | J. W. Roach R. Sundararajan L. T. Watson |
| |
Affiliation: | (1) Department of Computer Science, Virginia Polytechnic Institute and State University, 24061 Blacksburg, VA, USA |
| |
Abstract: | Unification, the heart of resolution, was formulated to work in the Herbrand universe and hence does not incorporate any function evaluation. Matching is completely syntactic. In this paper, we study the replacement of unification by a constraints solver in automatic theorem proving systems using Prolog as our example. The generalization of unification into a constraint satisfaction algorithm allows the (limited) incorporation of function evaluation into unification. Constraints are also allowed as literals in the clause. We discuss the enhanced expressive power that results from incorporating an efficient constrained unifier into an automatic theorem proving system. An interpreter for the extended Prolog system (written in Prolog) incorporating a constraint solver is presented along with examples illustrating its capabilities. |
| |
Keywords: | Unification constraint satisfaction constrained unification Prolog |
本文献已被 SpringerLink 等数据库收录! |