Goal-directed execution of answer set programs

Authors:
Kyle Marple;Ajay Bansal;Richard Min;Gopal Gupta
Affiliations:
University of Texas at Dallas, Richardson, Texas, USA;Arizona State University, Mesa, Arizona, USA;University of Texas at Dallas, Richardson, Texas, USA;University of Texas at Dallas, Richardson, Texas, USA
Venue:
Proceedings of the 14th symposium on Principles and practice of declarative programming
Year:
2012

Citing 18
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
XSB as an efficient deductive database engine

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
Resolution for Skeptical Stable Model Semantics

Journal of Automated Reasoning
Representing Knowledge in A-Prolog

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP

LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Abduction in well-founded semantics and generalized stable models via tabled dual programs

Theory and Practice of Logic Programming
Extending logic programming with coinduction

Extending logic programming with coinduction
Towards next generation logic programming systems

Towards next generation logic programming systems
Layered Models Top-Down Querying of Normal Logic Programs

PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
SAT-based answer set programming

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Credulous resolution for answer set programming

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Clasp: a conflict-driven answer set solver

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Coinductive logic programming and its applications

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Predicate answer set programming with coinduction

Predicate answer set programming with coinduction
Revised stable models – a semantics for logic programs

EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Tableau calculi for answer set programming

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Answer Set Programming (ASP) represents an elegant way of introducing non-monotonic reasoning into logic programming. ASP has gained popularity due to its applications to planning, default reasoning and other areas of AI. However, none of the approaches and current implementations for ASP are goal-directed. In this paper we present a technique based coinduction that can be employed to design SLD resolution-style, goal-directed methods for executing answer set programs. We also discuss advantages and applications of such goal-directed execution of answer set programs, and report results from our implementation.