Title: GOPT Resolution

Authors: Fei Liu; John Roddick

Addresses: Department of Computer Science and Computer Engineering, La Trobe University, Bundoora, Victoria 3086, Australia ' School of Computer Science, Engineering and Mathematics, Flinders University, P.O. Box 2100, Adelaide 5001, South Australia

Abstract: Some resolution strategies, such as SLD-resolution, are such that a derivation may be infinite even on a logic program that has a finite Herbrand universe. This paper introduces GOPT-resolution, a new deduction strategy for deriving solutions from a set of rules that improves on previous methods by preventing derivations that have infinite recursion. The paper outlines the process behind the development of GOPT-resolution based on PT-resolution. GOPT-resolution is then developed by distinguishing between goal-relevant and goal-irrelevant P-domains.

Keywords: GOPT resolution; logic programming; resolution strategies; set theory.

DOI: 10.1504/IJAISC.2011.042714

International Journal of Artificial Intelligence and Soft Computing, 2011 Vol.2 No.4, pp.334 - 352

Received: 22 Dec 2009
Accepted: 23 Apr 2011
Published online: 31 Mar 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article