S. Konieczny, J. Lang, and P. Marquis. Distance-based merging: a general framework and some complexity results. In D. Fensel, F. Giunchiglia, D. McGuiness, and M. Williams, editors, Proceedings of the Eighth International Conference on the Principles of Knowledge Representation and Reasoning, pages 97--108, San Francisco, 2002. Morgan Kaufmann. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Distance-based Merging: A General Framework and some.. - Konieczny, Lang, Marquis (2001) (1 citation) Self-citation (Konieczny Lang Marquis) (Correct)
....we investigate the logical properties and identify the complexity of each operator under consideration. As a by product, the complexity of several model based merging operators already pointed out so far is also identi ed. The full proofs of the results given in this article can be found in [ Konieczny et al. 2001 ] See [Konieczny, 2000] for one step in that direction. 2 FORMAL PRELIMINARIES We consider a propositional language PROPPS built up from a nite set PS of propositional symbols in the usual way. An interpretation is a total function from PS to BOOL = f0; 1g. The set of all interpretations ....
.... rst aggregation step (f) would also be possible, but leads to rather lengthy technical tricks to be de ned properly in case where the second aggregation function g is not purely ordinal (i.e. g di erent from max and leximax) and we ignore this possibility here (see the long version of the paper [ Konieczny et al. 2001 ] All these functions satisfy the requirements imposed in De nition 3; all of them are symmetric but weighted sum (except when q is uniform) Many other possible choices for f and g can be found in the literature of multi criteria decision making (and to a smaller extent in the literature of ....
[Article contains additional citation context not shown here]
S. Konieczny, J. Lang, and P. Marquis. Distance-based merging: a general framework and some complexity results. Technical report, IRIT, ftp://ftp.irit.fr/pub/IRIT/RPDMP/DBMC.ps.gz, 2001.
Distance-based merging: A general framework and some.. - Konieczny, Lang, Marquis (2001) (1 citation) Self-citation (Konieczny Lang Marquis) (Correct)
....montrons qu en imposant tr es peu de conditions sur les param etres, plusieurs propri et es logiques essentielles pour les op erateurs de fusion sont imm ediatement satisfaites par les op erateurs a partir de distances. Les preuves compl etes des r esultats donn es dans cet article sont dans [11]. 2 Pr eliminaires On consid ere un langage propositionnel PROPPS , construit a partir d un ensemble fini PS de symboles propositionnels et les constantes (vrai) et (faux) de la mani ere usuelle. Une interpr etation est une fonction totale de PS dans BOOL = f0; 1g. L ensemble de toutes les ....
S. Konieczny, J. Lang, and P. Marquis. Distance-based merging: a general framework and some complexity results. Technical report, IRIT, accessible par FTP anonyme `a ftp://ftp.irit.fr/pub/IRIT/RPDMP/DBMC.ps.gz, 2001.
Two Approaches to Merging Knowledge Bases - James Delgrande And (Correct)
No context found.
S. Konieczny, J. Lang, and P. Marquis. Distance-based merging: a general framework and some complexity results. In D. Fensel, F. Giunchiglia, D. McGuiness, and M. Williams, editors, Proceedings of the Eighth International Conference on the Principles of Knowledge Representation and Reasoning, pages 97--108, San Francisco, 2002. Morgan Kaufmann.
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