Skip to main content
SpringerLink
Log in
Book cover

International Conference on Web Reasoning and Rule Systems

RR 2008: Web Reasoning and Rule Systems pp 58–73Cite as

Lexicographical Inference over Inconsistent DL-Based Ontologies

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5341))

Abstract

Logical inconsistency may often occur throughout the development stage of a DL-based ontology. We apply the lexicographic inference to reason over inconsistent DL-based ontologies without repairing them first. We address the problem of checking consequences in a \(\mathcal{SHIQ}\) ontology that are classically inferred from every consistent (or coherent) subontology having the highest lexicographic precedence. We propose a method for compiling a \(\mathcal{SHIQ}\) ontology to a propositional program so that the problem can be solved in polynomial calls to a SAT solver. We prove that this time complexity is worst-case optimal in data complexity. In order to make the method more scalable, we also present partition-based techniques to optimize the calling of SAT solvers.

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  2. Bachmair, L., Ganzinger, H., Lynch, C., Snyder, W.: Basic paramodulation. Information and Computation 121(2), 172–192 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. Benferhat, S., Cayrol, C., Dubois, D., Lang, J., Prade, H.: Inconsistency management and prioritized syntax-based entailment. In: Proc. of IJCAI 1993, pp. 640–647 (1993)

    Google Scholar 

  4. Benferhat, S., Dubois, D., Prade, H.: How to infer from inconsisent beliefs without revising? In: Proc. of IJCAI 1995, pp. 1449–1457 (1995)

    Google Scholar 

  5. Cayrol, C., Lagasquie-Schiex, M.: On the complexity of non-monotonic entailment in syntax-based approaches. In: Proc. of ECAI 1994 Workshop on Algorithms, Complexity and Commonsense Reasoning (1994)

    Google Scholar 

  6. Du, J., Qi, G., Shen, Y.: Lexicographical inference over inconsistent DL-based ontologies. Technical report, Institute of Software, Chinese Academy of Sciences, Beijing, China (May 2008), http://lcs.ios.ac.cn/~jfdu/papers/lexinf-tr.pdf

  7. Du, J., Shen, Y.: Computing minimum cost diagnoses to repair populated DL-based ontologies. In: Proc. of WWW 2008, pp. 565–574 (2008)

    Google Scholar 

  8. Eén, N., Sörensson, N.: Translating pseudo-boolean constraints into SAT. JSAT 2, 1–26 (2006)

    MATH  Google Scholar 

  9. Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM Transactions on Database Systems 22(3), 364–418 (1997)

    Article  Google Scholar 

  10. Fitting, M.: First-order Logic and Automated Theorem Proving, 2nd edn. Springer, New York (1996)

    Book  MATH  Google Scholar 

  11. Haase, P., van Harmelen, F., Huang, Z., Stuckenschmidt, H., Sure, Y.: A framework for handling inconsistency in changing ontologies. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) ISWC 2005. LNCS, vol. 3729, pp. 353–367. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for very expressive description logics. Logic Journal of the IGPL 8(3) (2000)

    Google Scholar 

  13. Huang, Z., van Harmelen, F., ten Teije, A.: Reasoning with inconsistent ontologies. In: Proc. of IJCAI 2005, pp. 454–459 (2005)

    Google Scholar 

  14. Hustadt, U., Motik, B., Sattler, U.: Reasoning in description logics by a reduction to disjunctive datalog. Journal of Automated Reasoning 39(3), 351–384 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kalyanpur, A., Parsia, B., Sirin, E., Grau, B.C.: Repairing unsatisfiable concepts in OWL ontologies. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, pp. 170–184. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Krentel, M.W.: The complexity of optimization problems. Journal of Computer and System Sciences 36(3), 490–509 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  17. Lembo, D., Ruzzi, M.: Consistent query answering over description logic ontologies. In: Marchiori, M., Pan, J.Z., de Sainte Marie, C. (eds.) RR 2007. LNCS, vol. 4524, pp. 194–208. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. Ma, Y., Hitzler, P., Lin, Z.: Algorithms for paraconsistent reasoning with OWL. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, vol. 4519, pp. 399–413. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  19. Meyer, T., Lee, K., Booth, R.: Knowledge integration for description logics. In: Proc. of AAAI 2005, pp. 645–650 (2005)

    Google Scholar 

  20. Motik, B.: Reasoning in Description Logics using Resolution and Deductive Databases. PhD thesis, Univesität karlsruhe, Germany (January 2006)

    Google Scholar 

  21. Nieuwenhuis, R., Rubio, A.: Theorem proving with ordering and equality constrained clauses. Journal of Symbolic Computation 19(4), 321–351 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  22. Odintsov, S.P., Wansing, H.: Inconsistency-tolerant Description Logic: Motivation and Basic Systems. In: Trends in Logic: 50 Years of Studia Logica, pp. 301–335. Kluwer Academic Publishers, Dordrecht (2003)

    Chapter  Google Scholar 

  23. Parsia, B., Sirin, E., Kalyanpur, A.: Debugging OWL ontologies. In: Proc. of WWW 2005, pp. 633–640 (2005)

    Google Scholar 

  24. Patel-Schneider, P.F., Hayes, P., Horrocks, I.: OWL Web Ontology Language Semantics and Abstract Syntax. W3C Recommendation (2004), http://www.w3.org/TR/owl-semantics/

  25. Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. Journal of Symbolic Computation 2(3), 293–304 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  26. Qi, G., Liu, W., Bell, D.: A revision-based approach to handling inconsistency in description logics. Artificial Intelligence Review 26(1-2), 115–128 (2006)

    Article  Google Scholar 

  27. Qi, G., Pan, J.Z., Ji, Q.: Extending description logics with uncertainty reasoning in possibilistic logic. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 828–839. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  28. Schlobach, S.: Diagnosing terminologies. In: Proc. of AAAI 2005, pp. 670–675 (2005)

    Google Scholar 

  29. Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of description logic terminologies. In: Proc. of IJCAI 2003, pp. 355–362 (2003)

    Google Scholar 

  30. Sheini, H.M., Sakallah, K.A.: Pueblo: A hybrid pseudo-boolean SAT solver. JSAT 2, 157–181 (2006)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China

    Jianfeng Du & Yi-Dong Shen

  2. Graduate University of the Chinese Academy of Sciences, Beijing, 100080, China

    Jianfeng Du

  3. AIFB, Universität Karlsruhe, D-76128, Karlsruhe, Germany

    Guilin Qi

Authors
  1. Jianfeng Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guilin Qi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yi-Dong Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, Free University of Bozen-Bolzano, Piazza Domenicani 3, 39100, Bolzano, Italy

    Diego Calvanese

  2. Albert-Ludwigs-Universität Freiburg, Fakultät für Angewandte Wissenschaften, Institut für Informatik, Georges-Köhler-Allee, Gebäude 51, 79110, Freiburg, Germany

    Georg Lausen

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Du, J., Qi, G., Shen, YD. (2008). Lexicographical Inference over Inconsistent DL-Based Ontologies. In: Calvanese, D., Lausen, G. (eds) Web Reasoning and Rule Systems. RR 2008. Lecture Notes in Computer Science, vol 5341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88737-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88737-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88736-2

  • Online ISBN: 978-3-540-88737-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation