Abstract
Widely accepted argumentation techniques are adapted to define a non-standard description logic (DL) reasoning machinery. A DL-based argumentation framework is introduced to reason about potentially inconsistent ontologies. Arguments in this framework can handle different DL families like \(\mathcal{ALC}\), \(\mathcal{EL}\), and DL-Lite. Afterwards, we propose an algorithm based on debugging techniques and classical tableau-based \(\mathcal{ALC}\) satisfiability to build arguments, and discuss about the computational cost of reasoning through the proposed machinery.
Partially supported by UNS (PGI 24/ZN18) and CONICET (PIP 112-200801-02798).
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
Baader, F.: Terminological Cycles in a Description Logic with Existential Restrictions. In: IJCAI, pp. 325–330 (2003)
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): Description Logic Handbook: Theory, Implementation and Application. Cambridge University Press, Cambridge (2003)
Baader, F., Peñaloza, R., Suntisrivaraporn, B.: Pinpointing in the Description Logic EL. In: Description Logics (2007)
Besnard, P., Hunter, A.: A Logic-based Theory of Deductive Arguments. Artif. Intell. 128(1-2), 203–235 (2001)
Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite family. JAR 39(3), 385–429 (2007)
Cecchi, L., Fillottrani, P., Simari, G.: On the complexity of DeLP through game semantics. In: NMR, pp. 386–394 (2006)
Dung, P.: On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning and Logic Programming and n-person Games. Artif. Intell. 77, 321–357 (1995)
Flouris, G., Huang, Z., Pan, J., Plexousakis, D., Wache, H.: Inconsistencies, Negations and Changes in Ontologies. In: AAAI, pp. 1295–1300 (2006)
García, A., Simari, G.: Defeasible Logic Programming: An Argumentative Approach. TPLP 4(1-2), 95–138 (2004)
Gómez, S., Chesñevar, C., Simari, G.: Reasoning with Inconsistent Ontologies through Argumentation. Applied Artificial Intelligence 24(1&2), 102–148 (2010)
Meyer, T., Lee, K., Booth, R., Pan, J.Z.: Finding Maximally Satisfiable Terminologies for the Description Logic ALC. In: AAAI (2006)
Schlobach, S., Cornet, R.: Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies. In: IJCAI, pp. 355–362 (2003)
Zhang, X., Zhang, Z., Lin, Z.: An Argumentative Semantics for Paraconsistent Reasoning in Description Logic ALC. In: Description Logics (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moguillansky, M.O., Wassermann, R., Falappa, M.A. (2010). An Argumentation Machinery to Reason over Inconsistent Ontologies. In: Kuri-Morales, A., Simari, G.R. (eds) Advances in Artificial Intelligence – IBERAMIA 2010. IBERAMIA 2010. Lecture Notes in Computer Science(), vol 6433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16952-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-16952-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16951-9
Online ISBN: 978-3-642-16952-6
eBook Packages: Computer ScienceComputer Science (R0)