Declarative Belief Set Merging Using Merging Plans

Declarative Belief Set Merging Using Merging Plans,10.1007/978-3-642-18378-2_10,Christoph Redl,Thomas Eiter,Thomas Krennwallner

Declarative Belief Set Merging Using Merging Plans  
BibTex | RIS | RefWorks Download
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 of the dlvhex system for hex-programs, which are nonmonotonic logic programs with access to external sources. Plans in the task description language allow to formulate different conflict resolution strategies, and by shared object libraries, the user may also develop and integrate her own merging operators. MELD supports rapid prototyping of merging tasks, providing a computational backbone such that users can focus on operator optimization and evaluation, and on experimenting with merging strategies; this is particularly useful if a best merging operator or strategy is not known. Example applications are combining multiple decision diagrams (e.g., in biomedicine), judgment aggregation in social choice theory, and ontology merging.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.