Language features for flexible handling of exceptions in information systems
ACM Transactions on Database Systems (TODS)
Propositional knowledge base revision and minimal change
Artificial Intelligence
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of propositional knowledge base revision, updates, and counterfactuals
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Non-deterministic languages to express deterministic transformations
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Update semantics of relational views
ACM Transactions on Database Systems (TODS)
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Are the terms “version” and “variant” orthogonal to one another?
ACM SIGMOD Record
Possibilistic Merging and Distance-Based Fusion of Propositional Information
Annals of Mathematics and Artificial Intelligence
Belief Fusion: Aggregating Pedigreed Belief States
Journal of Logic, Language and Information
Arbitration (or How to Merge Knowledge Bases)
IEEE Transactions on Knowledge and Data Engineering
Coherent Composition of Distributed Knowledge-Bases Through Abduction
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Merging with Integrity Constraints
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
Using methods of declarative logic programming for intelligent information agents
Theory and Practice of Logic Programming
Artificial Intelligence - Special issue on nonmonotonic reasoning
A negotiation-style framework for non-prioritised revision
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
A modal logic framework for multi-agent belief fusion
ACM Transactions on Computational Logic (TOCL)
About the fusion of legal knowledge with exceptions
ICAIL '03 Proceedings of the 9th international conference on Artificial intelligence and law
An argumentation framework for merging conflicting knowledge bases
International Journal of Approximate Reasoning
Model-based belief merging without distance measures
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Syntactic Propositional Belief Bases Fusion with Removed Sets
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Merging element fuzzy cognitive maps
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Removed Sets Fusion: Performing Off The Shelf
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
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
Non-deterministic Distance Semantics for Handling Incomplete and Inconsistent Data
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Merging Logic Programs under Answer Set Semantics
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
An egalitarist fusion of incommensurable ranked belief bases under constraints
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Coherent integration of databases by abductive logic programming
Journal of Artificial Intelligence Research
The strategy-proofness landscape of merging
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
An epistemic logic for arbitration
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Implementing PS-Merge Operator
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
Partial satisfiability-based merging
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Two-Agent Conflict Resolution with Assumption-Based Argumentation
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
SUM'10 Proceedings of the 4th international conference on Scalable uncertainty management
A framework for reasoning under uncertainty based on non-deterministic distance semantics
International Journal of Approximate Reasoning
Entity Resolution and Information Quality
Entity Resolution and Information Quality
Solving conflicts in information merging by a flexible interpretation of atomic propositions
Artificial Intelligence
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
An argumentation framework for merging conflicting knowledge bases: the prioritized case
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Duality between merging operators and social contraction operators
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Fundamenta Informaticae
A Model-Theoretic Approach to Belief Change in Answer Set Programming
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Katsuno and Mendelzon divide theory change, the problem of adding new information to a logical theory, into two types: revision and update. We propose a third type of theory change: arbitration. The key idea is the following: the new information is considered neither better nor worse than the old information represented by the logical theory. The new information is simply one voice against a set of others already incorporated into the logical theory. From this follows that arbitration should be commutative. First we define arbitration by a set of postulates and then describe a model-theoretic characterization of arbitration for the case of propositional logical theories. We also study weighted arbitration where different models of a theory can have different weights.