UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

The non-archimedean polynomials and merging of stratified knowledge bases

Ma, J; Liu, W; Hunter, A; (2009) The non-archimedean polynomials and merging of stratified knowledge bases. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , 5590 LNAI 408 - 420. 10.1007/978-3-642-02906-6_36.

Full text not available from this repository.

Abstract

In this paper, a new algebraic representation by the non-Archimedean fields is proposed to model stratified/ranked knowledge bases. The non-Archimedean representation is in the form of the non-Archimedean polynomials. With the non-Archimedean representation, the most widely used ordering strategies are easily induced and compared. Moreover, a framework of prioritized merging operators using the non-Archimedean representation is presented. It is shown that these merging operators satisfy the prioritized merging properties proposed by Delgrande, Dubois and Lang. In addition, several prioritized merging operators in the literature are proved to be special cases of the framework. Furthermore, the egalitarist fusion of incommensurable ranked bases by Benferhat, Lagrue and Rossit is also derived from the non-Archimedean representation. © 2009 Springer Berlin Heidelberg.

Type:Article
Title:The non-archimedean polynomials and merging of stratified knowledge bases
DOI:10.1007/978-3-642-02906-6_36
UCL classification:UCL > School of BEAMS > Faculty of Engineering Science > Computer Science

Archive Staff Only: edit this record