GOPT Resolution

Authors:
Fei Liu;John Roddick
Affiliations:
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
Venue:
International Journal of Artificial Intelligence and Soft Computing
Year:
2011

Citing 11
Cited 0

Introduction to expert systems

Introduction to expert systems
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming

Journal of the ACM (JACM)
Logic for Problem Solving

Logic for Problem Solving
Computing 3-valued Stable Models by using the ATMS

AI*IA '93 Proceedings of the Third Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
From Open IS Semantics to the Semantic Web: The Road Ahead

IEEE Intelligent Systems
Fuzzy linguistic logic programming and its applications

Theory and Practice of Logic Programming
A proof method for quantification theory: its justification and realization

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

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.