Skip to content
University of Maryland LibrariesDigital Repository at the University of Maryland
    • Login
    View Item 
    •   DRUM
    • College of Computer, Mathematical & Natural Sciences
    • Computer Science
    • Technical Reports from UMIACS
    • View Item
    •   DRUM
    • College of Computer, Mathematical & Natural Sciences
    • Computer Science
    • Technical Reports from UMIACS
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

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

    Thumbnail
    View/Open
    CS-TR-3243.ps (441.5Kb)
    No. of downloads: 130

    Auto-generated copy of CS-TR-3243.ps (405.4Kb)
    No. of downloads: 889

    Date
    1998-10-15
    Author
    Adali, Sibel
    Subrahmanian, V.S.
    Metadata
    Show full item record
    Abstract
    Integrating 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)
    URI
    http://hdl.handle.net/1903/626
    Collections
    • Technical Reports from UMIACS
    • Technical Reports of the Computer Science Department

    DRUM is brought to you by the University of Maryland Libraries
    University of Maryland, College Park, MD 20742-7011 (301)314-1328.
    Please send us your comments.
    Web Accessibility
     

     

    Browse

    All of DRUMCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister
    Pages
    About DRUMAbout Download Statistics

    DRUM is brought to you by the University of Maryland Libraries
    University of Maryland, College Park, MD 20742-7011 (301)314-1328.
    Please send us your comments.
    Web Accessibility