Abstract
Argumentation is a promising approach for reasoning with inconsistent information. Starting from a knowledge base encoded in a logical language, an argumentation system defines arguments and attacks between them using the consequence operator associated with the language. Finally, it uses a semantics for evaluating the arguments. The plausible conclusions to be drawn from the knowledge base are those supported by “good” arguments.
In this paper, we discuss two families of such systems: the family using extension semantics and the one using ranking semantics. We discuss the outcomes of both families and compare them.
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
Amgoud, L., Ben-Naim, J.: Ranking-based semantics for argumentation frameworks. In: Liu, W., Subrahmanian, V.S., Wijsen, J. (eds.) SUM 2013. LNCS (LNAI), vol. 8078, pp. 134–147. Springer, Heidelberg (2013)
Amgoud, L., Besnard, P.: Logical limits of abstract argumentation frameworks. Journal of Applied Non-Classical Logics 23(3), 229–267 (2013)
Baroni, P., Giacomin, M., Guida, G.: Scc-recursiveness: A general schema for argumentation semantics. Artificial Intelligence Journal 168, 162–210 (2005)
Belnap, N.D.: A Useful Four-Valued Logic. In: Dunn, J., Epstein, G. (eds.) Modern Uses of Multiple-Valued Logic, pp. 7–37. Oriel Press (1977)
Cholvy, L.: Automated reasoning with merged contradictory information whose reliability depends on topics. In: Froidevaux, C., Kohlas, J. (eds.) ECSQARU 1995. LNCS, vol. 946, pp. 125–132. Springer, Heidelberg (1995)
D’Ottaviano, I., da Costa, N.: Sur un problème de Jaśkowski. In: Comptes Rendus de l’Académie des Sciences de Paris, vol. 270, pp. 1349–1353 (1970)
Dung, P., Mancarella, P., Toni, F.: Computing ideal skeptical argumentation. Artificial Intelligence Journal 171, 642–674 (2007)
Dung, P.M.: On the Acceptability of Arguments and its Fundamental Role in Non-Monotonic Reasoning, Logic Programming and n-Person Games. AIJ 77, 321–357 (1995)
Kleer, J.D.: Using crude probability estimates to guide diagnosis. Artificial Intelligence 45, 381–391 (1990)
Reiter, R.: A logic for default reasoning. Artificial Intelligence 13(1-2), 81–132 (1980)
Rescher, N., Manor, R.: On inference from inconsistent premises. Journal of Theory and Decision 1, 179–219 (1970)
Tarski, A.: On Some Fundamental Concepts of Metamathematics. In: Woodger, E.H. (ed.) Logic, Semantics, Metamathematics. Oxford Uni. Press (1956)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Ben-Naim, J. (2014). Argumentation-Based Paraconsistent Logics. In: Hernandez, N., Jäschke, R., Croitoru, M. (eds) Graph-Based Representation and Reasoning. ICCS 2014. Lecture Notes in Computer Science(), vol 8577. Springer, Cham. https://doi.org/10.1007/978-3-319-08389-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-08389-6_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08388-9
Online ISBN: 978-3-319-08389-6
eBook Packages: Computer ScienceComputer Science (R0)