GOPT Resolution Online publication date: Tue, 27-Sep-2011
by Fei Liu; John Roddick
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 2, No. 4, 2011
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.
Online publication date: Tue, 27-Sep-2011
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org