Show simple item record

dc.contributor.authorBanbara, Mutsunori
dc.contributor.authorKaufmann, Benjamin
dc.contributor.authorOstrowski, Max
dc.contributor.authorSchaub, Torsten
dc.date.accessioned2018-07-02T00:16:22Z
dc.date.available2018-07-02T00:16:22Z
dc.date.issued2017
dc.identifier.issn1471-0684
dc.identifier.doi10.1017/S1471068417000138
dc.identifier.urihttp://hdl.handle.net/10072/377902
dc.description.abstractWe present the third generation of the constraint answer set system clingcon, combining Answer Set Programming (ASP) with finite domain constraint processing (CP). While its predecessors rely on a black-box approach to hybrid solving by integrating the CP solver gecode, the new clingcon system pursues a lazy approach using dedicated constraint propagators to extend propagation in the underlying ASP solver clasp. No extension is needed for parsing and grounding clingcon's hybrid modeling language since both can be accommodated by the new generic theory handling capabilities of the ASP grounder gringo. As a whole, clingcon 3 is thus an extension of the ASP system clingo 5, which itself relies on the grounder gringo and the solver clasp. The new approach of clingcon offers a seamless integration of CP propagation into ASP solving that benefits from the whole spectrum of clasp's reasoning modes, including, for instance, multi-shot solving and advanced optimization techniques. This is accomplished by a lazy approach that unfolds the representation of constraints and adds it to that of the logic program only when needed. Although the unfolding is usually dictated by the constraint propagators during solving, it can already be partially (or even totally) done during preprocessing. Moreover, clingcon's constraint preprocessing and propagation incorporate several well-established CP techniques that greatly improve its performance. We demonstrate this via an extensive empirical evaluation contrasting, first, the various techniques in the context of CSP solving and, second, the new clingcon system with other hybrid ASP systems.
dc.description.peerreviewedYes
dc.languageEnglish
dc.language.isoeng
dc.publisherCambridge University Press
dc.relation.ispartofpagefrom408
dc.relation.ispartofpageto461
dc.relation.ispartofissue4
dc.relation.ispartofjournalTheory and Practice of Logic Programming
dc.relation.ispartofvolume17
dc.subject.fieldofresearchComputer Software not elsewhere classified
dc.subject.fieldofresearchArtificial Intelligence and Image Processing
dc.subject.fieldofresearchComputation Theory and Mathematics
dc.subject.fieldofresearchComputer Software
dc.subject.fieldofresearchcode080399
dc.subject.fieldofresearchcode0801
dc.subject.fieldofresearchcode0802
dc.subject.fieldofresearchcode0803
dc.titleClingcon: The next generation
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