Abstract
Many researchers have proposed argumentation-based rear-soning as a viable alternative to reasoning systems with a flat epistemological structure. Perhaps one of the longest standing approaches has been in the Oscar project, led by John Pollock. Unfortunately, without a formal semantics, it is often difficult to evaluate the various incarnations of defeasible reasoning. We provide a semantics for Pollocks defeasible reasoning in terms of Bondarenko et al.’s unified framework for default reasoning. We also indicate some internal inconsistencies between the motivation behind and definition’s governing Pollock’s system.
An extended version of this paper with full proofs of all theorems is also available. The reader should feel free to contact the authors for a copy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bondarenko, A., Dung, P.M., Kowalski, R.A., Foni, F. (1997) An Abstract, Argumentation-theoretic Approach to Default Reasoning. Artificial Intelligence (93) pp63–101
Doerpmund, J. (1997) Limitations of Skeptical Default Reasoning; in Procedings of International Conference on Uncertainty in Artificial Intelligence
Y. Dimopoulos, B. Nebel, F. Toni, (1999) Preferred Arguments are Harder to Compute than Stable Extensions, in: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI’99), Stockholm, Sweden
Dung, P.M. (1995) The Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-person games Artificial Intelligence, (77) pp321–357
Lifschitz, V. (1987) Pointwise Circumscription, in Ginsberg, M. (ed) Readings in Nonmonotonic Reasoning. Morgan Kauffman, Los Altos
Pollock, J. (1994) Justification and Defeat Artificial Intelligence (67) pp377–408
Pollock, J. (1995) Cognitive Carpentry: A Blueprint for How to Build a Person. MIT Press, London
Pollock, J. (1996) Implementing Defeasible Reasoning Workshop on Computational Dialectics, International Conference on Formal and Applied Practical Reasoning. Bonn, Germany
Reiter, R. (1980) A Logic for Default Reasoning. Artificial Intelligence (13) pp81–132
Simari, G.R., Loui, R.P. (1992) A Mathematical Treatment of Defeasible Reasoning and its Implementation Artificial Intelligence (53) pp125–157
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vo, Q.B., Thurbon, J. (1999). Semantics for Pollock’s Defeasible Reasoning. In: Foo, N. (eds) Advanced Topics in Artificial Intelligence. AI 1999. Lecture Notes in Computer Science(), vol 1747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46695-9_27
Download citation
DOI: https://doi.org/10.1007/3-540-46695-9_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66822-0
Online ISBN: 978-3-540-46695-6
eBook Packages: Springer Book Archive