Combining Databases with Prioritized Information
Computer Science Department,
University of Maryland
College Park
The complete paper is available in:
Abstract
To solve a problem one may need to combine the
knowledge of several different experts. It can happen that some of
the claims of one or more experts may be in conflict with the claims of
other experts. There may be several such points of conflict
and any claim may be involved in several different such points of
conflict. In that case, the user of the knowledge of experts may
prefer a certain claim to another in one conflict-point without
necessarily preferring that statement in another conflict-point. Our
work constructs a framework within which the consequences of a set of
such preferences (expressed as priorities among sets of statements) can
be computed. We give four types of semantics for priorities, three of
which are shown to be equivalent to one another. The fourth
type of semantics
for priorities is shown to be more cautious than the other
three. In terms of these semantics for priorities, we give a function
for combining knowledge from different sources such that the combined
knowledge is conflict-free and satisfies all the priorities.
Bibliography
-
[BKM91] C. Baral, S. Kraus, and J. Minker. Combining multiple
knowledge bases. IEEE Transactions on Data and Knowledge Engi-
neering, 3:208-220, 1991.
-
[BKMS92] C. Baral, S. Kraus, J. Minker, and V.S.
Subrahmanian. Combining knowledge bases consisting of first order
theories. Com- putational Intelligence, 8:45-71, 1992.
-
[FUV83] R. Fagin, J.D. Ullman, and M.Y. Vardi. On the
semantics of updates in databases. In Proc. 7th ACM
SIGACT/SIGMOD Symposium on Principles of Database Systems, pages
352-365, 1983.
-
[GL88] M. Gelfond and V. Lifschitz. The Stable Model
Semantics for Logic Programming. In R.A. Kowalski and K.A.
Bowen, editors, Proc. 5th International Conference and
Symposium on Logic Programming, pages 1070-1080, Seattle, Washington,
August 15-19 1988.
-
[Rya91] M. Ryan. Belief revision and ordered theory
presentation. In P. Dekker and M. Stokhof, editors, Proc. Eighth
Amsterdam Colloquium on Logic, 1991.
-
[Rya92a] M. Ryan. Ordered Presentation of Theories: Default
Reasoning and Belief Revision. PhD thesis, Department of
Computing, Imperial College, 1992. Ph.D. thesis.
-
[Rya92b] M. Ryan. Representing defaults as sentences with
reduced priority. In B. Nebel and W. Swartout, editors, Proc. KR '92.
Morgan Kaufmann, 1992.
-
[Sub92] V.S. Subrahmanian. Amalgamating knowledge bases.
Technical Report Univ. of Maryland CS-TR-2949, Department of
Computer Science, University of Maryland, College Park, Md 20742,
August 1992. Currently being revised for publication in ACM
Trans. on Database Systems . August 1993 Combining DBs with
Prioritized Information p. 37 of 40
-
[TK81] A. Tversky and D. Kahneman. The framing of decisions
and the psychology of choice. Science, 211:453-458, 1981.
-
[VRS88] A. Van Gelder, K. Ross, and J.S. Schlipf. Unfounded
Sets and Well-founded Semantics for General Logic Programs. In
Proc. 7th Symposium on Principles of Database Systems, pages
221- 230, 1988. August 1993.
Information p. 38 of 40 9 Algorithm
August 1993.