Abstract
The importance of integrating rules and ontologies for the Semantic Web has been well addressed by many researchers. Defeasible Logic is a simple but efficient nonmonotonic language which can handle both defeasibility and priority. In this paper we propose a novel approach to combining Defeasible Logic with Description Logics by introducing the Description Defeasible Logic (DDL). DDL is similar to Defeasible Logic but it also contains queries to the Description Logic knowledge base. DDL allows nonmonotonic reasoning to be built on top of ontologies, and to a certain degree, allows ontologies to be built on top of nonmonotonic reasoning. We give some basic properties of DDL, one of which shows that DDL is a tractable language provided that the underlying Description Logic is tractable.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: Representation results for defeasible logic. ACM Transactions on Computationl Logic 2(2), 255–287 (2001)
Antoniou, G., Wagner, G.: A rule-based approach to the semantic web (preliminary report). In: Schröder, M., Wagner, G. (eds.) RuleML 2003. LNCS, vol. 2876, pp. 111–120. Springer, Heidelberg (2003)
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.: The Description Logic Handbook. Cambridge University Press, Cambridge (2002)
Cadoli, M., Schaerf, M.: A survey on complexity results for non-monotonic logics. Journal of Logic Programming 17 (1993)
Connolly, D., van Harmelen, F., Horrocks, I., McGuinness, D.L., Patel-Schneider, P.F., Stein, L.A.: Daml+oil (March 2001), W3C Note, reference description, http://www.w3.org/tr2001/notedaml+oil-reference-20011218 (December 18, 2001)
Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Computing Survey 33(3), 374–425 (2001)
Dean, M., Connolly, D., van Harmelen, F., Hendler, J., Horrocks, I., McGuinness, D., Patel- Schneider, P., Stein, L.: Owl web ontology language reference, W3C Working Draft, http://www.w3.org/tr2003/wd-owl-ref-20030331 (March 31, 2003)
Donini, F., Lenzerini, M., Nardi, D., Schaerf, A.: AL-log: Integrating datalog and description logics. Journal of Intelligent Information Systems 10(3), 227–252 (1998)
Eiter, T., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. In: Proceedings of the 9th International Conference on Principles of Knowledge Representation and Reasoning, pp. 141–151 (2004)
Governatori, G.: Defeasible description logic. In: Antoniou, G., Boley, H. (eds.) RuleML 2004. LNCS, vol. 3323, pp. 98–112. Springer, Heidelberg (2004)
Grosof, B., Horrocks, I., Volz, R., Decker, S.: Description logic programs: Combining logic programs with description logics. In: Proceedings of the 12th International World Wide Web Conference, pp. 48–57 (2003)
Heymans, S., Vermeir, D.: Integrating semantic web reasoning and answer set programming. In: Proceedings of ASP 2003, pp. 194–208 (2003)
Levy, A., Rousset, M.: Combining horn logic rules and description logics in carin. Artificial Intelligence 104(1-2), 165–209 (1998)
Maher, M.J.: Propositional defeasible logic has linear complexity. Theory and Practice of Logic Programming 1(6), 691–711 (2001)
Maher, M.J., Rock, A., Antoniou, G., Billington, D., Miller, T.: Efficient defeasible reasoning systems. In: Proceedings of the IEEE Conference on Tools with Artificial Intelligence, pp. 384–392 (2000)
Nute, D.: Defeasible logic. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 353–395. Oxford University Press, Oxford (1994)
Rosati, R.: Towards expressive KR systems integrating datalog and description logics: Preliminary report. In: Proceedings of DL 1999, pp. 160–164 (1999)
Swift, T.: Deduction in ontologies via ASP. In: Proceeding of LPNMR-7. Springer, Heidelberg (2004)
van Belleghem, K., Denecker, M., de Schreye, D.: A strong correspondence between description logics and open logic programming. In: Proceedings of the International Conference on Logic Programming (ICLP 1997), pp. 346–360 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, K., Billington, D., Blee, J., Antoniou, G. (2004). Combining Description Logic and Defeasible Logic for the Semantic Web. In: Antoniou, G., Boley, H. (eds) Rules and Rule Markup Languages for the Semantic Web. RuleML 2004. Lecture Notes in Computer Science, vol 3323. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30504-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-30504-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23842-3
Online ISBN: 978-3-540-30504-0
eBook Packages: Springer Book Archive