Abstract
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty and fuzzy knowledge at object-language level. Defeasible argumentation in general and P-DeLP in particular provide a way of modelling non-monotonic inference. From a logical viewpoint, capturing defeasible inference relationships for modelling argument and warrant is particularly important, as well as the study of their logical properties. This paper analyzes two non-monotonic operators for P-DeLP which model the expansion of a given program \(\mathcal{P}\) by adding new weighed facts associated with argument conclusions and warranted literals, resp. Different logical properties for the proposed expansion operators are studied and contrasted with a traditional SLD-based Horn logic. We will show that this analysis provides useful comparison criteria that can be extended and applied to other argumentation frameworks.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chesñevar, C.I., Simari, G., Alsinet, T., Godo, L.: A Logic Programming Framework for Possibilistic Argumentation with Vague Knowledge. In: Proc. Intl. Conf. in Uncertainty in Artificial Intelligence (UAI 2004), Banff, Canada, pp. 76–84 (2004)
Alsinet, T., Godo, L.: A complete calculus for possibilistic logic programming with fuzzy propositional variables. In: Proc. of the UAI 2000 Conference, pp. 1–10 (2000)
Alsinet, T., Godo, L.: A proof procedure for possibilistic logic programming with fuzzy constants. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol. 2143, pp. 760–771. Springer, Heidelberg (2001)
Chesñevar, C., Maguitman, A., Simari, G.: A first approach to argument-based recommender systems based on defeasible logic programming. In: Proc. 10th Intl. Workshop on Non-Monotonic Reasoning, Whistler, Canada, pp. 109–117 (2004)
Chesñevar, C., Maguitman, A.: An Argumentative Approach to Assessing Natural Language Usage based on the Web Corpus. In: Proc. of the ECAI-2004 Conference, Valencia, Spain, pp. 581–585 (2004)
Lifschitz, V.: Foundations of logic programming. In: Principles of Knowledge Representation, pp. 69–127. CSLI Publications (1996)
Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Gabbay, D., Hogger, C., Robinson, J. (eds.) Handbook of Logic in Art. Int. and Logic Prog (Nonmonotonic Reasoning and Uncertain Reasoning), pp. 439–513. Oxford Univ. Press, Oxford (1994)
Makinson, D.: General patterns in nonmonotonic reasoning. In: Gabbay, D., Hogger, C., Robinson, J. (eds.) Handbook of Logic in Art. Int. and Logic Prog., vol. Nonmonotonic and Uncertain Reasoning, pp. 35–110. Oxford University Press, Oxford (1994)
Benferhat, S., Dubois, D., Prade, H.: Argumentative inference in uncertain and inconsistent knowledge bases. In: Proc. of UAI, pp. 411–419 (1993)
Benferhat, S., Dubois, D., Prade, H.: Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study. part ii: The prioritized case. In: Orlowska, E. (ed.) Logic at work, vol. 24, pp. 473–511. Physica-Verlag, Heidelberg (1998)
Prakken, H., Vreeswijk, G.: Logical Systems for Defeasible Argumentation. In: Gabbay, D., Guenther, F. (eds.) Handbook of Phil. Logic, pp. 219–318. Kluwer, Dordrecht (2002)
Chesñevar, C., Maguitman, A., Loui, R.: Logical Models of Argument. ACM Computing Surveys 32(4), 337–383 (2000)
Vreeswijk, G.A.: Studies in Defeasible Argumentation. PhD thesis, Vrije University, Amsterdam, Holanda (1993)
Benferhat, S., Dubois, D., Prade, H.: The possibilistic handling of irrelevance in exception-tolerant reasoning. Annals of Math. and AI 35, 29–61 (2002)
Amgoud, L.: A formal framework for handling conflicting desires. In: Proc. of the ECSQARU 2003 Conference, pp. 552–563 (2003)
Amgoud, L., Cayrol, C.: Inferring from inconsistency in preference-based argumentation frameworks. Journal of Automated Reasoning 29, 125–169 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chesñevar, C.I., Simari, G.R., Godo, L., Alsinet, T. (2005). Argument-Based Expansion Operators in Possibilistic Defeasible Logic Programming: Characterization and Logical Properties. In: Godo, L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2005. Lecture Notes in Computer Science(), vol 3571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11518655_31
Download citation
DOI: https://doi.org/10.1007/11518655_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27326-4
Online ISBN: 978-3-540-31888-0
eBook Packages: Computer ScienceComputer Science (R0)