On the Semantics of Arbitration

DOI10.1142/S0218196797000095zbMath0865.68040OpenAlexW2025889479WikidataQ57641744 ScholiaQ57641744MaRDI QIDQ3128543

Peter Z. Revesz

Publication date: 16 June 1997

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196797000095

zbMATH Keywords

finite modelscombinationarbitrationrelational databasesknowledge basesrevisionminimal model changeupdata

Mathematics Subject Classification ID

Database theory (68P15) Knowledge representation (68T30) Other algebras related to logic (03G25) Information storage and retrieval of data (68P20) Other applications of logic (03B80)

Related Items (32)

Belief Merging by Examples ⋮ Belief Merging within Fragments of Propositional Logic ⋮ Merging in the Horn Fragment ⋮ Implementing Prioritized Merging with ASP ⋮ Propositional belief base merging or how to merge beliefs/goals coming from several sources and some links with social choice theory ⋮ Implementing semantic merging operators using binary decision diagrams ⋮ A split-combination approach to merging knowledge bases in possibilistic logic ⋮ Belief merging and the discursive dilemma: an argument-based account to paradoxes of judgment aggregation ⋮ Prime forms and minimal change in propositional belief bases ⋮ Syntactic Propositional Belief Bases Fusion with Removed Sets ⋮ Recovering Consistency by Forgetting Inconsistency ⋮ Confluence Operators ⋮ Sum-based weighted belief base merging: from commensurable to incommensurable framework ⋮ Fusion of possibilistic knowledge bases from a postulate point of view. ⋮ On the use of aggregation operations in information fusion processes. ⋮ Assertional Removed Sets Merging of DL-Lite Knowledge Bases ⋮ Confluence operators and their relationships with revision, update and merging ⋮ Logic based merging ⋮ Reasoning under inconsistency: a forgetting-based approach ⋮ Disjunctive merging: quota and Gmin merging operators ⋮ Merging First-Order Knowledge Using Dilation Operators ⋮ Infinitary belief revision ⋮ An argumentation framework for merging conflicting knowledge bases ⋮ Query answering DL-lite knowledge bases from hidden datasets ⋮ On the semantics of combination operations ⋮ Merging Qualitative Constraints Networks Using Propositional Logic ⋮ Merging Belief Bases Represented by Logic Programs ⋮ Majority merging by adaptive counting ⋮ Belief fusion and revision: an overview based on epistemic logic semantics ⋮ Belief base merging as a game ⋮ Logical representation and fusion of prioritized information based on guaranteed possibility measures: Application to the distance-based merging of classical bases ⋮ \(\text{DA}^2\) merging operators

This page was built for publication: On the Semantics of Arbitration