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


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
Number of pages10
StatePublished - 2009
Externally publishedYes

Publication series

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

ASJC Scopus subject areas

  • Information Systems and Management


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

Cite this