Logic programming with pseudo-resolution

David M.W. Powers

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationLogic Programming
Subtitle of host publicationFirst Russian Conference on Logic Programming Irkutsk, Russia, September 14–18, 1990 Second Russian Conference on Logic Programming St. Petersburg, Russia, September 11–16, 1991 Proceedings
EditorsAndrei Voronkov
Number of pages8
ISBN (Electronic)978-3-540-47083-0
ISBN (Print)978-3-540-55460-8
Publication statusPublished - 1 Jan 1992
Externally publishedYes
Event2nd Russian Conference on Logic Programming, 1991 - St. Petersburg, Russian Federation
Duration: 11 Sep 199116 Sep 1991

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference2nd Russian Conference on Logic Programming, 1991
Country/TerritoryRussian Federation
CitySt. Petersburg


Dive into the research topics of 'Logic programming with pseudo-resolution'. Together they form a unique fingerprint.

Cite this