Show simple item record

dc.contributor.authorBomanson, Jori
dc.contributor.authorJanhunen, Tomi
dc.contributor.authorSchaub, Torsten
dc.contributor.authorGebser, Martin
dc.contributor.authorKaufmann, Benjamin
dc.date.accessioned2017-06-20T03:28:39Z
dc.date.available2017-06-20T03:28:39Z
dc.date.issued2016
dc.identifier.issn0169-2968
dc.identifier.doi10.3233/FI-2016-1398
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.
dc.description.peerreviewedYes
dc.languageEnglish
dc.publisherIOS Press
dc.relation.ispartofpagefrom63
dc.relation.ispartofpageto91
dc.relation.ispartofissue1
dc.relation.ispartofjournalFundamenta Informaticae
dc.relation.ispartofvolume147
dc.subject.fieldofresearchComputation Theory and Mathematics not elsewhere classified
dc.subject.fieldofresearchComputation Theory and Mathematics
dc.subject.fieldofresearchArtificial Intelligence and Image Processing
dc.subject.fieldofresearchcode080299
dc.subject.fieldofresearchcode0802
dc.subject.fieldofresearchcode0801
dc.titleAnswer Set Programming Modulo Acyclicity
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.hasfulltextNo Full Text
gro.griffith.authorSchaub, Torsten


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