Argumentation-based paraconsistent logics

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

You may have access to this PDF.

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. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Ben-Naim, J. (2014). Argumentation-based paraconsistent logics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8577 LNAI, pp. 19–24). Springer Verlag. https://doi.org/10.1007/978-3-319-08389-6_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free