Skip to main content
SpringerLink
Log in

Investigating the Mapping between Default Logic and Inconsistency-Tolerant Semantics

  • Conference paper
Artificial Intelligence and Soft Computing (ICAISC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9120))

Included in the following conference series:

Abstract

In this paper we propose a mapping between inconsistent ontological knowledge bases and semi-monotonic, prerequisite-free closed normal default theories. As a proof of concept of the new results obtained by the proposed mapping we introduce an any-time algorithm for query answering that starts off by a small set of facts and incrementally adds to this set.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baader, F., Brandt, S., Lutz, C.: Pushing the el envelope. In: Proc. of IJCAI 2005 (2005)

    Google Scholar 

  2. Bienvenu, M.: On the complexity of consistent query answering in the presence of simple ontologies. In: Proc. of AAAI (2012)

    Google Scholar 

  3. Bienvenu, M., Rosati, R.: Tractable approximations of consistent query answering for robust ontology-based data access. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, pp. 775–781. AAAI Press (2013)

    Google Scholar 

  4. Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. Web Semantics: Science, Services and Agents on the World Wide Web 14, 57–83 (2012)

    Article  Google Scholar 

  5. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The dl-lite family. J. Autom. Reasoning 39(3), 385–429 (2007)

    Article  MATH  Google Scholar 

  6. Cholewiski, P., Marek, V.W., Truszczyski, M., Mikitiuk, A.: Computing with default logic. Artificial Intelligence 112(1-2), 105–146 (1999)

    Article  MathSciNet  Google Scholar 

  7. Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-persons games. Artificial Intelligence 77(2), 321–357 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  8. Engelfriet, J., Treur, J.: An interpretation of default logic in minimal temporal epistemic logic. J. of Logic, Lang. and Inf. 7(3), 369–388 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Gottlob, G.: Translating default logic into standard autoepistemic logic. J. ACM 42(4), 711–740 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Imielinski, T.: Results on translating defaults to circumscription. Artif. Intell. 32(1), 131–146 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  11. Konolige, K.: On the Relation Between Default and Autoepistemic Logic. In: Readings in Nonmonotonic Reasoning, pp. 195–226. Morgan Kaufmann Publishers Inc. (1987)

    Google Scholar 

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

    Chapter  Google Scholar 

  13. Lenzerini, M.: Data integration: A theoretical perspective. In: Proc. of PODS 2002 (2002)

    Google Scholar 

  14. Marek, W., Truszczynski, M.: Stable semantics for logic programs and default theories. In: NACLP, pp. 243–256 (1989)

    Google Scholar 

  15. Mugnier, M.-L.: Ontological query answering with existential rules. In: Rudolph, S., Gutierrez, C. (eds.) RR 2011. LNCS, vol. 6902, pp. 2–23. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  16. Nicolas, P., Saubion, F., Stéphan, I.: Gadel: a genetic algorithm to compute default logic extensions. In: ECAI, pp. 484–490 (2000)

    Google Scholar 

  17. Nicolas, P., Schaub, T.: The xray system: An implementation platform for local query-answering in default logics. In: Hunter, A., Parsons, S. (eds.) Applications of Uncertainty Formalisms. LNCS (LNAI), vol. 1455, pp. 354–378. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  18. Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. In: Spaccapietra, S. (ed.) Journal on Data Semantics X. LNCS, vol. 4900, pp. 133–173. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Reiter, R.: A logic for default reasoning. Artificial Intelligence 13 (1980)

    Google Scholar 

  20. Schaub, T., Brüning, S.: Prolog technology for default reasoning: proof theory and compilation techniques. Artificial Intelligence 106(1), 1–75 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  21. Schaub, T., Nicolas, P.: An implementation platform for query-answering in default logics: The xray system, its implementation and evaluation. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 441–452. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  22. Truszczynski, M.: The modal logic s4f, the default logic, and the logic here-and-there. In: AAAI, pp. 508–514. AAAI Press (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Montpellier, Montpellier, France

    Abdallah Arioua, Madalina Croitoru & Jérôme Fortin

  2. IATE, INRA, Montpellier, France

    Abdallah Arioua & Patrice Buche

  3. INRIA Sophia Antipolis, Valbonne, France

    Nouredine Tamani

Authors
  1. Abdallah Arioua
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nouredine Tamani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Madalina Croitoru
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jérôme Fortin
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Patrice Buche
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Czestochowa University of Technology, Czestochowa, Poland

    Leszek Rutkowski

  2. Czestochowa University of Technology, Czestochowa, Poland

    Marcin Korytkowski

  3. Czestochova Univ of Technology, Częstochova, Poland

    Rafal Scherer

  4. AGH University of Science and Technology, Krakow, Poland

    Ryszard Tadeusiewicz

  5. University of California, Berkeley, California, USA

    Lotfi A. Zadeh

  6. Louisville, Kentucky, USA

    Jacek M. Zurada

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Arioua, A., Tamani, N., Croitoru, M., Fortin, J., Buche, P. (2015). Investigating the Mapping between Default Logic and Inconsistency-Tolerant Semantics. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2015. Lecture Notes in Computer Science(), vol 9120. Springer, Cham. https://doi.org/10.1007/978-3-319-19369-4_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19369-4_49

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19368-7

  • Online ISBN: 978-3-319-19369-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation