Prolog extensions based on tableau calculus

Authors:
Wolfgang Schonfeld
Affiliations:
Heidelberg Science Center, IBM Germany, Heidelberg
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Year:
1985

Citing 4
Cited 0

Matings in matrices

Communications of the ACM
Programming in Prolog

Programming in Prolog
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Proof Search for Unprovable Formulas

GWAI '83 Proceedings of the 7th German Workshop on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The intention of this paper is to help bridging the gap between logic programming and theorem proving. It presents the design of a Gentzen type proof search procedure, based on classical tableau calculus, for knowledge bases consisting of arbitrary first order formulas. At each proof search step, when a new formula is to be chosen from the knowledge base, the procedure chooses in such a way that the search space is small. When applied to a Horn clause knowledge base and an atomic goal, it performs the same proof search steps as any PROLOG interpreter would do. Hence, PROLOG can be viewed as a special Gentzen type procedure just as it is a special (namely, linear input) resolution procedure.