Skip to main content
Springer Nature Link
Log in

Prioritized assertional-based removed sets revision of DL-Lite belief bases

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

In real world applications, information is often provided by multiple sources having different priority levels reflecting for instance their reliability. This paper investigates ”Prioritized Removed Sets Revision” (PRSR) for revising stratified DL-Lite knowledge bases when a new sure piece of information, called the input, is added. The strategy of revision is based on inconsistency minimization and consists in determining smallest subsets of assertions (prioritized removed sets) that should be dropped from the current stratified knowledge base in order to restore consistency and accept the input. We consider different forms of input: A membership assertion, a positive or a negative inclusion axiom. To characterize our revision approach, we first rephrase Hansson’s postulates for belief bases revision within a DL-Lite setting, we then give logical properties of PRSR operators. In some situations, the revision process leads to several possible revised knowledge bases where defining a selection function is required to keep results within DL-Lite fragment. The last part of the paper shows how to use the notion of hitting set in order to compute the PRSR outcome. We also study the complexity of PRSR operators, and show that, in some cases, the computational complexity of the result can be performed in polynomial time.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic of theory change: Partial meet contraction and revision functions. J. Symb. Log. 50(2), 510–530 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res. 36, 1–69 (2009)

    MathSciNet  MATH  Google Scholar 

  3. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P. F.: The Description Logic Handbook: Theory, Implementation and Applications. 2nd. Cambridge University Press, New York (2010)

  4. Baader, F., Hollunder, B.: Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic. J. Autom. Reason. 15 (1), 41–68 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  5. Baader, F., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The description logic handbook: Theory, implementation, and applications. Cambridge University Press (2003)

  6. Benferhat, S., Ben-Naim, J., Papini, O., Würbel, E.: An answer set programming encoding of prioritized removed sets revision: application to gis. Appl. Intell. 32(1), 60–87 (2010)

    Article  MATH  Google Scholar 

  7. Benferhat, S., Bouraoui, Z., Papini, O., Wu̇rbel, E.: Assertional-based prioritized removed sets revision of DL-LiteR knowledge bases. In: Proceeding of ECAI′14, pp. 967–968 (2014)

  8. Benferhat, S., Bouraoui, Z., Papini, O., Würbel, E.: Assertional-based removed sets revision of DL-Lite R knowledge bases. In: Proceedings of ISAIM′14 (2014)

  9. Benferhat, S., Bouraoui, Z., Papini, O., Würbel, E.: A prioritized assertional-based revision for DL-Lite knowledge bases Fermé, E., Leite, J. (eds.) . Proceedings of JELIA′14, volume 8761 of Lecture Notes in Computer Science, pages 442–456. Springer (2014)

  10. Benferhat, S., Bouraoui, Z., Tabia, K.: On the revision of prioritized DL-Lite knowledge bases. In: Straccia, U., Calì, A. (eds.) . Proceedings of SUM′14, volume 8720 of Lecture Notes in Computer Science, pages 22–36. Springer (2014)

  11. Benferhat, S., Bouraoui, Z., Tabia, K.: How to select one preferred assertional-based repair from inconsistent and prioritized DL-Lite knowledge bases?. In: Yang, Q., Wooldridge, M. (eds.) . Proceedings of IJCAI′15, pages 1450–1456. AAAI Press (2015)

  12. Benferhat, S., Cayrol, C., Dubois, D., Lang, J., Prade, H.: Inconsistency management and prioritized syntax-based entailment. In: Bajcsy, R. (ed.) . Proceedings of IJCAI′93, pages 640–647. Morgan Kaufmann (1993)

  13. Benferhat, S., Dubois, D., Lang, J., Prade, H., Saffiotti, A., Smets, P.: A general approach for inconsistency handling and merging information in prioritized knowledge bases. In: Cohn, A.G., Schubert, L.K. (eds.) . Proceedings of KR′98, pages 466–477. Morgan Kaufmann (1998), Shapiro, S.C.

  14. Benferhat, S., Dubois, D., Prade, H.: How to infer from inconsisent beliefs without revising? In Proceedings of IJCAI′95, pages 1449–1457. Morgan Kaufmann (1995)

  15. Benferhat, S., Dubois, D., Prade, H., Williams, M.-A.: A practical approach to revising prioritized knowledge bases. Studia Logica 70(1), 105–130 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  16. Benferhat, S., Dubois, D., Prade, H., Williams, M.-A.: A framework for iterated belief revision using possibilistic counterparts to jeffrey’s rule. Fundamenta Informaticae 99(2), 147–168 (2010)

    MathSciNet  MATH  Google Scholar 

  17. Bienvenu, M.: Inconsistency-tolerant conjunctive query answering for simple ontologies. In: Kazakov, Y., Lembo, D., Wolter, F. (eds.) . Proceedings of DL′12, volume 846 of CEUR Workshop Proceedings. CEUR-WS.org (2012)

  18. Bienvenu, M., Bourgaux, C., Goasdouė, F.: Querying inconsistent description logic knowledge bases under preferred repair semantics. In Proceedings of AAAI′14, 996–1002 (2014)

  19. Bienvenu, M., Rosati, R.: New inconsistency-tolerant semantics for robust ontology-based data access. In: Eiter, T., Glimm, B., Kazakov, Y., Krötzsch, M. (eds.) . Proceedings of DL′13, volume 1014 of CEUR Workshop Proceedings, pages 53–64. CEUR-WS.org (2013)

  20. Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: DL-Lite: Tractable description logics for ontologies. In Proceedings of AAAI′2005, pages 602–607. AAAI Press / The MIT Press (2005)

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

    Article  MathSciNet  MATH  Google Scholar 

  22. Calvanese, D., Kharlamov, E., Nutt, W., Zheleznyakov, D.: Evolution of DL-Lite knowledge bases. In: Patel-Schneider, P.F., Pan, Y., Hitzler, P., Mika, P., Zhang, L., Pan, J.Z., Horrocks, I., Glimm, B. (eds.) . Proceedings of ISWC′10, volume 6496 of LNCS, pages 112–128. Springer (2010)

  23. Eiter, T., Gottlob, G.: On the complexity of propositional knowledge base revision, updates, and counterfactuals. Artif. Intell. 57(2-3), 227–270 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  24. Flouris, G., Huang, Z., Pan, J.Z., Plexousakis, D., Wache, H.: Inconsistencies, negations and changes in ontologies. In: Proceedings of AAAI′06, pages 1295–1300. AAAI Press (2006)

  25. Flouris, G., Plexousakis, D., Antoniou, G.: Generalizing the agm postulates: preliminary results and applications. In: Delgrande, J.P., Schaub, T. (eds.) . Proceedings of NMR′04, 171–179 (2004)

  26. Flouris, G., Plexousakis, D., Antoniou, G.: On applying the agm theory to dls and owl. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) . Proceedings of ISWC′05, volume 3729 of Lecture Notes in Computer Science, pages 216–231. Springer (2005)

  27. Flouris, G., Plexousakis, D., Antoniou, G.: On generalizing the agm postulates (2006)

  28. Fuhrmann, A.: An essay on contraction. CSLI Publications, Stanford. California (1997)

  29. Fuhrmann, A., Hansson, S.O.: A survey of multiple contractions. J. Log. Lang. Inf. 3(1), 39–75 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  30. Gao, S., Qi, G., Wang, H.: A new operator for abox revision in DL-Lite. In: Hoffmann, J., Selman, B. (eds.) . Proceedings of AAAI′12. AAAI Press (2012)

  31. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)

  32. Giacomo, G.D., Lenzerini, M., Poggi, A., Rosati, R.: On the approximation of instance level update and erasure in description logics. In: Proceedings of AAAI′07, pages 403–408. AAAI Press (2007)

  33. Halaschek-wiener, C., Katz, Y., Parsia, B.: Belief base revision for expressive description logics. In: Proceedings of of Workshop on OWL Experiences and Directions (2006)

  34. Hansson, S.O.: A dyadic representation of belief, 89–121 (1992)

  35. Hansson, S.O.: Kernel contraction. J. Symb. Log. 59, 845–859 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  36. Hansson, S.O.: Semi-revision. J. Appl. Non-classical Log. 7, 151–175 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  37. Hansson, S.O.: Revision of belief sets and belief bases. Handb. Defeasible Reason. Uncertainty Manag. Syst. 3, 17–75 (1998)

    MathSciNet  MATH  Google Scholar 

  38. Hansson, S.O.: Specified meet contraction. Erkenntnis 69(1), 31–54 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  39. Hué, J., Würbel, E., Papini, O.: Removed sets fusion: Performing off the shelf. In: Proceedings of ECAI′08, pp. 94–98 (2008)

  40. Ji, Q., Gao, Z., Huang, Z.: Conflict resolution in partially ordered OWL DL ontologies. In: Proceedings of ECAI′2014, pp. 471–476 (2014)

  41. Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artif. Intell. 52, 263–294 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  42. Kharlamov, E., Zheleznyakov, D.: Understanding inexpressibility of model-based abox evolution in DL-Lite. In: Barceló, P., Tannen, V. (eds.) . Proceedings of AMW′11, volume 749 of CEUR Workshop Proceedings. CEUR-WS.org (2011)

  43. Kharlamov, E., Zheleznyakov, D., Calvanese, D.: Capturing model-based ontology evolution at the instance level: The case of DL-Lite. J. Comput. Syst. Sci. 79 (6), 835–872 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  44. Lee, K., Meyer, T.: A classification of ontology modification. In: Webb, G., Yu, X. (eds.) . AI 2004: Advances in Artificial Intelligence, volume 3339 of Lecture Notes in Computer Science, pages 248–258. Springer Berlin Heidelberg, p 2005

  45. Lembo, D., Lenzerini, M., Rosati, R., Ruzzi, M., Savo, D.F.: Inconsistency-tolerant semantics for description logics. In: Hitzler, P., Lukasiewicz, T. (eds.) . Proceedings of RR′10, volume 6333 of LNCS, pages 103–117. Springer (2010)

  46. Makinson, D., Gärdenfors, P.: Relations between the logic of theory change and nonmonotonic logic. In: Fuhrmann, A., Morreau, M. (eds.) . The Logic of Theory Change, volume 465 of Lecture Notes in Computer Science, pages 185–205. Springer (1989)

  47. Nebel, B.: Base revision operations and schemes: Semantics, representation and complexity. In: Proceedings of ECAI′94, pp. 341–345 (1994)

  48. Nonfjall, H., Larsen, H.L.: Detection of potential inconsistencies in knowledge bases. Int. J. Intell. Syst. 7(2), 81–96 (1992)

    Article  MATH  Google Scholar 

  49. Papini, O.: A complete revision function in propositional calculus. In: Proceedings of ECAI′92, pp. 339–343 (1992)

  50. Poggi, A., Lembo, D., Calvanese, D., Giacomo, G.D., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Semant. 10, 133–173 (2008)

    MATH  Google Scholar 

  51. Qi, G., Du, J.: Model-based revision operators for terminologies in description logics. In: Boutilier, C. (ed.) . Proceedings of IJCAI′09, 891–897 (2009)

  52. Qi, G., Haase, P., Huang, Z., Ji, Q., Pan, J.Z., Vȯlker, J.: A kernel revision operator for terminologies - algorithms and evaluation. In: Proceedings of ISWC′08, pp. 419–434 (2008)

  53. Qi, G., Liu, W., Bell, D.A.: Knowledge base revision in description logics. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) . Proceedings of JELIA′06, volume 4160 of LNCS, pages 386–398. Springer (2006)

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  56. Qi, G., Pan, J.Z.: A stratfication-based approach for inconsistency handling in description logics. In: Proceedings of IWOD′07, p 83 (2007)

  57. Qi, G., Wang, Z., Wang, K., Fu, X., Zhuang, Z.: Approximating model-based abox revision in DL-Lite: Theory and practice. In: Bonet, B., Koenig, S. (eds.) . Proceedings of AAAI′15, pages 254–260. AAAI Press (2015)

  58. Qi, G., Yang, F.: A survey of revision approaches in description logics. In: Baader, F., Lutz, C., Motik, B. (eds.) . Proceedings of DL′08, volume 353 of CEUR Workshop Proceedings. CEUR-WS.org (2008)

  59. Reiter, R.: A theory of diagnosis from first principles. Artif. Intell. 32(1), 57–95 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  60. Ribeiro, M.M., Wassermann, R.: Base revision in description logics — preliminary results. In: Proceedings of WOD′07, Innsbruck, Austria (2007)

  61. Wang, Z., Wang, K., Topor, R.W.: A new approach to knowledge base revision in DL-Lite. In: Fox, M., Poole, D. (eds.) . Proceedings of AAAI′10. AAAI Press (2010)

  62. Wilkerson, R.W., Greiner, R., Smith, B.A.: A correction to the algorithm in reiter’s theory of diagnosis. Artif. Intell. 41, 79–88 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  63. Zhuang, Z., Wang, Z., Wang, K., Qi, G.: Contraction and revision over DL-Lite tboxes. In: Proceedings of AAAI′14, pp. 1149–1156 (2014)

Download references

Author information

Authors and Affiliations

  1. Artois University - Nord de France, CRIL CNRS UMR 8188 Artois, 62307, Lens, France

    Salem Benferhat & Zied Bouraoui

  2. Aix-Marseille University, LSIS-CNRS UMR 7296, 13288, Marseille, France

    Odile Papini & Eric Würbel

Authors
  1. Salem Benferhat
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Zied Bouraoui
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Odile Papini
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Eric Würbel
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Zied Bouraoui.

Additional information

This paper is a revised and extended version of the conference papers [7–9].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Benferhat, S., Bouraoui, Z., Papini, O. et al. Prioritized assertional-based removed sets revision of DL-Lite belief bases. Ann Math Artif Intell 79, 45–75 (2017). https://doi.org/10.1007/s10472-015-9494-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-015-9494-2

Keywords

Mathematics Subject Classification (2010)