Konieczny, S.; Pino P erez, R. 1998. On the logic of merging. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 488-498.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....revision to database updating [KM92] These also offer intuitive abstract constraints for revision updating. For a review of belief revision theory see [DP98] There are some more concrete proposals for knowledgebase merging that adhere to belief revision postulates. In Konieczny and Pino Perez [KP98] there is a proposal for merging beliefs based on semantically characterizing interpretations which are closest to some sets of interpretations. But the approach does not exploit any meta level information such as preferences. The approach has been generalized by considering merging with ....

....being accepted or negated in the merged form. In contrast, these alternatives are concerned with using the priorities to preserve as much of the beliefs as is permitted without violating consistency. 5. 3 Knowledgebase merging techniques In addition to the techniques of Konieczny and Pino Perez [KP98, KP99] that we discussed in the previous subsection, we need to consider knowledgebase merging, by Baral et al. [BKMS92] which offers two approaches to combining prioritized theories. These two approaches assume a linear ordering over a set of sets of formulae. The first technique is top down ....

S Konieczny and R Pino Perez. On the logic of merging. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR98), pages 488--498. Morgan Kaufmann, 1998.

.... has been pointed out that the merging of information is similar to the operations studied in social choice theory where the aim is to provide fair and equitable methods for aggregating the preferences of the members of a society to produce a single relation reflecting the preferences of society [10, 14, 11, 15] it seems reasonable to expect that one rationality criterion for any proposed framework for the merging of information is that it be able to deal satisfactorily with the problems raised in social choice theory. The following example demonstrates the difficulty in devising a social ....

....of V , the set of valuations) 1. max (E) v) maxf i (v) j i 2 I (jEj)g 1 (v) if i (v) j (v) 8i; j 2 I 2 1 (E) v) if i (v) j (v) 8i; j 2 I 2 minf i (v) j i 2 I 4. E) v) i2I (jEj) i (E) v) These operations have been proposed and discussed in [10, 5, 4, 16, 17, 19], amongst others. Observe that max and min1 are (P; P ) capped, min2 is (P; 2P ) capped, but that is not (P; Q) capped for any Q. We do know, however, that is (P; nP; n) capped for every n 1. The construction of min1 can be explained as follows. Identify the interpretations for ....

Sebastien Konieczny and Ramon Pino-Perez. On the logic of merging. In A. G. Cohn, L. Schubert, and S. C. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98), pages 488--498, San Francisco, California, 1998. Morgan Kaufmann.

....This section presents a new logical interpretation of Theory of Evidence. This interpretation is the one presented in [4] where we also proved some formal equivalences between the Maximum of Plausibility Strategy and one Knowledge Base Merging operator defined by Konieczny and Pino Perez [9], 8] Let us first recall some definitions. 2.1 Preliminaries Definition 1. A multi set is a set where repeated occurrences of an element may exist. A knowledge set is a multi set of propositional formulas . Example 1. If A and B are propositional letters, then KS = B; AB; A; AB;AB] is a ....

S. Konieczny and R. Pino-Perez. On the logic of merging. In Proc. of KR'98, Trento, 1998.

....Thus becomes a withdrawal operator. 5 Related work on merging As we said at the start of Section 2 the general problem of merging information coming from di#erent sources has already received various treatments. In this section we briefly mention a few of these, some of which (namely [2, 11, 14]) actually generalise further than us in that they consider the problem of simultaneously merging together n pieces of information where possibly n 2. A di#erence between the present approach and papers such as [11, 12, 15] is that the latter are interested only in fair merging, i.e. they ....

....In this section we briefly mention a few of these, some of which (namely [2, 11, 14] actually generalise further than us in that they consider the problem of simultaneously merging together n pieces of information where possibly n 2. A di#erence between the present approach and papers such as [11, 12, 15] is that the latter are interested only in fair merging, i.e. they assume that the merging should always give equal precedence to the pieces of information involved, regardless of their source. In the case of binary merging which we consider this forces the merge operator to be commutative. Other ....

S. Konieczny and R. Pino-Perez, On the logic of merging, in Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98) (1998) 488--498.

....a consistent view of the world. This demand is often complicated by the fact that such agents receive conflicting pieces of information from different sources. The process of combining possibly inconsistent pieces of information, known as merging, has started to receive more attention recently [7, 1, 2, 5, 6, 13, 12, 15]. In this paper we propose a framework for the modelling of merging operations. The proposal has its roots in the work of Spohn [14] Unlike most approaches we adopt a description of merging on the level of epistemic states instead of knowledge bases. In section 2 we give a brief introduction to ....

....The proposal has its roots in the work of Spohn [14] Unlike most approaches we adopt a description of merging on the level of epistemic states instead of knowledge bases. In section 2 we give a brief introduction to the merging of knowledge bases, focussing on the work of Konieczny and Pino Prez [5]. This is followed, in section 3, by a description of our framework for the merging of epistemic states. In section 4 we construct a number of merging operations and show how they measure up to proposed properties of merging. Section 5 discusses links between merging and the infobases of Meyer ....

[Article contains additional citation context not shown here]

Sbastien Konieczny and l{amdn Pino-Prez. On the logic of merging. In A. G. Cohn, L. Schubert, and S.C. Shapiro, editors, Principles of Knowledge Ilepresentation and Reasoning: Proceedings of the Sizth International Conference (KII '98), pages 488-498, San Francisco, California, 1998. Morgan Kaufmann.

....representations of semantic merging operations Author names here. 1 Introduction Intelligent agents have to be able to take di ering points of view into account to produce a coherent view of the world. In the arti cial intelligence literature this is merging or fusion [8, 10, 2, 1, 11, 3]. A promising approach to merging is to work on the level of epistemic states, where an epistemic state contains the beliefs of an agent, as well as an indication of the strength of these beliefs. In this paper we discuss syntactic representations of epistemic states in terms of two types of ....

.... max (s) max(s) min (s) min(s) min1 (s) 8 : 2 min(s) if s(i) s(j) 8i; j 2 f1; jsjg; 2 min(s) 1 otherwise; min2 (s) s(i) if s(i) s(j) 8i; j 2 f1; jsjg min(s) 1 otherwise: max was proposed in [10] as a generalisation of a proposal in [8]. In [2] which employs a possibilistic logic setting, max is referred to as idempotent conjunction and min as disjunctive aggregation. min1 and min2 are variations of min . min1 was proposed in [10] where it is referred to as min . As far as we know min2 has not been proposed ....

[Article contains additional citation context not shown here]

Sebastien Konieczny and Ramon Pino-Perez. On the logic of merging. In A. G. Cohn, L. Schubert, and S. C. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98), pages 488-498, San Francisco, California, 1998. Morgan Kaufmann.

....that we employ. This has important implications for both merging and social choice theory. 1 Introduction Intelligent agents have to be able to take differing points of view into account to produce a coherent view of the world. In the artificial intelligence literature, this is merging [Konieczny and Pino Perez, 1998; Meyer, 2000] Research on merging usually assumes a list or multiset of pieces of information (of some kind) and provides operations producing a new piece of information the result of merging the input. Information is usually represented as a sentence in an appropriate logic where, in the ....

....of merging the input. Information is usually represented as a sentence in an appropriate logic where, in the spirit of [Katsuno and Mendelzon, 1991] the understanding is that the sentence represents the set of all sentences entailed by it. Such a sentence is referred to as a knowledge base. In [Konieczny and PinoP erez, 1998] a general framework is proposed for this kind of merging by providing a set of postulates that every merging operation have to satisfy. In [Meyer, 2000] it is argued that a more general framework is needed and that merging ought to be performed on epistemic states instead of knowledge bases. An ....

[Article contains additional citation context not shown here]

Sebastien Konieczny and Ramon Pino-Perez. On the logic of merging. In A. G. Cohn, L. Schubert, and S. C. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98), pages 488--498, San Francisco, California, 1998. Morgan Kaufmann.

.... formal framework for solve this belief (goals) aggregation step, is the use of knowledge merging operators [CH97, Cho98, BKMS92, LM99, Rev97, Kon00] In some related works di erent sets of logical properties that knowledge merging operators have to satisfy have been proposed [Rev97, LS98, LM99, KP98, KP99] Those logical characterisations are used to de ne a taxonomy of merging operators, that allows to compare di erent merging methods and to choose the method corresponding to the behaviour wanted in a particular application. We will focus on the merging with integrity constraints ....

....So, it is this aggregation step of the individual preferences (distances) in a global one that makes behaviour di erences between the families. The three families stated next are well known, the family has been used in [Rev93, Rev97] the family in [Rev97, LM99, KP99] and the 4 family in [KP98, KP99] De nition 4 Let be a knowledge set, I be an interpretation and d be a distance between interpretations. The Max, GMax distances are de ned respectively by: d d;Max (I ; max 2 d(I ; d d; I ; Suppose = f 1 : n g. For each interpretation I we ....

S. Konieczny and R. Pino Perez. On the logic of merging. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pages 488-498, 1998.

....Le probl eme pos e par la fusion de E etant donn e IC est de caract eriser une formule 4 IC (E) consid er ee comme la croyance globale du groupe form e par les n sources fusionn ees. R ecemment, plusieurs familles d op erateurs de fusion ont et e d efinies et caract eris ees logiquement [24, 19, 17, 12, 13, 3]. Certains de ces op erateurs [24, 19, 17, 13] appel es parfois model based consistent a d efinir les mod eles de 4 IC (E) comme les mod eles pr ef er es de IC selon un crit ere d ependant de E. G en eralement, cette information pr ef erentielle est repr esent ee par un pr e ordre ....

S. Konieczny and R. Pino P'erez. On the logic of merging. In Proc. of KR'98, pages 488--498, 1998.

....knowledge knows that b is true whereas none of the expert knows it. This was called implicit knowledge in [8] However, simply put these knowledge bases together is a wrong way since there could be contradictions between some experts. Some logical characterizations of merging have been proposed [18, 19, 13, 14, 16, 15, 11]. In this paper we extend these works by proposing a logical characterization when the result of the merging has to obey to a set of integrity constraints. We de ne two subclasses of merging operators, namely majority merging and arbitration operators. The former striving to satisfy a maximum of ....

....operators. In section 4 we de ne two families of merging operators illustrating the logical de nition. In section 5 we show the connections with other related works, rst we show the close connection between belief revision and merging operators, then we show that this work extends the one of [11]. Finally we show that Liberatore and Schaerf commutative revision operators can be seen as a special case of merging operators. In section 6 we give some conclusions and discuss future work. 2 Preliminaries We consider a propositional language L over a nite alphabet P of propositional atoms. ....

[Article contains additional citation context not shown here]

S. Konieczny and R. Pino Perez. On the logic of merging. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pages 488-498, 1998.

No context found.

Konieczny, S.; Pino P erez, R. 1998. On the logic of merging. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 488-498.

No context found.

S. Konieczny and R. Pino Prez. On the logic of merging. Proc. of KR'98, 488-498, 1998.

No context found.

Konieczny, S., Pino Perez, R.: On the logic of merging. InProc. of KR'98, pp. 488-498, 1998.

No context found.

S. Konieczny and R. Pino-Perez. On the logic of merging. In Proc. of KR'98, Trento, 1998.

No context found.

S. Konieczny and R. Pino-P'erez. On the logic of merging. In Principles of Knowledge Representation and Reasoning (KR'98), pages 488--498, 1998.

No context found.

S. Konieczny and R. Pino-Perez. On the logic of merging. In Proc. of KR'98, Trento, 1998.

No context found.

S. Konieczny and R. Pino-Prez. On the logic of merging. In Principles of Knowledge Representation and Reasoning (KR'98), pages 488--498, 1998.

No context found.

S ebastian Konieczny and Ram on Pino P erez. On the logic of merging. In A. G. Cohn, L. Schubert, and S. C. Shapiro, editors, KR'98: Principles of Knowledge Representation and Reasoning, pages 488--498. Morgan Kaufmann, San Francisco, California, 1998.

No context found.

S. Konieczny and R. Pino-Perez. On the logic of merging. In Proc. of KR'98, Trento, 1998.

No context found.

S Konieczny and R Pino Perez. On the logic of merging. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pages 488--498. Morgan Kaufmann, 1998.

No context found.

S Konieczny and R Pino Perez. On the logic of merging. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pages 488--498. Morgan Kaufmann, 1998.

No context found.

S Konieczny and R Pino Perez. On the logic of merging. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pages 488--498. Morgan Kaufmann, 1998.

No context found.

S Konieczny and R Pino Perez. On the logic of merging. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR98), pages 488--498. Morgan Kaufmann, 1998.

No context found.

S Konieczny and R Pino Perez. On the logic of merging. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pages 488--498. Morgan Kaufmann, 1998.

No context found.

S. Konieczny and R. Pino Perez. On the logic of merging. In Proc. of KR'98, pages 488--498, 1998.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC