Towards predicate answer set programming via coinductive logic programming

Richard Min; Ajay Bansal; Gopal Gupta

doi:10.1007/978-1-4419-0221-4_58

Towards predicate answer set programming via coinductive logic programming

Richard Min, Ajay Bansal, Gopal Gupta

Research output: Chapter in Book/Report/Conference proceeding › Chapter

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 language	English (US)
Title of host publication	Artificial Intelligence Applications and Innovations III
Editors	Lazaros Iliadis, Ioannis Vlahavas, Max Bramer
Pages	499-508
Number of pages	10
DOIs	https://doi.org/10.1007/978-1-4419-0221-4_58
State	Published - 2009
Externally published	Yes

Publication series

Name	IFIP International Federation for Information Processing
Volume	296

ASJC Scopus subject areas

Information Systems and Management

Access to Document

10.1007/978-1-4419-0221-4_58

Cite this

Towards predicate answer set programming via coinductive logic programming. / Min, Richard; Bansal, Ajay; Gupta, Gopal.
Artificial Intelligence Applications and Innovations III. ed. / Lazaros Iliadis; Ioannis Vlahavas; Max Bramer. 2009. p. 499-508 (IFIP International Federation for Information Processing; Vol. 296).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

@inbook{d8012e6045104c63943277a2b5501457,

title = "Towards 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) 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.",

author = "Richard Min and Ajay Bansal and Gopal Gupta",

year = "2009",

doi = "10.1007/978-1-4419-0221-4_58",

language = "English (US)",

isbn = "9781441902207",

series = "IFIP International Federation for Information Processing",

pages = "499--508",

editor = "Lazaros Iliadis and Ioannis Vlahavas and Max Bramer",

booktitle = "Artificial Intelligence Applications and Innovations III",

}

TY - CHAP

T1 - Towards predicate answer set programming via coinductive logic programming

AU - Min, Richard

AU - Bansal, Ajay

AU - Gupta, Gopal

PY - 2009

Y1 - 2009

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

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

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

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

U2 - 10.1007/978-1-4419-0221-4_58

DO - 10.1007/978-1-4419-0221-4_58

M3 - Chapter

SN - 9781441902207

T3 - IFIP International Federation for Information Processing

SP - 499

EP - 508

BT - Artificial Intelligence Applications and Innovations III

A2 - Iliadis, Lazaros

A2 - Vlahavas, Ioannis

A2 - Bramer, Max

ER -

Towards predicate answer set programming via coinductive logic programming

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this