Loop elimination, a sound optimisation technique for PTTP related theorem proving

Authors:
Zsolt Zombori;Péter Szeredi
Affiliations:
Budapest University of Technology and Econcornics, Budapest, Hungary;Budapest University of Technology and Econcornics, Budapest, Hungary
Venue:
Acta Cybernetica
Year:
2012

Citing 7
Cited 0

First-order logic and automated theorem proving

First-order logic and automated theorem proving
An analysis of loop checking mechanisms for logic programs

Theoretical Computer Science
A Prolog technology theorem prover: a new exposition and implementation in Prolog

Theoretical Computer Science - Selected papers on theoretical issues of design and implementation of symbolic computation systems
Caching and non-horn inference in model elimination theorem provers

Caching and non-horn inference in model elimination theorem provers
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Efficient description logic reasoning in prolog: The dlog system

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present loop elimination, an important optimisation technique for first-order theorem proving based on Prolog technology, such as the Prolog Technology Theorem Prover or the DLog Description Logic Reasoner. Although several loop checking techniques exist for logic programs, to the best of our knowledge, we are the first to examine the interaction of loop checking with ancestor resolution. Our main contribution is a rigorous proof of the soundness of loop elimination.