Predicate Answer Set Programming via coinductive Logic Programming

Richard Min, Ajay Bansal, Gopal Gupta

Research output: Contribution to journalArticle

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) 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
Volume17
Issue number2-3
StatePublished - Jun 1 2009
Externally publishedYes

Fingerprint

Logic programming
Computer programming
Electric grounding

Keywords

  • 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

Cite this

Predicate Answer Set Programming via coinductive Logic Programming. / Min, Richard; Bansal, Ajay; Gupta, Gopal.

In: Engineering Intelligent Systems, Vol. 17, No. 2-3, 01.06.2009, p. 105-114.

Research output: Contribution to journalArticle

Min, Richard ; Bansal, Ajay ; Gupta, Gopal. / Predicate Answer Set Programming via coinductive Logic Programming. In: Engineering Intelligent Systems. 2009 ; Vol. 17, No. 2-3. pp. 105-114.
@article{de52e2a28b0140efb72c7db8e595496c,
title = "Predicate Answer Set Programming via coinductive Logic Programming",
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) 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.",
keywords = "Answer Set Programming, Coinductive ASP solver, Coinductive Logic Programming, Negation as failure",
author = "Richard Min and Ajay Bansal and Gopal Gupta",
year = "2009",
month = "6",
day = "1",
language = "English (US)",
volume = "17",
pages = "105--114",
journal = "International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications",
issn = "0969-1170",
publisher = "CRL Publishing",
number = "2-3",

}

TY - JOUR

T1 - Predicate Answer Set Programming via coinductive Logic Programming

AU - Min, Richard

AU - Bansal, Ajay

AU - Gupta, Gopal

PY - 2009/6/1

Y1 - 2009/6/1

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

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

KW - Answer Set Programming

KW - Coinductive ASP solver

KW - Coinductive Logic Programming

KW - Negation as failure

UR - http://www.scopus.com/inward/record.url?scp=77956654481&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956654481&partnerID=8YFLogxK

M3 - Article

VL - 17

SP - 105

EP - 114

JO - International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications

JF - International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications

SN - 0969-1170

IS - 2-3

ER -