Abstract
This paper is about the fusion of multiple information sources represented using default logic. More precisely, the focus is on solving the problem that occurs when the standard-logic knowledge parts of the sources are contradictory, as default theories trivialize in this case. To overcome this problem, it is shown that replacing each formula belonging to Minimally Unsatisfiable Subformulas by a corresponding supernormal default allows appealing features. Moreover, it is investigated how these additional defaults interact with the initial defaults of the theory. Interestingly, this approach allows us to handle the problem of default theories containing inconsistent standard-logic knowledge, using the default logic framework itself.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Reiter, R.: A logic for default reasoning. Artificial Intelligence 13, 81–132 (1980)
Schaub, T.: On constrained default theories. In: Neumann, B. (ed.) European conference on Artificial Intelligence (ECAI 1992), New York, NY, USA, pp. 304–308. John Wiley & Sons, Inc., Chichester (1992)
Mikitiuk, A., Truszczyński, M.: Rational default logic and disjunctive logic programming. In: Workshop on Logic Programming and Non-Monotonic Reasoning (LPNMR 1993), pp. 283–299. MIT Press, Cambridge (1993)
Lukaszewicz, W.: Considerations on default logic: an alternative approach. Computational intelligence 4(1), 1–16 (1988)
Brewka, G.: Cumulative default logic: in defense of nonmonotonic inference rules. Artificial Intelligence 50(2), 183–205 (1991)
Bertossi, L., Hunter, A., Schaub, T. (eds.): Inconsistency Tolerance. LNCS, vol. 3300. Springer, Heidelberg (2005)
Konieczny, S., Grégoire, E.: Logic-based information fusion in artificial intelligence. Information Fusion 7(1), 4–18 (2006)
Besnard, P., Hunter, A.: Quasi-classical logic: Non-trivializable classical reasoning from incosistent information. In: Froidevaux, C., Kohlas, J. (eds.) ECSQARU 1995. LNCS, vol. 946, pp. 44–51. Springer, Heidelberg (1995)
Eiter, T., Gottlob, G.: On the complexity of propositional knowledge base revision, updates, and counterfactuals. Artificial Intelligence 57(2-3), 227–270 (1992)
Gottlob, G.: Complexity results for nonmonotonic logics. Journal of Logic Computation 2(3), 397–425 (1992)
Grégoire, E., Mazure, B., Piette, C.: Extracting muses. In: European Conference on Artificial Intelligence (ECAI 2006), pp. 387–391. IOS Press, Amsterdam (2006)
Grégoire, E., Mazure, B., Piette, C.: Boosting a complete technique to find mss and mus thanks to a local search oracle. In: International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 2300–2305 (2007)
Grégoire, E., Mazure, B., Piette, C.: Tracking muses and strict inconsistent covers. In: ACM/IEEE Conference on Formal Methods in Computer Aided Design (FMCAD 2006), pp. 39–46 (2006)
Brewka, G., Eiter, T.: Prioritizing default logic. In: Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday), Deventer, The Netherlands, pp. 27–45. Kluwer Academic Publishers, Dordrecht (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Besnard, P., Grégoire, É., Ramon, S. (2009). A Default Logic Patch for Default Logic. In: Sossai, C., Chemello, G. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2009. Lecture Notes in Computer Science(), vol 5590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02906-6_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-02906-6_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02905-9
Online ISBN: 978-3-642-02906-6
eBook Packages: Computer ScienceComputer Science (R0)