Show simple item record

dc.contributor.authorDelgrande, James
dc.contributor.authorSchaub, Torsten
dc.contributor.authorTompits, Hans
dc.contributor.authorWoltran, Stefan
dc.contributor.editorHill, PM
dc.contributor.editorWarren, DS
dc.date.accessioned2017-05-03T15:52:01Z
dc.date.available2017-05-03T15:52:01Z
dc.date.issued2009
dc.date.modified2010-08-23T07:02:31Z
dc.identifier.isbn978-3-642-02845-8
dc.identifier.doi10.1007/978-3-642-02846-5_17
dc.identifier.urihttp://hdl.handle.net/10072/30506
dc.description.abstractThis paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P 1, ..., P n , the goal is to provide characterisations of the merging of these programs. Our formal techniques are based on notions of relative distance between the underlying SE models of the logic programs. Two approaches are examined. The first informally selects those models of the programs that vary the least from the models of the other programs. The second approach informally selects those models of a program P 0 that are closest to the models of programs P 1, ..., P n . P 0 can be thought of as analogous to a set of database integrity constraints. We examine formal properties of these operators and give encodings for computing the mergings of a multiset of logic programs within the same logic programming framework. As a by-product, we provide a complexity analysis revealing that our operators do not increase the complexity of the base formalism.
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.format.extent115602 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglish
dc.language.isoeng
dc.publisherSpringer
dc.publisher.placeGermany
dc.publisher.urihttps://link.springer.com/book/10.1007/978-3-642-02846-5
dc.relation.ispartofbooktitleLogic Programming
dc.relation.ispartofchapter17
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofpagefrom160
dc.relation.ispartofpageto174
dc.rights.retentionY
dc.subject.fieldofresearchcode280301
dc.titleMerging Logic Programs under Answer Set Semantics
dc.typeBook chapter
dc.type.descriptionB1 - Chapters
dc.type.codeB - Book Chapters
gro.rights.copyright© 2009 Springer. The attached file is reproduced here in accordance with the copyright policy of the publisher. Use hypertext link for access to the publisher's website.
gro.date.issued2009
gro.hasfulltextFull Text
gro.griffith.authorSchaub, Torsten


Files in this item

This item appears in the following Collection(s)

  • Book chapters
    Contains book chapters authored by Griffith authors.

Show simple item record