<div class="csl-bib-body">
<div class="csl-entry">Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2009). Merging Logic Programs under Answer Set Semantics. In P. M. Hill & D. S. Warren (Eds.), <i>Logic Programming: 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009, Proceedings</i> (pp. 160–174). Springer. https://doi.org/10.1007/978-3-642-02846-5_17</div>
</div>
-
dc.identifier.isbn
9783642028458
-
dc.identifier.isbn
9783642028465
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/52742
-
dc.description.abstract
This 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.
en
dc.description.sponsorship
Fonds zur Förderung der wissenschaftlichen Forschung (FWF)
-
dc.language.iso
en
-
dc.publisher
Springer
-
dc.relation.ispartofseries
Lecture Notes in Computer Science
-
dc.subject
answer set programming
en
dc.subject
belief merging
en
dc.subject
strong equivalence
en
dc.title
Merging Logic Programs under Answer Set Semantics
en
dc.type
Konferenzbeitrag
de
dc.type
Inproceedings
en
dc.relation.isbn
978-3-642-02845-8
-
dc.relation.doi
10.1007/978-3-642-02846-5
-
dc.relation.issn
0302-9743
-
dc.description.startpage
160
-
dc.description.endpage
174
-
dc.type.category
Full-Paper Contribution
-
dc.relation.eissn
1611-3349
-
dc.publisher.place
LNCS 5649
-
tuw.booktitle
Logic Programming: 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009, Proceedings
-
tuw.relation.publisher
Springer
-
tuw.relation.publisherplace
Berlin, Heidelberg
-
tuw.project.title
Theoretical Tractability vs. Practical Computation
-
tuw.publication.orgunit
E192-03 - Forschungsbereich Knowledge Based Systems
-
tuw.publication.orgunit
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
tuw.publisher.doi
10.1007/978-3-642-02846-5_17
-
dc.description.numberOfPages
15
-
tuw.event.name
International Conference on Logic Programming (ICLP)
-
tuw.event.startdate
02-10-2005
-
tuw.event.enddate
05-10-2005
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Sitges, Spain
-
tuw.event.place
Sitges, Spain
-
tuw.event.country
AT
-
tuw.event.presenter
Delgrande, James P.
-
wb.sciencebranch
Mathematik, Informatik
-
wb.sciencebranch.oefos
11
-
wb.presentation.type
science to science/art to art
-
item.fulltext
no Fulltext
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
item.cerifentitytype
Publications
-
item.openairetype
conference paper
-
item.grantfulltext
none
-
item.languageiso639-1
en
-
crisitem.author.dept
E192-03 - Forschungsbereich Knowledge Based Systems
-
crisitem.author.dept
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
crisitem.author.orcid
0000-0001-5673-2460
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.project.funder
FWF Fonds zur Förderung der wissenschaftlichen Forschung (FWF)
