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\(^{\pm }\) 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\(^{\pm }\), consequences to represent statements whose truth can be challenged leading to a better handling of inconsistency in ontological languages.
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
Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proc. of PODS, pp. 68–79 (1999)
Baroni, P., Caminada, M., Giacomin, M.: An introduction to argumentation semantics. Knowledge Eng. Review 26(4), 365–410 (2011)
Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. In: Even, S., Kariv, O. (eds.) Automata, Languages and Programming. LNCS, vol. 115, pp. 73–85. Springer, Heidelberg (1981)
Besnard, P., Hunter, A.: Elements of Argumentation. MIT Press (2008)
Besnard, P., Hunter, A.: A logic-based theory of deductive arguments. Artif. Intell. 128(1–2), 203–235 (2001)
Bienvenu, M.: On the complexity of consistent query answering in the presence of simple ontologies. In: Proc. of AAAI (2012)
Bienvenu, M., Rosati, R.: Tractable approximations of consistent query answering for robust ontology-based data access. In: Proc. of IJCAI (2013)
Calì, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: Proc. of KR, pp. 70–80 (2008)
Calì, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. J. Web Sem. 14, 57–83 (2012)
Caminada, M., Amgoud, L.: On the evaluation of argumentation formalisms. Artif. Intell. 171(5–6), 286–310 (2007)
Croitoru, M., Vesic, S.: What Can Argumentation Do for Inconsistent Ontology Query Answering? In: Liu, W., Subrahmanian, V.S., Wijsen, J. (eds.) SUM 2013. LNCS, vol. 8078, pp. 15–29. Springer, Heidelberg (2013)
Deagustini, C.A.D., Dalibón, S.E.F., Gottifredi, S., Falappa, M.A., Chesñevar, C.I., Simari, G.R.: Relational databases as a massive information source for defeasible argumentation. Knowl. Based Syst. 51, 93–109 (2013)
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games. Artif. Intell. 77, 321–357 (1995)
Dunne, P., Wooldridge, M.: Complexity of Abstract Argumentation. In: Argumentation in Artificial Intelligence, pp. 85–104. Springer (2009)
García, A.J., Simari, G.R.: Defeasible logic programming: An argumentative approach. TPLP 4(1–2), 95–138 (2004)
García, A.J., Simari, G.R.: Defeasible logic programming: Delp-servers, contextual queries, and explanations for answers. Argument & Computation 5(1), 63–88 (2014)
Gómez, S.A., Chesñevar, C.I., Simari, G.R.: Ontoarg: A decision support framework for ontology integration based on argumentation. Expert Syst. Appl. 40(5), 1858–1870 (2013)
Huang, Z., van Harmelen, F., ten Teije, A.: Reasoning with inconsistent ontologies. In: Proc. of IJCAI, pp. 354–359 (2005)
Lembo, D., Lenzerini, M., Rosati, R., Ruzzi, M., Savo, D.F.: Inconsistency-tolerant semantics for description logics. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 103–117. Springer, Heidelberg (2010)
Lukasiewicz, T., Martinez, M.V., Simari, G.I.: Inconsistency handling in Datalog+/- ontologies. In: Proc. of ECAI, pp. 558–563 (2012)
Ma, Y., Hitzler, P.: Paraconsistent Reasoning for OWL 2. In: Polleres, A., Swift, T. (eds.) RR 2009. LNCS, vol. 5837, pp. 197–211. Springer, Heidelberg (2009)
Martinez, M.V., García, A.J., Simari, G.R.: On the use of presumptions in structured defeasible reasoning. In: Proc. of COMMA, pp. 185–196 (2012)
Prakken, H., Sartor, G.: Argument-based extended logic programming with defeasible priorities. J. Appl. Non-Classical Logics 7(1) (1997)
Qi, G., Du, J.: Model-based revision operators for terminologies in description logics. In: Proc. of IJCAI, pp. 891–897 (2009)
Rahwan, I., Simari, G.R.: Argumentation in Artificial Intelligence. Springer (2009)
Reiter, R.: A logic for default reasoning. Artif. Intel. 13(1–2), 81–132 (1980)
Simari, G.R., Loui, R.P.: A mathematical treatment of defeasible reasoning and its implementation. Artif. Intell. 53(2–3), 125–157 (1992)
Stolzenburg, F., García, A.J., Chesñevar, C.I., Simari, G.R.: Computing generalized specificity. J. of Applied Non-Classical Logics 13(1), 87–113 (2003)
Zhang, X., Lin, Z.: An argumentation framework for description logic ontology reasoning and management. J. Intell. Inf. Syst. 40(3), 375–403 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Martinez, M.V., Deagustini, C.A.D., Falappa, M.A., Simari, G.R. (2014). Inconsistency-Tolerant Reasoning in Datalog\(^{\pm }\) Ontologies via an Argumentative Semantics. In: Bazzan, A., Pichara, K. (eds) Advances in Artificial Intelligence -- IBERAMIA 2014. IBERAMIA 2014. Lecture Notes in Computer Science(), vol 8864. Springer, Cham. https://doi.org/10.1007/978-3-319-12027-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-12027-0_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12026-3
Online ISBN: 978-3-319-12027-0
eBook Packages: Computer ScienceComputer Science (R0)