Skip to main content

Defeasible Description Logics

  • Conference paper
Rules and Rule Markup Languages for the Semantic Web (RuleML 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3323))

Abstract

We propose to extend description logic with defeasible rules, and to use the inferential mechanism of defeasible logic to reason with description logic constructors.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Antoniou, G.: Nonmonotonic rule system on top of ontology layer. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 394–398. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: On the modeling and analysis of regulations. In: Proceedings of the Australian Conference Information Systems, pp. 20–29 (1999)

    Google Scholar 

  3. Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: A flexible framework for defeasible logics. In: Proc. American National Conference on Artificial Intelligence (AAAI 2000), Menlo Park, CA, pp. 401–405. AAAI/MIT Press (2000)

    Google Scholar 

  4. Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: Representation results for defeasible logic. ACM Transactions on Computational Logic 2(2), 255–287 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Antoniou, G., Wagner, G.: Rules and defeasible reasoning on the semantic web. In: Schröder, M., Wagner, G. (eds.) RuleML 2003. LNCS, vol. 2876, pp. 111–120. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Baader, F., Hollunder, B.: Embedding defaults into terminological knowledge representation formalism. Journal of Automated Reasoning 14, 149–180 (1995)

    Article  MathSciNet  Google Scholar 

  7. Baader, F., Hollunder, B.: Priorities on defaults with prerequisites and their application in treating specificity in terminological default logic. Journal of Automated Reasoning 14, 41–68 (1995)

    Article  Google Scholar 

  8. Baader, F., Calvanes, D., McGuinnes, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logics Handbook. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  9. Baader, F., Nutt, W.: Basic description logics. In: Baader, et al. (eds.) [8], ch. 2, pp. 43–95

    Google Scholar 

  10. Billington, D.: Defeasible logic is stable. Journal of Logic and Computation 3, 370–400 (1993)

    Article  MathSciNet  Google Scholar 

  11. Covington, M., Nute, D., Vellino, A.: Prolog Programming in Depth. Prentice-Hall, Englewood Cliffs (1997)

    MATH  Google Scholar 

  12. Dumas, M., Governatori, G., ter Hofstede, A.H.M., Oaks, P.: A formal approach to negotiating agents development. Electronic Commerce Research and Applications 1(2), 193–207 (2002)

    Article  Google Scholar 

  13. 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)

    Google Scholar 

  14. Governatori, G., Dumas, M., ter Hofstede, A.H.M., Oaks, P.: A formal approach to protocols and strategies for (legal) negotiation. In: Prakken, H. (ed.) Procedings of the 8th International Conference on Artificial Intelligence and Law. IAAIL, pp. 168–177. ACM Press, New York (2001)

    Chapter  Google Scholar 

  15. Governatori, G., Padmanabhan, V.: A defeasible logic of policy-based intention. In: Gedeon, T.D., Fung, L.C.C. (eds.) AI 2003. LNCS (LNAI), vol. 2903, pp. 414–426. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Governatori, G., Rotolo, A.: A computational framework for nonmonotonic agency, institutionalised power and multi-agent systems. In: Bourcier, D. (ed.) Legal Knowledge and Information Systems. Frontieres in Artificial Intelligence and Applications, vol. 106, pp. 151–152. IOS Press, Amsterdam (2003)

    Google Scholar 

  17. Governatori, G., Rotolo, A.: Defeasible logic: Agency and obligation. In: Lomuscio, A., Nute, D. (eds.) DEON 2004. LNCS (LNAI), vol. 3065, pp. 114–128. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Governatori, G., Rotolo, A., Sadiq, S.: A model of dynamic resource allocation in workflow systems. In: Schewe, K.-D., Williams, H.E. (eds.) Database Technology 2004, January 19-21. Conference Research and Practice of Information Technology, vol. 27, pp. 197–206. Australian Computer Science Association (2004)

    Google Scholar 

  19. Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: combining logic programs with description logic. In: Proceedings of the twelfth international conference on World Wide Web, pp. 48–57. ACM Press, New York (2003)

    Chapter  Google Scholar 

  20. Grosof, B.N., Labrou, Y., Chan, H.Y.: A declarative approach to business rules in contracts: Courteous logic programs in XML. In: Proceedings of the 1st ACM Conference on Electronic Commerce (EC 1999). ACM Press, New York (1999)

    Google Scholar 

  21. Heymans, S., Vermeir, D.: A defeasible ontology language. In: Meersman, R., Tari, Z., et al. (eds.) CoopIS 2002, DOA 2002, and ODBASE 2002. LNCS, vol. 2519, pp. 1033–1046. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  22. Maher, M.J.: Propositional defeasible logic has linear complexity. Theory and Practice of Logic Programming 1(6), 691–711 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  23. Maher, M.J., Rock, A., Antoniou, G., Billignton, D., Miller, T.: Efficient defeasible reasoning systems. International Journal of Artificial Intelligence Tools 10(4), 483–501 (2001)

    Article  Google Scholar 

  24. Nute, D.: Defeasible logic. In: Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 353–395. Oxford University Press, Oxford (1987)

    Google Scholar 

  25. Padgham, L., Zhang, T.: A terminological logic with defaults: A definition and an application. In: Proc. IJCAI 1993. Los Altos, pp. 662–668. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  26. Quantz, J., Royer, V.: A preference semantics for defaults in terminological logics. In: Proc. KR 1992, Los Altos, pp. 294–305. Morgan Kaufmann, San Francisco (1992)

    Google Scholar 

  27. Reeves, D.M., Grosof, B.N., Wellman, M.P., Chan, H.Y.: Towards a declarative language for negotiating executable contracts. In: Proceedings of the AAAI 1999 Workshop on Artificial Intelligence in Electronic Commerce (AIEC 1999), AAAI Press / MIT Press (1999)

    Google Scholar 

  28. Straccia, U.: Default inheritance reasoning in hybrid KL-ONE-style logics. In: Proc. IJCAI 1993, Los Altos, pp. 676–681. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  29. Wang, K., Billington, D., Blee, J., Antoniou, G.: Combining description logic and defeasible logic for the semantic web. In: Antoniou, G., Boley, H. (eds.) RuleML 2004. LNCS, vol. 3323, pp. 170–181. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Governatori, G. (2004). Defeasible Description Logics. 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_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30504-0_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23842-3

  • Online ISBN: 978-3-540-30504-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics