Logic Programming with Pseudo-Resolution
This paper presents a new proof technique for Automated Reasoning and Logic Programming which based on a generalization of the original Connection Graph paradigm of Kowalski and provides a methodology for Logic Programming in this framework.
We show how execution of a logic program can be executed in the logarithm of the number of steps taken by PROLOG and standard resolution theorem provers, or better.
This paper deals primarily with recursion, both in relation its exploitation and its explication. In dealing with explicit recursion, a modified “compartmentalized” connection graph framework emerges. In dealing with implicit recursion, a filter for the compartmentalized connection graph emerges which forces recursion to be explicitly represented.
The method is demonstrated on standard PROLOG examples.
Unable to display preview. Download preview PDF.
- [Eisi88]Norbert Eisinger, “Completeness, Confluence and Related Properties of Clause Graph Resolution”, Doctoral Dissertation, SEKI Report SR-88-07, FB Informatik, University of Kaiserslautern FRG (1988)Google Scholar
- [Kowa79]Robert Kowalski, “Logic for Problem Solving”, North Holland (1979)Google Scholar
- [Powe88]David M. W. Powers, Lazaro Davila and Graham Wrightson, “Implementing Connectiong Graphs for Logic Programming”, Cybernetics and Systems '88 (R. Trappl, Ed), Kluwer (April 1988)Google Scholar
- [Powe90a]David M. W. Powers, “Compartmentalized Connection Graphs for Concurrent Logic Programming I: Compartmentalization, Transformation and Examples”, SEKI Report SR-90-16, University of Kaiserslautern FRG (1990).Google Scholar
- [Powe90b]David M. W. Powers, “Compartmentalized Connection Graphs for Concurrent Logic Programming II: Parallelism, Indexing and Unification”, SEKI Report SR-90-17, University of Kaiserslautern FRG (1990).Google Scholar
- [Wise84]Michael J. Wise, David M. W. Powers, “Indexing PROLOG Clauses via Superimposed Code Words and Field Encoded Words”, Proc. International Symposium on Logic Programming, IEEE Computer Society, pp.203–210 (February 1984).Google Scholar