Amalgamating Knowledge Bases, III - Algorithms, Data Structures, and Query Processing

dc.contributor.authorAdali, Sibelen_US
dc.contributor.authorSubrahmanian, V.S.en_US
dc.date.accessioned2004-05-31T22:25:41Z
dc.date.available2004-05-31T22:25:41Z
dc.date.created1994-03en_US
dc.date.issued1998-10-15en_US
dc.description.abstractIntegrating knowledge from multiple sources is an important aspect of automated reasoning systems. In the first part of this series of papers, we presented a uniform declarative framework, based on <em> annotated logics</em>, for amalgamating multiple knowledge bases when these knowledge bases (possibly) contain inconsistencies, uncertainties, and non-monotonic modes of negation. We showed that annotated logics may be used, with some modifications, to <em> mediate</em> between different knowledge bases. The multiple knowledge bases are amalgamated by embedding the individual knowledge bases into a lattice. In this paper, we briefly describe an SLD-resolution based proof procedure that is sound and complete w.r.t. our declarative semantics. We will then develop an <tt> OLDT </tt>-resolution based query processing procedure, <tt> MULTI-OLDT </tt>, that satisfies two important properties: (1) <em> efficient reuse</em> of previous computations is achieved by maintaining a table -- we describe the structure of this table and show that table operations can be efficiently executed, and (2) <em> approximate, interruptable query answering </em> is achieved, i.e. it is possible to obtain an ``intermediate, approximate'' answer from the query processing procedure by interrupting it at any point in time during its execution. The design of the <tt> MULTI-OLDT </tt> procedure will include the development of run-time algorithms to incrementally and efficiently update the table. (Also cross-referenced as UMIACS-TR-94-35)en_US
dc.format.extent452194 bytes
dc.format.mimetypeapplication/postscript
dc.identifier.urihttp://hdl.handle.net/1903/626
dc.language.isoen_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3243en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-94-35en_US
dc.titleAmalgamating Knowledge Bases, III - Algorithms, Data Structures, and Query Processingen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
CS-TR-3243.ps
Size:
441.6 KB
Format:
Postscript Files
Loading...
Thumbnail Image
Name:
CS-TR-3243.pdf
Size:
405.42 KB
Format:
Adobe Portable Document Format
Description:
Auto-generated copy of CS-TR-3243.ps