{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,17]],"date-time":"2026-10-17T00:42:45Z","timestamp":1792197765384,"version":"4.4.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031436185","type":"print"},{"value":"9783031436192","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43619-2_25","type":"book-chapter","created":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:02:40Z","timestamp":1695481360000},"page":"353-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Tractable Closure-Based Possibilistic Repair for\u00a0Partially Ordered DL-Lite Ontologies"],"prefix":"10.1007","author":[{"given":"Ahmed","family":"Laouar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sihem","family":"Belabbes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Salem","family":"Benferhat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,24]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.2820","volume":"36","author":"A Artale","year":"2009","unstructured":"Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res. (JAIR) 36, 1\u201369 (2009). https:\/\/doi.org\/10.1613\/jair.2820","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"25_CR2","unstructured":"Baget, J., et al.: A general modifier-based framework for inconsistency-tolerant query answering. In: Principles of Knowledge Representation and Reasoning (KR), Cape Town, South Africa, pp. 513\u2013516 (2016)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-319-48758-8_5","volume-title":"Logics in Artificial Intelligence","author":"JF Baget","year":"2016","unstructured":"Baget, J.F., et al.: Inconsistency-tolerant query answering: rationality properties and computational complexity analysis. In: Michael, L., Kakas, A. (eds.) JELIA 2016. LNCS (LNAI), vol. 10021, pp. 64\u201380. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48758-8_5"},{"issue":"3\u20134","key":"25_CR4","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1080\/11663081.2018.1439357","volume":"27","author":"M Banerjee","year":"2017","unstructured":"Banerjee, M., Dubois, D., Godo, L., Prade, H.: On the relation between possibilistic logic and modal logics of belief and knowledge. J. Appl. Non-Classical Logics 27(3\u20134), 206\u2013224 (2017)","journal-title":"J. Appl. Non-Classical Logics"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"3237","DOI":"10.1109\/TFUZZ.2021.3107776","volume":"30","author":"S Belabbes","year":"2021","unstructured":"Belabbes, S., Benferhat, S.: Computing a possibility theory repair for partially preordered inconsistent ontologies. IEEE Trans. Fuzzy Syst. 30, 3237\u20133246 (2021)","journal-title":"IEEE Trans. Fuzzy Syst."},{"issue":"5","key":"25_CR6","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1093\/logcom\/exab024","volume":"31","author":"S Belabbes","year":"2021","unstructured":"Belabbes, S., Benferhat, S., Chomicki, J.: Handling inconsistency in partially preordered ontologies: the Elect method. J. Log. Comput. 31(5), 1356\u20131388 (2021)","journal-title":"J. Log. Comput."},{"key":"25_CR7","unstructured":"Benferhat, S., Bouraoui, Z., Tabia, K.: How to select one preferred assertional-based repair from inconsistent and prioritized DL-Lite knowledge bases? In: International Joint Conference on Artificial Intelligence (IJCAI), Buenos Aires, Argentina, pp. 1450\u20131456 (2015)"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1014606325783","volume":"70","author":"S Benferhat","year":"2002","unstructured":"Benferhat, S., Garcia, L.: Handling locally stratified inconsistent knowledge bases. Stud. Logica. 70(1), 77\u2013104 (2002)","journal-title":"Stud. Logica."},{"key":"25_CR9","unstructured":"Bienvenu, M.: On the complexity of consistent query answering in the presence of simple ontologies. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, Toronto, Ontario, Canada (2012)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-49493-7_5","volume-title":"Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering","author":"M Bienvenu","year":"2017","unstructured":"Bienvenu, M., Bourgaux, C.: Inconsistency-tolerant querying of description logic knowledge bases. In: Pan, J.Z., et al. (eds.) Reasoning Web 2016. LNCS, vol. 9885, pp. 156\u2013202. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-49493-7_5"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Bienvenu, M., Bourgaux, C.: Querying and repairing inconsistent prioritized knowledge bases: complexity analysis and links with abstract argumentation. In: Principles of Knowledge Representation and Reasoning (KR), Virtual Event, pp. 141\u2013151 (2020)","DOI":"10.24963\/kr.2020\/15"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Bienvenu, M., Bourgaux, C., Goasdou\u00e9, F.: Querying inconsistent description logic knowledge bases under preferred repair semantics. In: AAAI, pp. 996\u20131002 (2014)","DOI":"10.1609\/aaai.v28i1.8855"},{"key":"25_CR13","unstructured":"Brewka, G.: Preferred subtheories: an extended logical framework for default reasoning. In: IJCAI, Detroit, USA, pp. 1043\u20131048 (1989)"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Britz, K., Casini, G., Meyer, T., Moodley, K., Sattler, U., Varzinczak, I.: Principles of KLM-style defeasible description logics. ACM Trans. Comput. Log. 22(1), 1:1\u20131:46 (2021)","DOI":"10.1145\/3420258"},{"issue":"3","key":"25_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10817-007-9078-x","volume":"39","author":"D Calvanese","year":"2007","unstructured":"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. Reason. 39(3), 385\u2013429 (2007)","journal-title":"J. Autom. Reason."},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-17746-0_8","volume-title":"The Semantic Web \u2013 ISWC 2010","author":"D Calvanese","year":"2010","unstructured":"Calvanese, D., Kharlamov, E., Nutt, W., Zheleznyakov, D.: Evolution of DL-Lite knowledge bases. In: Patel-Schneider, P.F., et al. (eds.) ISWC 2010. LNCS, vol. 6496, pp. 112\u2013128. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17746-0_8"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1214\/aoms\/1177698950","volume":"38","author":"AP Dempster","year":"1967","unstructured":"Dempster, A.P.: Upper and lower probabilities induced by a multivalued mapping. Ann. Math. Stat. 38, 325\u2013339 (1967)","journal-title":"Ann. Math. Stat."},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Dubois, D., Prade, H.: Possibilistic logic - an overview. Comput. Logic 9, 197\u2013255 (2014)","DOI":"10.1016\/B978-0-444-51624-4.50007-1"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-00461-3_1","volume-title":"Scalable Uncertainty Management","author":"D Dubois","year":"2018","unstructured":"Dubois, D., Prade, H.: A crash course on generalized possibilistic logic. In: Ciucci, D., Pasi, G., Vantaggi, B. (eds.) SUM 2018. LNCS (LNAI), vol. 11142, pp. 3\u201317. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00461-3_1"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.artint.2017.08.001","volume":"252","author":"D Dubois","year":"2017","unstructured":"Dubois, D., Prade, H., Schockaert, S.: Generalized possibilistic logic: foundations and applications to qualitative reasoning about uncertainty. Artif. Intell. J. 252, 139\u2013174 (2017)","journal-title":"Artif. Intell. J."},{"key":"25_CR21","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-030-95070-5_13","volume-title":"Artificial Intelligence Research","author":"L Everett","year":"2022","unstructured":"Everett, L., Morris, E., Meyer, T.: Explanation for\u00a0KLM-style defeasible reasoning. In: Jembere, E., Gerber, A.J., Viriri, S., Pillay, A. (eds.) SACAIR 2021. CCIS, vol. 1551, pp. 192\u2013207. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95070-5_13"},{"key":"25_CR22","volume-title":"Reasoning About Knowledge","author":"R Fagin","year":"2003","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (2003)"},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.ijar.2017.06.014","volume":"88","author":"M Finger","year":"2017","unstructured":"Finger, M., Godo, L., Prade, H., Qi, G.: Advances in weighted logics for artificial intelligence. Int. J. Approximate Reasoning 88, 385\u2013386 (2017)","journal-title":"Int. J. Approximate Reasoning"},{"issue":"1\u20132","key":"25_CR24","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","volume":"44","author":"S Kraus","year":"1990","unstructured":"Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. J. 44(1\u20132), 167\u2013207 (1990)","journal-title":"Artif. Intell. J."},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-15918-3_9","volume-title":"Web Reasoning and Rule Systems","author":"D Lembo","year":"2010","unstructured":"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\u2013117. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15918-3_9"},{"key":"25_CR26","unstructured":"Nebel, B.: Base revision operations and schemes: semantics, representation and complexity. In: European Conference on Artificial Intelligence, pp. 341\u2013345 (1994)"},{"key":"25_CR27","first-page":"133","volume":"10","author":"A Poggi","year":"2008","unstructured":"Poggi, A., Lembo, D., Calvanese, D., Giacomo, G.D., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Semant. 10, 133\u2013173 (2008)","journal-title":"J. Data Semant."},{"key":"25_CR28","doi-asserted-by":"publisher","DOI":"10.1515\/9780691214696","volume-title":"A Mathematical Theory of Evidence","author":"G Shafer","year":"1976","unstructured":"Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (1976)"},{"key":"25_CR29","volume-title":"The Laws of Belief - Ranking Theory and Its Philosophical Applications","author":"W Spohn","year":"2014","unstructured":"Spohn, W.: The Laws of Belief - Ranking Theory and Its Philosophical Applications. Oxford University Press, Oxford (2014)"},{"issue":"1","key":"25_CR30","first-page":"19","volume":"10","author":"L Zhou","year":"2012","unstructured":"Zhou, L., Huang, H., Qi, G., Ma, Y., Huang, Z., Qu, Y.: Paraconsistent query answering over DL-Lite ontologies. Web Intell. Agent Syst. Int. J. 10(1), 19\u201331 (2012)","journal-title":"Web Intell. Agent Syst. Int. J."}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43619-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:07:22Z","timestamp":1695481642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43619-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436185","9783031436192"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43619-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dresden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.jelia.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"111","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}