Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases
Proceedings of the 17th International Conference on Logic Programming
Coherent Composition of Distributed Knowledge-Bases Through Abduction
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Social Choice, Merging, and Elections
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Belief liberation (and retraction)
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
A logic-based approach to data integration
Theory and Practice of Logic Programming
A negotiation-style framework for non-prioritised revision
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
On the Definition of Essential and Contingent Properties of Subjective Belief Bases
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Knowledge and Information Systems
Evidential reasoning for the treatment of incoherent terminologies
Proceedings of the 2010 ACM Symposium on Applied Computing
On the measure of conflicts: Shapley Inconsistency Values
Artificial Intelligence
A model for the integration of prioritized knowledge bases through subjective belief games
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Solving conflicts in information merging by a flexible interpretation of atomic propositions
Artificial Intelligence
Merging belief bases by negotiation
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part I
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Duality between merging operators and social contraction operators
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
From axiomatic to strategic models of bargaining with logical beliefs and goals
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
The process of reaching agreement in meaning negotiation
Transactions on Computational Collective Intelligence VII
An axiomatic model for merging stratified belief bases by negotiation
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
Axiomatic characterization of belief merging by negotiation
Multimedia Tools and Applications
Tasks for agent-based negotiation teams: Analysis, review, and challenges
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
An intelligent agent may receive information about its environment from several different sources. How should the agent merge these items of information into a single, consistent piece? Taking our lead from the contraction+expansion approach to belief revision, we envisage a two-stage approach to this problem. The first stage consists of weakening the individual pieces of information into a form in which they can be consistently added together. The second, trivial, stage then consists of simply adding together the information thus obtained. This paper is devoted mainly to the first stage of this process, which we call social contraction. We consider both a postulational and a procedural approach to social contraction. The latter builds on the author's framework of belief negotiation models. With the help of Spohn-type rankings we provide two possible instantiations of this extended framework. This leads to two interesting concrete families of social contraction functions.