Name
Abstract | ||
|---|---|---|
We propose inference systems for dealing with transitive relations in the context of resolution-type theorem proving. These inference mechanisms are based on standard techniques from term rewriting and represent a refinement of chaining methods. We establish their refutational completeness and also prove their compatibility with the usual simplification techniques used in rewrite-based theorem provers. A key to the practicality of chaining techniques is the extent to which so-called variable chainings can be restricted. We demonstrate that rewrite techniques considerably restrict variable chaining, though we also show that they cannot be completely avoided for transitive relations in general. If the given relation satisfies additional properties, such as symmetry, further restrictions are possible. In particular, we discuss (partial) equivalence relations and congruence relations |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1109/LICS.1994.316051 | Paris |
Keywords | Field | DocType |
equivalence classes,inference mechanisms,rewriting systems,theorem proving,chaining methods,congruence relations,equivalence relations,inference systems,refutational completeness,resolution-type theorem proving,rewrite techniques,transitive relations | Algebra,Pure mathematics,Transitive closure,Mathematics,Transitive relation | Conference |
ISSN | Citations | PageRank |
1043-6871 | 25 | 1.24 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bachmair, L. | 1 | 25 | 1.24 |
| Harald Ganzinger | 2 | 1513 | 155.21 |