Fixpoint evaluation with subsumption for probabilistic uncertainty:

Abstract: "The deep complexity of uncertain data modelling has resisted to [sic] general solutions so far. Instead, a diversity of modelling approaches has been proposed over the years, but few systems actually have been built. The DUCK calculus is one recent ambitious rule- based attempt to mo...

Full description

Saved in:
Bibliographic Details
Main Authors: Kießling, Werner (Author), Köstler, Gerhard (Author), Güntzer, Ulrich (Author)
Format: Book
Language:English
Published: München 1992
Series:Technische Universität <München>: TUM-I 9237
Subjects:
Summary:Abstract: "The deep complexity of uncertain data modelling has resisted to [sic] general solutions so far. Instead, a diversity of modelling approaches has been proposed over the years, but few systems actually have been built. The DUCK calculus is one recent ambitious rule- based attempt to model uncertainty on the grounds of established probability theory as typically used e.g. in medical diagnosis. This paper describes how deductive database technology can be exploited for prototyping of a system for uncertain reasoning. In particular we discuss the issues of ADT-ideas in Datalog by using interpreted predicates. Moreover we show that for safety reasons logic programming and current Datalog optimizers must be upgraded to deal with semantic optimization in form of subsumption
New differential least fixpoint operators, customized for subsumption optimization, are provided. Finally, we outline the design and implementation of DUCK-Demonstrator/1.1 which serves as a research vehicle for ongoing studies of uncertain reasoning phenomena and for optimization of vague queries.
Physical Description:32 S. graph. Darst.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!