Abstract
DL-Lite is a powerful and tractable family of description logics specifically tailored for applications that use huge volumes of data. In many real world applications, data are often provided by several and potentially conflicting sources of information having different levels of priority. Possibility theory offers a very natural framework to deal with ordinal and qualitative uncertain beliefs or prioritized preferences. Thus, to encode prioritized assertional facts, a possibility DL-Lite logic is more suited.
We propose in this paper a min-based assertional merging operator for possibilistic DL-Lite knowledge bases. We investigate in particular the situation where the sources share the same terminological base. We present a syntactic method based on conflict resolution which has a meaningful semantic counterpart when merging possibility distributions. We finally provide an analysis in the light of a new set of postulates dedicated to uncertain DL-Lite merging.
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
Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The dl-lite family and relations. J. Artif. Intell. Res. (JAIR) (2009)
Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook: Theory, Implementation and Applications, 2nd edn. Cambridge University Press, New York (2010)
Benferhat, S., Bouraoui, Z.: Possibilistic dl-lite. In: Liu, W., Subrahmanian, V.S., Wijsen, J. (eds.) SUM 2013. LNCS, vol. 8078, pp. 346–359. Springer, Heidelberg (2013)
Benferhat, S., Bouraoui, Z., Loukil, Z.: Min-based fusion of possibilistic dl-lite knowledge bases. In: Web Intelligence, pp. 23–28. IEEE Computer Society (2013)
Benferhat, S., Dubois, D., Prade, H.: Argumentative inference in uncertain and inconsistent knowledge bases. In: Heckerman, D., Mamdani, E.H. (eds.) UAI, pp. 411–419. Morgan Kaufmann (1993)
Benferhat, S., Dubois, D., Prade, H.: Syntactic combination of uncertain information: A possibilistic approach. In: Gabbay, D.M., Kruse, R., Nonnengart, A., Ohlbach, H.J. (eds.) ECSQARU-FAPR 1997. LNCS, vol. 1244, pp. 30–42. Springer, Heidelberg (1997)
Benferhat, S., Kaci, S.: Fusion of possibilistic knowledge bases from a postulate point of view. Int. J. Approx. Reasoning 33(3), 255–285 (2003)
Bloch, I., Hunter, A., Appriou, A., Ayoun, A., Benferhat, S., Besnard, P., Cholvy, L., Cooke, R.M., Cuppens, F., Dubois, D., Fargier, H., Grabisch, M., Kruse, R., Lang, J., Moral, S., Prade, H., Saffiotti, A., Smets, P., Sossai, C.: Fusion: General concepts and characteristics. Int. J. Intell. Syst. 16(10), 1107–1134 (2001)
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. Reasoning 39(3), 385–429 (2007)
Dubois, D., Lang, J., Prade, H.: Dealing with multi-source information in possibilistic logic. In: ECAI, pp. 38–42 (1992)
Dubois, D., Prade, H.: Possibility theory. Plenum Press, New-York (1988)
Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artificial Intelligence 52(3), 263–294 (1991)
Knuth, D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol. 2, pp. 694–695. Addison Wesley (1998)
Konieczny, S., Pérez, R.P.: Merging information under constraints: A logical framework. J. Log. Comput. 12(5), 773–808 (2002)
Konieczny, S., Pino Pérez, R.: Merging information under constraints: a logical framework. Journal of Logic and Computation 12(5) (2002)
Poggi, A., Lembo, D., Calvanese, D., Giacomo, G.D., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Semantics 10, 133–173 (2008)
Qi, G., Ji, Q., Pan, J.Z., Du. Extending, J.: description logics with uncertainty reasoning in possibilistic logic. Int. J. Intell. Syst. 26(4), 353–381 (2011)
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.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 386–398. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Benferhat, S., Bouraoui, Z., Lagrue, S., Rossit, J. (2014). Min-based Assertional Merging Approach for Prioritized DL-Lite Knowledge Bases. In: Straccia, U., Calì, A. (eds) Scalable Uncertainty Management. SUM 2014. Lecture Notes in Computer Science(), vol 8720. Springer, Cham. https://doi.org/10.1007/978-3-319-11508-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-11508-5_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11507-8
Online ISBN: 978-3-319-11508-5
eBook Packages: Computer ScienceComputer Science (R0)