Show simple item record

dc.contributor.authorBomanson, Jori
dc.contributor.authorGebser, Martin
dc.contributor.authorJanhunen, Tomi
dc.contributor.authorKaufmann, Benjamin
dc.contributor.authorSchaub, Torsten
dc.date.accessioned2017-06-20T03:28:39Z
dc.date.available2017-06-20T03:28:39Z
dc.date.issued2016
dc.identifier.issn0169-2968en_US
dc.identifier.doi10.3233/FI-2016-1398en_US
dc.identifier.urihttp://hdl.handle.net/10072/340429
dc.description.abstractAcyclicity constraints are prevalent in knowledge representation and applications where acyclic data structures such as DAGs and trees play a role. Recently, such constraints have been considered in the satisfiability modulo theories (SMT) framework, and in this paper we carry out an analogous extension to the answer set programming (ASP) paradigm. The resulting formalism, ASP modulo acyclicity, offers a rich set of primitives to express constraints related to recursive structures. In the technical results of the paper, we relate the new generalization with standard ASP by showing (i) how acyclicity extensions translate into normal rules, (ii) how weight constraint programs can be instrumented by acyclicity extensions to capture stability in analogy to unfounded set checking, and (iii) how the gap between supported and stable models is effectively closed in the presence of such an extension. Moreover, we present an efficient implementation of acyclicity constraints by incorporating a respective propagator into the state-of-the-art ASP solver CLASP. The implementation provides a unique combination of traditional unfounded set checking with acyclicity propagation. In the experimental part, we evaluate the interplay of these orthogonal checks by equipping logic programs with supplementary acyclicity constraints. The performance results show that native support for acyclicity constraints is a worthwhile addition, furnishing a complementary modeling construct in ASP itself as well as effective means for translation-based ASP solving.en_US
dc.description.peerreviewedYesen_US
dc.languageEnglishen_US
dc.publisherIOS Pressen_US
dc.relation.ispartofpagefrom63en_US
dc.relation.ispartofpageto91en_US
dc.relation.ispartofissue1en_US
dc.relation.ispartofjournalFundamenta Informaticaeen_US
dc.relation.ispartofvolume147en_US
dc.subject.fieldofresearchComputation Theory and Mathematics not elsewhere classifieden_US
dc.subject.fieldofresearchcode080299en_US
dc.titleAnswer Set Programming Modulo Acyclicityen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.hasfulltextNo Full Text


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record