Majority merging by adaptive counting

Synthese 165 (2):203 - 223 (2008)
The present paper introduces a belief merging procedure by majority using the standard format of Adaptive Logics. The core structure of the logic ADM c (Adaptive Doxastic Merging by Counting) consists in the formulation of the conflicts arising from the belief bases of the agents involved in the procedure. A strategy is then defined both semantically and proof-theoretically which selects the consistent contents answering to a majority principle. The results obtained are proven to be equivalent to a standard majority operator for bases with partial support.
Keywords Belief merging  Adaptive logics  Majority merging  Dynamic reasoning  Multi-agent reasoning
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 21,476
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Franz Dietrich (2007). Strategy-Proof Judgment Aggregation. Economics and Philosophy 23 (3):269-300.
Bruce Chapman (2002). Rational Aggregation. Politics, Philosophy and Economics 1 (3):337-354.

View all 9 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

66 ( #66,990 of 1,911,741 )

Recent downloads (6 months)

29 ( #24,764 of 1,911,741 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.