Propositional knowledge base revision and minimal change
Artificial Intelligence
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
On the semantics of theory change: arbitration between old and new information
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Integration of weighted knowledge bases
Artificial Intelligence
Arbitration (or How to Merge Knowledge Bases)
IEEE Transactions on Knowledge and Data Engineering
ESAW '01 Proceedings of the Second International Workshop on Engineering Societies in the Agents World II
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Data Merging: Theory of Evidence vs. Knowledge-Bases Merging Operators
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Propositional Distances and Preference Representation
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Specifying the Merging of Desires into Goals in the Context of Beliefs
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Logic-based approaches to information fusion
Information Fusion
An unbiased approach to iterated fusion by weakening
Information Fusion
Merging operators: Beyond the finite case
Information Fusion
Social choice theory, belief merging, and strategy-proofness
Information Fusion
Merging Qualitative Constraints Networks Using Propositional Logic
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Merging Belief Bases Represented by Logic Programs
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Implementing PS-Merge Operator
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
SUM'10 Proceedings of the 4th international conference on Scalable uncertainty management
Attribute mapping as a foundation of ontology alignment
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part I
Judgment aggregation rules based on minimization
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Group intention is social choice with commitment
COIN@AAMAS'10 Proceedings of the 6th international conference on Coordination, organizations, institutions, and norms in agent systems
Logic-based fusion of complex epistemic states
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
A principled analysis of merging operations in possibilistic logic
UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
Introduction to inconsistency tolerance
Inconsistency Tolerance
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Conciliation and consensus in iterated belief merging
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A classification of ontology modification
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Belief merging using normal forms
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Introduction to judgment aggregation
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Axiomatic characterization of belief merging by negotiation
Multimedia Tools and Applications
| Hi-index | 0.00 |
We consider, in this paper, the problem of knowledge base merging with integrity constraints. We propose a logical characterization of those operators and give a representation theorem in terms of preorders on interpretations. We show the close connection between belief revision and merging operators and we show that our proposal extends the pure merging case (i.e. without integrity constraints) we study in a previous work. Finally we show that Liberatore and Schaerf commutative revision operators can be seen as a special case of merging.