Constraint Answer Set Programming Without Grounding and Its Applications

Date

2018-08-10

ORCID

Journal Title

Journal ISSN

Volume Title

Publisher

Cambridge University Press

item.page.doi

Abstract

Extending Datalog/ASP with constraints (CASP) enhances its expressiveness and performance but it is not straightforward as the grounding phase removes variables and the links among them. We incorporate constraints into s(ASP), a goal-directed, top-down execution model which implements predicate answer set programming without grounding. The resulting model, s(CASP), can constrain variables that, as in CLP, are kept during the execution and in the answer sets. We show the enhanced expressiveness of s(CASP) w.r.t. other CASP systems, through a non-trivial example of modeling the event calculus. © 2019 CEUR-WS. All rights reserved.

Description

Due to copyright restrictions and/or publisher's policy full text access from Treasures at UT Dallas is limited to current UTD affiliates (use the provided Link to Article).
Supplementary material is available on publisher's website. Use the DOI link below.

Keywords

Datalog (Computer program language), Logic programming

item.page.sponsorship

Rights

©2018 Cambridge University Press

Citation

Collections