English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Ordered chaining calculi for first-order theories of binary relations

MPS-Authors
/persons/resource/persons44055

Bachmair,  Leo
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44474

Ganzinger,  Harald
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

MPI-95-2-009.pdf
(Any fulltext), 34MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Bachmair, L., & Ganzinger, H.(1995). Ordered chaining calculi for first-order theories of binary relations (MPI-I-1995-2-009). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-A1BA-0
Abstract
We propose inference systems for binary relations with composition laws of the form $S\circ T\subseteq U$ in the context of resolution-type theorem proving. Particulary interesting examples include transitivity, partial orderings, equality and the combination of equality with other transitive relations. Our 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 in general. If a binary relation under consideration satisfies additional properties, such as symmetry, further restrictions are possible. In particular, we discuss orderings and partial congruence relations