A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Redundancy criteria for constrained completion
[chapter]
1993
Lecture Notes in Computer Science
This paper studies completion in the case of equations with constraints consisting of rstorder formulae over equations, disequations, and an irreducibility predicate. We present several inference systems which show i n a v ery precise way h o w to take advantage of redundancy notions in this framework. A notable feature of these systems is the variety of tradeo s they present for removing redundant instances of the equations involved in an inference. The irreducibility predicates simulate
doi:10.1007/3-540-56868-9_2
fatcat:3prdghsaarhtblpjzgcb5gm2ju