Credulous resolution for answer set programming

Authors:
Piero A. Bonatti;Enrico Pontelli;Tran Cao Son
Affiliations:
Dip. di Scienze Fisiche, Sezione di Informatica, Università di Napoli Federico II, Napoli, Italy;Department of Computer Science, New Mexico State University, Las Cruces, NM;Department of Computer Science, New Mexico State University, Las Cruces, NM
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Year:
2008

Citing 12
Cited 6

Foundations of logic programming

Foundations of logic programming
Verifying security protocols as planning in logic programming

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Extending and implementing the stable model semantics

Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
Resolution for Skeptical Stable Model Semantics

Journal of Automated Reasoning
Computing Non-Ground Representations of Stable Models

LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
A logic programming approach to knowledge-state planning, II: the DLVk system

Artificial Intelligence
Bounded LTL model checking with stable models

Theory and Practice of Logic Programming
Reasoning with infinite stable models

Artificial Intelligence
A new perspective on stable models

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
An approximation of action theories of AL and its application to conformant planning

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Tableau calculi for answer set programming

ICLP'06 Proceedings of the 22nd international conference on Logic Programming

Answer Set Programming with Constraints Using Lazy Grounding

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
An investigation in parallel execution of answer set programs on distributed memory platforms: Task sharing and dynamic scheduling

Computer Languages, Systems and Structures
GASP: Answer Set Programming with Lazy Grounding

Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Answer set programming

A 25-year perspective on logic programming
GASP: Answer Set Programming with Lazy Grounding

Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Goal-directed execution of answer set programs

Proceedings of the 14th symposium on Principles and practice of declarative programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a calculus based on resolution for credulous reasoning in Answer Set Programming. The new approach allows a top-down and goal directed resolution, in the same spirit as traditional SLD-resolution. The proposed credulous resolution can be used in query-answering with nonground queries and with non-ground, and possibly infinite, programs. Soundness and completeness results for the resolution procedure are proved for large classes of logic programs. The resolution procedure is also extended to handle some traditional syntactic extensions used in Answer Set Programming, such as choice rules and constraints. The paper also describes an initial implementation of a system for credulous reasoning in Answer Set Programming.