Lipski's approach to incomplete information data bases restated and generalized in the setting of Zadeh's possibility theory

1984 ◽  
Vol 9 (1) ◽  
pp. 27-42 ◽  
Author(s):  
Henri Prade
1991 ◽  
Vol 53 (1-2) ◽  
pp. 61-87 ◽  
Author(s):  
Maurizio Lenzerini

1989 ◽  
Vol 12 (3) ◽  
pp. 269-287
Author(s):  
Marek A. Suchenek

This paper concerns two aspects of incomplete information in data bases: - computations of answers to queries which are externally interpreted in some incomplete first-order structures with dependencies, and - the proper treatment of modal operators in such structures. We introduce the notion of an incomplete first-order structure with dependencies which seems to be an adequate model of data bases with incomplete information. We show that the widely accepted implicit assumption that first-order models (of a data base) have a unique domain, has no first-order consequences if the set of premises (represented in the data base) contains only a finite amount of information explicitly involving the elements of this domain. This observation allows us to evaluate the degree of unsolvability of the problem of answering externally interpreted queries in the incomplete first-order structures. Moreover, we propose a forcing-based definition of the internal interpretation of modal queries in such structures, and investigate some of the properties of this interpretation.


1983 ◽  
Vol 6 (3-4) ◽  
pp. 375-391
Author(s):  
Michał Jaegermann ◽  
Witold Lipski

We consider the problem of answering numerical queries, i.e. queries involving cardinalities of sets of objects with specified conditions, in a data base where information is incomplete. We give an algorithm to compute a lower bound and an upper bound on the response to a numerical query. The bounds proceduced by the algorithm are the best logically derivable from the information available in the data base.


Author(s):  
ANTOON BRONSELAER ◽  
JOSÉ ENRIQUE PONS ◽  
GUY DE TRÉ ◽  
OLGA PONS

In the past decades, the theory of possibility has been developed as a theory of uncertainty that is compatible with the theory of probability. Whereas probability theory tries to quantify uncertainty that is caused by variability (or equivalently randomness), possibility theory tries to quantify uncertainty that is caused by incomplete information. A specific case of incomplete information is that of ill-known sets, which is of particular interest in the study of temporal databases. However, the construction of possibility distributions in the case of ill-known sets is known to be overly complex. This paper contributes to the study of ill-known sets by investigating the inference of uncertainty when constraints are specified over ill-known values. More specific, in this paper it is investigated how the knowledge about constraint satisfaction can be inferred if the constraints themselves are defined by means of ill-known values. It is shown how such reasoning can contribute to the study of (fuzzy) temporal databases.


Sign in / Sign up

Export Citation Format

Share Document