[Back]

T. Eiter, T. Krennwallner, C. Redl:
"Declarative Merging of and Reasoning about Decision Diagrams";
Talk: Workshop on Constraint Based Methods for Bioinformatics (WCB), Perugia, Italy; 2011-09-12; in: "Workshop on Constraint Based Methods for Bioinformatics 2011 (WCB 2011)", A. Dal Palù, A. Dovier, A. Formisano (ed.); Dipartimento di Matematica e Informatica, Universita degli Studi di Perugia, Perugia, Italy (2011), Paper ID 1, 13 pages.

Decision diagrams (DDs) are a popular means for decision making, e.g., in clinical guidelines. Some applications require to integrate multiple related yet different diagrams into a single one, for which algorithms have been developed. However, existing merging tools are monolithic, application-tailored programs with no clear interface to the actual merging procedures, which makes their reuse hard if not impossible. We present a general, declarative framework for merging and manipulating decision diagram tasks based on a belief set merging framework. Its modular architecture hides details of the merging algorithm and supports pre- and user-defined merging operators, which can be flexibly arranged in merging plans to express complex merging tasks. Changing and restructuring merging tasks becomes easy, and relieves the user from (repetitive) manual integration to focus on experimenting with different merging strategies, which is vital for applications, as discussed for an example from DNA classification. Our framework supports also reasoning over DDs using answer set programming (ASP), which allows to drive the merging process and select results based on the application needs.

Answer Set Programming, Nonmonotic Reasoning, Decision Diagram Merging

http://www.dmi.unipg.it/WCB11/wcb11proc.pdf

Project Head Thomas Eiter:
Evaluierung von ASP Programming mit Externen Zugriffen

Project Head Thomas Eiter:
Modulare HEX-Programme

Project Head Thomas Eiter:
Schließen in hybriden Wissensbasen

Project Head Michael Fink:
Inconsistency Management for Knowledge-Integration Systems