Abstract
In several formalisms of classical argumentation two kinds of defeaters are considered: rebutting and undercutting. The former represents an attack to a conclusion and the latter an attack to an inference step. Defeasible Logic Programming (DeLP) is a formalism that combines argumentation and logic programming and provides a concrete argumentation system where arguments are built using program rules and facts. DeLP allows to identify arguments whose conclusions or intermediate conclusions are in contradiction. In that way, rebutting defeaters are captured. Nevertheless, in DeLP is not possible to represent an explicit attack to a program rule in order to capture undercutting defeaters. The contribution of this work is to extend the formalism of DeLP in order to allow the representation of both support and attack for defeasible rules.Therefore, it will be possible to build arguments that provide reasons for or against a defeasible rule and thus, undercutting defeaters and backings could be constructed.
Partially supported by UNS (PGI 24/ZN18) and CONICET (PIP 112-200801-02798).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chesñevar, C.I., Maguitman, A.G., Loui, R.P.: Logical models of argument. ACM Computing Surveys 32(4), 337–383 (2000)
García, A.J., Simari, G.R.: Defeasible logic programming: An argumentative approach. Theory and Practice of Logic Programming 4(1-2), 95–138 (2004)
Nute, D.: Defeasible reasoning: a philosophical analysis in prolog. In: Fetzer, J.H. (ed.) Aspects of Artificial Intelligence, pp. 251–288. Kluwer Academic Pub., Dordrecht (1988)
Nute, D.: Defeasible logic. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 355–395. Oxford University Press, Oxford (1994)
DeLP Web page, http://lidia.cs.uns.edu.ar/delp
Pollock, J.L.: Knowledge and Representation. Princeton University Press, Princeton (1974)
Pollock, J.L.: Defeasible reasoning. Cognitive Science 11(4), 481–518 (1987)
Toulmin, S.E.: The Uses of Argument. Cambridge University Press, Cambridge (1958)
Verheij, B.: Deflog: On the logical interpretation of prima facie justified assumptions. Journal of Logic and Computation 13(3), 319–346 (2003)
Verheij, B.: Dialectical argumentation with argumentation schemes: An approach to legal logic. Artificial Intelligence and Law 11(2-3), 167–195 (2003)
Verheij, B.: Evaluating arguments based on toulmin’s scheme. Argumentation 19(3), 347–371 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, A., Garcia, A.J., Simari, G.R. (2010). Extending DeLP with Attack and Support for Defeasible Rules. In: Kuri-Morales, A., Simari, G.R. (eds) Advances in Artificial Intelligence – IBERAMIA 2010. IBERAMIA 2010. Lecture Notes in Computer Science(), vol 6433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16952-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-16952-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16951-9
Online ISBN: 978-3-642-16952-6
eBook Packages: Computer ScienceComputer Science (R0)