skip to main content
10.1145/2370776.2370782acmotherconferencesArticle/Chapter ViewAbstractPublication PagesppdpConference Proceedingsconference-collections
research-article

Goal-directed execution of answer set programs

Published: 19 September 2012 Publication History

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.

Supplementary Material

ZIP File (ppdp28.zip)
Files included in ppdp28.zip: ppdp28-marple.pdf - The ACM compliant PDF, ppdp28-marple.ps - The PS file with embedded fonts, ppdp28-marple.bbl - The compiled bibliography file, ppdp28-marple.tex - The TeX source for the paper, ppdp28-marple.bib - The original BibTeX bibliography file, readme.txt - This file sigplanconf.cls - The style file used for the paper. The files ppdp28-marple.ps and ppdp28-marple.pdf were generated using the following command string: LaTeX + DviPs + Ps2Pdf where the individual commands are: LaTeX: latex -src -synctex=1 -interaction=nonstopmode ppdp28-marple.tex DviPs: dvips -P pdf -Pdownload35 -t letter -o ppdp28-marple.ps ppdp28-marple.dvi Ps2Pdf: ps2pdf ppdp28-marple.ps

References

[1]
J. J. Alferes, L. M. Pereira, and T. Swift. Abduction in Well Founded Semantics and Generalized Stable Models via Tabled Dual Programs. Theory and Practice of Logic Programming, 4:383--428, July 2004.
[2]
A. Bansal. Towards Next Generation Logic Programming Systems. PhD thesis, University of Texas at Dallas, 2007.
[3]
C. Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, 2003.
[4]
P. A. Bonatti. Resolution for Skeptical Stable Model Semantics. Journal of Automated Reasoning, 27:391--421, November 2001.
[5]
P. A. Bonatti, E. Pontelli, and T. C. Son. Credulous Resolution for Answer Set Programming. In Proceedings of the 23rd national conference on Artificial Intelligence - Volume 1, AAAI'08, pages 418--423. AAAI Press, 2008.
[6]
J. Dix. A Classification Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamenta Informaticae, 22:257--288, 1995.
[7]
K. Eshghi and R. A. Kowalski. Abduction compared with negation by failure. In ICLP, pages 234--254, 1989.
[8]
J. Fernandez and J. Lobo. A Proof Procedure for Stable Theories. In CS-TR-3034, Computer Science Technical Report Series. University of Maryland, 1993.
[9]
M. Gebser and T. Schaub. Tableau Calculi for Answer Set Programming. In Proceedings of the 22nd international conference on Logic Programming, ICLP'06, pages 11--25. Springer-Verlag, 2006.
[10]
M. Gebser, B. Kaufmann, A. Neumann, and T. Schaub. Clasp: A Conflict-Driven Answer Set Solver. In Proceedings of the 9th international conference on Logic Programming and Nonmonotonic Reasoning, LPNMR'07, pages 260--265. Springer-Verlag, 2007.
[11]
M. Gelfond. Representing Knowledge in A-Prolog. In Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II, pages 413--451. Springer-Verlag, 2002.
[12]
M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In Proceedings of the Fifth international conference on Logic Programming, pages 1070--1080. MIT Press, 1988.
[13]
E. Giunchiglia, Y. Lierler, and M. Maratea. SAT-Based Answer Set Programming. In Proceedings of the 19th national conference on Artifical Intelligence, AAAI'04, pages 61--66. AAAI Press, 2004.
[14]
G. Gupta, A. Bansal, R. Min, L. Simon, and A. Mallya. Coinductive Logic Programming and Its Applications. In Proceedings of the 23rd international conference on Logic Programming, ICLP'07, pages 27--44. Springer-Verlag, 2007.
[15]
A. Kakas and F. Toni. Computing Argumentation in Logic Programming. Journal of Logic and Computation, 9(4):515--562, 1999.
[16]
A. C. Kakas, R. A. Kowalski, and F. Toni. Abductive Logic Programming. Journal of Logic and Computation, 2(6):719--770, 1992.
[17]
P. G. Leone, N. and W. Faber. DLV. http://www.dbai.tuwien.ac.at/proj/dlv.
[18]
J. Lloyd. Foundations of Logic Programming. Symbolic Computation: Artificial Intelligence. Springer-Verlag, 1987.
[19]
K. Marple and G. Gupta. Galliwasp: A Goal-Directed Answer Set Solver. Technical report, University of Texas at Dallas, 2012. http://www.utdallas.edu/~kbm072000/galliwasp/publications/galliwasp.pdf.
[20]
R. Min. Predicate Answer Set Programming with Coinduction. PhD thesis, University of Texas at Dallas, 2010.
[21]
R. Min, A. Bansal, and G. Gupta. Towards Predicate Answer Set Programming via Coinductive Logic Programming. In AIAI, pages 499--508. Springer, 2009.
[22]
I. Niemelä and P. Simons. Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal Logic Programs. In Logic Programming And Nonmonotonic Reasoning, volume 1265 of Lecture Notes in Computer Science, pages 420--429. Springer-Verlag, 1997.
[23]
L. Pereira and A. Pinto. Revised Stable Models - A Semantics for Logic Programs. In Progress in Artificial Intelligence, volume 3808 of Lecture Notes in Computer Science, pages 29--42. Springer-Verlag, 2005.
[24]
L. Pereira and A. Pinto. Layered Models Top-Down Querying of Normal Logic Programs. In Practical Aspects of Declarative Languages, volume 5418 of Lecture Notes in Computer Science, pages 254--268. Springer-Verlag, 2009.
[25]
K. Sagonas, T. Swift, and D. Warren. XSB as an Efficient Deductive Database Engine. In ACM SIGMOD Record, volume 23, pages 442--453. ACM, 1994.
[26]
Y. Shen, J. You, and L. Yuan. Enhancing Global SLS-Resolution with Loop Cutting and Tabling Mechanisms. Theoretical Computer Science, 328(3):271--287, 2004.
[27]
L. Simon. Extending Logic Programming with Coinduction. PhD thesis, University of Texas at Dallas, 2006.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
PPDP '12: Proceedings of the 14th symposium on Principles and practice of declarative programming
September 2012
226 pages
ISBN:9781450315227
DOI:10.1145/2370776
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • Kuleuven Belgium: Kuleuven Belgium

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 September 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. answer set programming
  2. coinduction
  3. goal-directed execution

Qualifiers

  • Research-article

Conference

PPDP'12
Sponsor:
  • Kuleuven Belgium

Acceptance Rates

Overall Acceptance Rate 230 of 486 submissions, 47%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Explaining Explanations in Probabilistic Logic ProgrammingProgramming Languages and Systems10.1007/978-981-97-8943-6_7(130-152)Online publication date: 23-Oct-2024
  • (2022)Towards Dynamic Consistency Checking in Goal-Directed Predicate Answer Set ProgrammingPractical Aspects of Declarative Languages10.1007/978-3-030-94479-7_8(117-134)Online publication date: 2022
  • (2021)Graph Based Answer Set Programming Solver SystemsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.345.44345(276-285)Online publication date: 17-Sep-2021
  • (2021)DiscASP: A Graph-based ASP System for Finding Relevant Consistent Concepts with Applications to Conversational SocialbotsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.345.35345(205-218)Online publication date: 17-Sep-2021
  • (2020)Synthesizing Imperative Code from Answer Set Programming SpecificationsLogic-Based Program Synthesis and Transformation10.1007/978-3-030-45260-5_5(75-89)Online publication date: 22-Apr-2020
  • (2020)Model Integrated Decomposition and Assisted Specification (MIDAS)INCOSE International Symposium10.1002/j.2334-5837.2020.00757.x30:1(821-841)Online publication date: 30-Sep-2020
  • (2019)Imperative Program Synthesis from Answer Set ProgramsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.306.55306(413-417)Online publication date: 19-Sep-2019
  • (2016)A Physician Advisory System for Chronic Heart Failure management based on knowledge patternsTheory and Practice of Logic Programming10.1017/S147106841600042916:5-6(604-618)Online publication date: 14-Oct-2016
  • (2016)On dual programs in co-logic programming and the Horn $${\mu}$$ μ -calculusFormal Aspects of Computing10.1007/s00165-016-0404-029:3(401-421)Online publication date: 9-Dec-2016
  • (2015)On Dual Programs in Co-Logic ProgrammingRevised Selected Papers of the 25th International Symposium on Logic-Based Program Synthesis and Transformation - Volume 952710.1007/978-3-319-27436-2_2(21-35)Online publication date: 13-Jul-2015
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media