Predicate Answer Set Programming via coinductive Logic Programming

Richard Min, Ajay Bansal, Gopal Gupta

Research output: Contribution to journalArticlepeer-review


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) with coinductive SLDNF resolution (co-SLDNF) has allowed the development of top-down query-driven goal-directed evaluation strategies for ASP. In this paper we present co-LP with co-SLDNF and its application to the implementation of a predicate ASP solver. Our novel method eliminates the need for grounding and allows functions, to overcome current restriction of current ASP solver, toward the development of a truly predicate ASP solver. The resulting coinductive ASP solver (co-ASP Solver) provides a powerful, practical and efficient predicate ASP solver to handle effectively a large class of predicate answer set programs including possibly infinite ones. We apply our solution strategy to answer programs (e.g., move-win and Schur number problem) to demonstrate our co-ASP Solver with performance result.

Original languageEnglish (US)
Pages (from-to)105-114
Number of pages10
JournalEngineering Intelligent Systems
Issue number2-3
StatePublished - Jun 2009
Externally publishedYes


  • Answer Set Programming
  • Coinductive ASP solver
  • Coinductive Logic Programming
  • Negation as failure

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Predicate Answer Set Programming via coinductive Logic Programming'. Together they form a unique fingerprint.

Cite this