Goal-directed execution of answer set programs

Kyle Marple, Ajay Bansal, Richard Min, Gopal Gupta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Scopus citations

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 on 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.

Original languageEnglish (US)
Title of host publicationPPDP'12 - Proceedings of the 2012 ACM SIGPLAN Principles and Practice of Declarative Programming
Pages35-43
Number of pages9
DOIs
StatePublished - 2012
Event14th Symposium on Principles and Practice of Declarative Programming, PPDP 2012 - Leuven, Belgium
Duration: Sep 19 2012Sep 21 2012

Publication series

NamePPDP'12 - Proceedings of the 2012 ACM SIGPLAN Principles and Practice of Declarative Programming

Other

Other14th Symposium on Principles and Practice of Declarative Programming, PPDP 2012
Country/TerritoryBelgium
CityLeuven
Period9/19/129/21/12

Keywords

  • Answer set programming
  • Coinduction
  • Goal-directed execution

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Goal-directed execution of answer set programs'. Together they form a unique fingerprint.

Cite this