Abstract
In this work we extend the framework of logic-based fusion by Konieczny and Pino Pérez [8,9,10,11] to complex epistemic states. We present some postulates given in terms of the finite propositional logic which define merging operators of complex epistemic states. We state some representation theorems for these operators. When we consider concrete spaces, namely those where the epistemic states are total pre-orders over valuations, we obtain strong representation theorems. This new framework allows us to generalize, in a natural way, the revision operators presented by Benferhat et ál. [2]. As an application of our representation theorems, we define some merging operators over complex epistemic states and show some examples of these operators at work.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic of theory change: Partial meet contraction and revision functions. J. Symb. Log. 50(2), 510–530 (1985)
Benferhat, S., Konieczny, S., Papini, O., Pino Pérez, R.: Iterated revision by epistemic states: Axioms, semantics and syntax. In: Horn, W. (ed.) ECAI, pp. 13–17. IOS Press, Amsterdam (2000)
Darwiche, A., Pearl, J.: On the logic of iterated belief revision. In: Fagin, R. (ed.) TARK, pp. 5–23. Morgan Kaufmann, San Francisco (1994)
Darwiche, A., Pearl, J.: On the logic of iterated belief revision. Artificial Intelligence 89, 1–29 (1997)
Dubois, D., Prade, H.: Belief revision and possibility theory. In: Gärdenfors, P. (ed.) Belief Revision. Cambridge University Press, Cambridge (1992)
Gärdenfors, P.: Knowledge in Flux: Modeling the Dynamics of Epistemic States. MIT Press, Cambridge (1988)
Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artif. Intell. 52(3), 263–294 (1992)
Konieczny, S., Pino Pérez, R.: On the logic of merging. In: Cohn, A.G., Schubert, L.K., Shapiro, S.C. (eds.) KR, pp. 488–498. Morgan Kaufmann, San Francisco (1998)
Konieczny, S., Pino Pérez, R.: Merging with integrity constraints. In: Hunter, A., Parsons, S. (eds.) ECSQARU 1999. LNCS (LNAI), vol. 1638, pp. 233–244. Springer, Heidelberg (1999)
Konieczny, S., Pino Pérez, R.: Merging information under constraints: A logical framework. J. Log. Comput. 12(5), 773–808 (2002)
Konieczny, S., Pino Pérez, R.: Propositional belief base merging or how to merge beliefs/goals coming from several sources and some links with social choice theory. European Journal of Operational Research 160(3), 785–802 (2005)
Mata, A.: Sobre la fusión de estados epistémicos. Tesis de Maestría, Mérida (Junio 2010)
Meyer, T.: Merging epistemic states. In: Mizoguchi, R., Slaney, J.K. (eds.) PRICAI 2000. LNCS, vol. 1886, pp. 286–296. Springer, Heidelberg (2000)
Meyer, T.: On the semantics of combination operations. Journal of Applied Non-Classical Logics 11(1-2), 59–84 (2001)
Nayak, A.C., Pagnucco, M., Peppas, P.: Dynamic belief revision operators. Artificial Intelligence 142(2), 193–228 (2003)
Spohn, W.: Ordinal conditional functions: A dynamic theory of epistemic states. In: Harper, W.L., Skyrms, B. (eds.) Causation in Decision: Belief Change and Statistics, pp. 105–134. Kluwer, Dordrecht (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mata Díaz, A., Pino Pérez, R. (2011). Logic-Based Fusion of Complex Epistemic States. In: Liu, W. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2011. Lecture Notes in Computer Science(), vol 6717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22152-1_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-22152-1_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22151-4
Online ISBN: 978-3-642-22152-1
eBook Packages: Computer ScienceComputer Science (R0)