Inconsistency-tolerant reasoning in datalog ontologies via an argumentative semantics

10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Semantic Web provides an effective infrastructure that allows data to be easily shared and reused across applications. At its core is the description of ontological knowledge using ontological languages which are powerful knowledge representation tools with good decidability and tractability properties; Datalog± is one of these tools.The problem of inconsistency has been acknowledged in both the Semantic Web and Database Theory communities. Here we introduce elements of defeasible argumentative reasoning in Datalog±, consequences to represent statements whose truth can be challenged leading to a better handling of inconsistency in ontological languages.

Cite

CITATION STYLE

APA

Martinez, M. V., Deagustini, C. A. D., Falappa, M. A., & Simari, G. R. (2014). Inconsistency-tolerant reasoning in datalog ontologies via an argumentative semantics. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8864, 15–27. https://doi.org/10.1007/978-3-319-12027-0_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