Towards predicate answer set programming via coinductive logic programming

Richard Min, Ajay Bansal, Gopal Gupta

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Citations (Scopus)

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

Fingerprint

Programming
Logic programming
Evaluation
Top-down approach
Top-down
Paradigm
Bottom-up

ASJC Scopus subject areas

  • Information Systems and Management

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

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 proceedingChapter

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. IFIP International Federation for Information Processing, vol. 296, pp. 499-508. https://doi.org/10.1007/978-1-4419-0221-4_58
Min R, Bansal A, Gupta G. Towards predicate answer set programming via coinductive logic programming. In Iliadis L, Vlahavas I, Bramer M, editors, Artificial Intelligence Applications and Innovations III. 2009. p. 499-508. (IFIP International Federation for Information Processing). https://doi.org/10.1007/978-1-4419-0221-4_58
Min, Richard ; Bansal, Ajay ; Gupta, Gopal. / Towards predicate answer set programming via coinductive logic programming. Artificial Intelligence Applications and Innovations III. editor / Lazaros Iliadis ; Ioannis Vlahavas ; Max Bramer. 2009. pp. 499-508 (IFIP International Federation for Information Processing).
@inbook{010eb1bf62f342469ec71f1d8450abd7,
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",
month = "7",
day = "31",
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/7/31

Y1 - 2009/7/31

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

AN - SCOPUS:67651241543

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 -