Abstract
Computationally the hardest part of revision and contraction operations in belief bases is finding the kernel/remainder set. In this chapter, we present algorithms for computing these sets. The similarities between the algorithms suggests that they are deeply related. We present this relation formally and show examples where computing the remainder set is much easier than computing the kernel and examples where the opposite is the case.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We use here the term class as a synonym for set of sets.
References
Marcelo A. Falappa, Eduardo L. Fermé, and Gabriele Kern-Isberner. On the logic of theory change: Relations between incision and selection functions. In Gerhard Brewka, Silvia Coradeschi, Anna Perini, and Paolo Traverso, editors, Proceedings of the 17th European Conference on Artificial Intelligence (ECAI 2006), pages 402–406, Riva del Garda, Italy, 2006. IOS Press.
Aditya Kalyanpur. Debugging and repair of owl ontologies. PhD thesis, University of Maryland, College Park, MD, USA, 2006.
Aditya Kalyanpur, Bijan Parsia, Evren Sirin, and James Hendler. Debugging unsatisfiable classes in OWL ontologies. Journal of Web Semantics, 3(4), 2005.
R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32(1):57–95, 1987.
Stefan Schlobach and Ronald Cornet. Non-standard reasoning services for the debugging of description logic terminologies. In Georg Gottlob and Toby Walsh, editors, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI 03), pages 355–362, Acapulco, Mexico, 2003. Morgan Kaufmann.
Renata Wassermann. An algorithm for belief revision. In Anthony G. Cohn, Fausto Giunchiglia, and Bart Selman, editors, Proceedings of the 7th International Conference on Principles of Knowledge Representation and Reasoning (KR’00), pages 345–352, Breckenridge, Colorado, USA, Abril, 15-20 2000. Morgan Kaufmann.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 The Author(s)
About this chapter
Cite this chapter
Ribeiro, M.M. (2013). Algorithms for Belief Bases. In: Belief Revision in Non-Classical Logics. SpringerBriefs in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-4186-0_8
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4186-0_8
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4185-3
Online ISBN: 978-1-4471-4186-0
eBook Packages: Computer ScienceComputer Science (R0)