Abstract
We propose a framework that brings together two major forms of default reasoning in Artificial Intelligence: default property classification in static domains, and default property persistence in temporal domains. Emphasis in this work is placed on the qualification problem, central when dealing with default reasoning, and in any attempt to integrate different forms of such reasoning.
Our framework can be viewed as offering a semantics to two natural problems: (i) that of employing default static knowledge in a temporal setting, and (ii) the dual one of temporally projecting and dynamically updating default static knowledge.
The proposed integration is introduced through a series of example domains, and is then formalized through argumentation. The semantics follows a pragmatic approach. At each time-point, an agent predicts the next state of affairs. As long as this is consistent with the available observations, the agent continues to reason forward. In case some of the observations cannot be explained without appealing to some exogenous reason, the agent revisits and revises its past assumptions.
We conclude with some formal results, including an algorithm for computing complete admissible argument sets, and a proof of elaboration tolerance, in the sense that additional knowledge can be gracefully accommodated in any domain.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
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.
References
Horty, J., Thomason, R., Touretzky, D.: A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks. Artificial Intelligence 42(2-3), 311–348 (1990)
Reiter, R.: A Logic for Default Reasoning. Artificial Intelligence 13(1-2), 81–132 (1980)
Hanks, S., McDermott, D.: Nonmonotonic Logic and Temporal Projection. Artificial Intelligence 33(3), 379–412 (1987)
McCarthy, J., Hayes, P.: Some Philosophical Problems from the Standpoint of Artificial Intelligence. Machine Intelligence 4, 463–502 (1969)
Shanahan, M.: Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. MIT Press, Cambridge (1997)
Kakas, A., Michael, L., Miller, R.: Fred meets Tweety. In: Proc. of the 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 747–748 (2008)
Kakas, A., Michael, L., Miller, R.: Modular-E: An Elaboration Tolerant Approach to the Ramification and Qualification Problems. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 211–226. Springer, Heidelberg (2005)
Thielscher, M.: The Qualification Problem: A Solution to the Problem of Anomalous Models. Artificial Intelligence 131(1-2), 1–37 (2001)
Bondarenko, A., Dung, P., Kowalski, R., Toni, F.: An Abstract Argumentation-Theoretic Approach to Default Reasoning. Artificial Intelligence 93(1-2), 63–101 (1997)
Lin, F.: Embracing Causality in Specifying the Indirect Effects of Actions. In: Proc. of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), pp. 1985–1991 (1995)
Lin, F., Reiter, R.: State Constraints Revisited. Journal of Logic and Computation 4(5), 655–678 (1994)
Kakas, A., Toni, F.: Computing Argumentation in Logic Programming. Journal of Logic and Computation 9, 515–562 (1999)
Kakas, A., Miller, R., Toni, F.: An Argumentation Framework for Reasoning about Actions and Change. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 78–91. Springer, Heidelberg (1999)
Doherty, P., Gustafsson, J., Karlsson, L., Kvarnström, J.: TAL: Temporal Action Logics Language Specification and Tutorial. Electronic Transactions on Artificial Intelligence 2(3-4), 273–306 (1998)
Chintabathina, S., Gelfond, M., Watson, R.: Defeasible Laws, Parallel Actions, and Reasoning about Resources. In: Proc. of the 8th International Symposium on Logical Formalizations of Commonsense Reasoning (Commonsense 2007), pp. 35–40 (2007)
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
Michael, L., Kakas, A. (2009). Knowledge Qualification through Argumentation. In: Erdem, E., Lin, F., Schaub, T. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2009. Lecture Notes in Computer Science(), vol 5753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04238-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-04238-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04237-9
Online ISBN: 978-3-642-04238-6
eBook Packages: Computer ScienceComputer Science (R0)