Towards predicate answer set programming via coinductive logic programming

Richard Min, Ajay Bansal, Gopal Gupta

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Scopus citations

Abstract

Answer Set Programming (ASP) is a powerful paradigm based on logic programming for non-monotonic reasoning. Current ASP implementations are restricted to "grounded range-restricted function-free normal programs" and use an evaluation strategy that is "bottom-up" (i.e., not goal-driven). Recent introduction of coinductive Logic Programming (co-LP) has allowed the development of top-down goal evaluation strategies for ASP. In this paper we present this novel goal-directed, top-down approach to executing predicate answer set programs with co-LP. Our method eliminates the need for grounding, allows functions, and effectively handles a large class of predicate answer set programs including possibly infinite ones.

Original languageEnglish (US)
Title of host publicationArtificial Intelligence Applications and Innovations III
EditorsLazaros Iliadis, Ioannis Vlahavas, Max Bramer
Pages499-508
Number of pages10
DOIs
StatePublished - Jul 31 2009
Externally publishedYes

Publication series

NameIFIP International Federation for Information Processing
Volume296
ISSN (Print)1571-5736

ASJC Scopus subject areas

  • Information Systems and Management

Fingerprint Dive into the research topics of 'Towards predicate answer set programming via coinductive logic programming'. Together they form a unique fingerprint.

  • Cite this

    Min, R., Bansal, A., & Gupta, G. (2009). Towards predicate answer set programming via coinductive logic programming. In L. Iliadis, I. Vlahavas, & M. Bramer (Eds.), Artificial Intelligence Applications and Innovations III (pp. 499-508). (IFIP International Federation for Information Processing; Vol. 296). https://doi.org/10.1007/978-1-4419-0221-4_58