A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Declarative Belief Set Merging Using Merging Plans
[chapter]
2011
Lecture Notes in Computer Science
We present a declarative framework for belief set merging tasks over (possibly heterogeneous) knowledge bases, where belief sets are sets of literals. The framework is designed generically for flexible deployment to a range of applications, and allows to specify complex merging tasks in tree-structured merging plans, whose leaves are the possible belief sets of the knowledge bases that are processed using merging operators. A prototype is implemented in MELD (MErging Library for Dlvhex) on top
doi:10.1007/978-3-642-18378-2_10
fatcat:sagdztpv2za4xcsgvnz6a33ike