Abstract
Semi-revision is a model of belief change that differs from revision in that a new formula is not always accepted. Later, Fuhrmann defined multiple semi-revision by replacing a new formula with a set of formulae as the new information, which results in a merging operator called a partial meet merging operator. The problem for the partial meet merging operator is that it needs additional information to define a selection function which selects a subset from a set of maximal consistent subbases of an inconsistent knowledge base. In this paper, we will extend multiple semi-revision in the framework of possibilistic logic. The advantage of possibilistic logic is that it provides an ordering relation on formulae in knowledge bases, which makes it easy to define a selection function practically.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alchourrón, C.E., Gärdenfors, P., Markinson, D.: On the logic of theory change: Partial meet contraction and revision functions. Journal of Symbolic Logic 50, 510–530 (1985)
Baral, C., Kraus, M.J., Subrahmanian, V.S.: Combining knowledge bases consisting in first order theories. Computational Intelligence 8, 45–71 (1992)
Benferhat, S., Dubois, D., Prade, H., Williams, M.A.: A practical approach to fusing prioritized knowledge bases. In: Barahona, P., Alferes, J.J. (eds.) EPIA 1999. LNCS (LNAI), vol. 1695, pp. 222–236. Springer, Heidelberg (1999)
Benferhat, S., Dubois, D., Prade, H.: Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study. Part 2: The prioritized case. In: Logic at work: essays dedicated to the memory of Helena Rasiowa, Ewa Orow, pp. 473–511. Physica-Verlag, New York (1998)
Benferhat, S., Dubois, D., Kaci, S., Prade, H.: Possibilistic merging and distance-based fusion of propositional information. Annals of Mathematics and Artificial Intelligence 34, 217–252 (2002)
Benferhat, S., Kaci, S.: Fusion of possibilitic knowledge bases from a postulate point of view. International Journal of Approximate Reasoning 33(3), 255–285 (2003)
Brewka, G.: Preferred subtheories: an extended logical framework for default reasoning. In: Proc. of IJCAI 1989, pp. 1043–1048 (2003)
Chopra, S., Ghose, A., Meyer, T.: Non-prioritized ranked belief change. Journal of Philosophical Logic 32(4), 417–443 (2003)
Dubois, D., Prade, H.: Epistemic entrenchment and possibilistic logic. Artificial Intelligence 50, 223–239 (1991)
Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Handbook of logic in Aritificial Intelligence and Logic Programming, vol. 3, pp. 439–513. Oxford University Press, Oxford (1994)
Fuhrmann, A.: An Essay on Contraction. Stanford University, CSLI Publications & FoLLI (1996)
Gärdenfors, P.: Knowledge in Flux-Modeling the Dynamic of Epistemic States. MIT Press, Mass (1988)
Konieczny, S., Pino Pérez, R.: On the logic of merging. In. In: Proc. of KR 1998, pp. 488–498 (1998)
Liberatore, P., Schaerf, M.: Arbitration (or How to Merge Knowledge Bases). IEEE Transaction on Knowledge and Data Engineering 10(1), 76–90 (1998)
Lin, J., Mendelzon, A.: Merging databases under constraints. International Journal of Cooperative information Systems 7(1), 55–76 (1998)
Hansson, S.: Kernel contraction. Journal of Symbolic Logic 59(3) (1994)
Hansson, S.: Semi-revision. Journal of Applied Non-Classical Logic, 151–175 (1997)
Hansson, S.: A survey of non-prioritized belief revision. Erkenntnis 50, 413–427 (1999)
Nelbel, B.: Syntax-Based Approaches to Belief Revision. In: Gärdenfors, P. (ed.) Cambridge Tracts in Theoretical Computer Science, vol. 29, pp. 52–88. Cambridge University Press, Cambridge (1992)
Qi, G., Liu, W., Glass, D.H.: A Split-Combination Method for Merging Inconsistent Possibilistic Knowledge Bases. In: Proc. KR 2004, pp. 348–356 (2004)
Qi, G., Liu, W., Glass, D.: Combining Individually Inconsistent Prioritized Knowledge Bases. In: Proc. of NMR 2004, pp. 342–349 (2004)
Qi, G., Liu, W., Bell, D.A.: Measureing conflict and agreement in a prioritized knowledge base. In: Proc. of IJCAI 2005 (2005) (to appear)
Revesz, P.Z.: On the semantics of arbitration. International Journal of Algebra and Computation 7(2), 133–160 (1997)
Williams, M.A.: A practical approach to belief revision: reason-based change. In: Proc. of KR 1996, pp. 412–421 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qi, G., Liu, W., Bell, D.A. (2005). Multiple Semi-revision in Possibilistic Logic. In: Godo, L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2005. Lecture Notes in Computer Science(), vol 3571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11518655_40
Download citation
DOI: https://doi.org/10.1007/11518655_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27326-4
Online ISBN: 978-3-540-31888-0
eBook Packages: Computer ScienceComputer Science (R0)