{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:41:06Z","timestamp":1743147666505,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030578541"},{"type":"electronic","value":"9783030578558"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-57855-8_3","type":"book-chapter","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T16:17:52Z","timestamp":1599754672000},"page":"33-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Incremental Algorithm for Computing All Repairs in Inconsistent Knowledge Bases"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Yun","sequence":"first","affiliation":[]},{"given":"Madalina","family":"Croitoru","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,10]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, Pennsylvania, USA, 31 May\u20132 June 1999, pp. 68\u201379 (1999). https:\/\/doi.org\/10.1145\/303976.303983","DOI":"10.1145\/303976.303983"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Arioua, A., Croitoru, M., Buche, P.: DALEK: a tool for dialectical explanations in inconsistent knowledge bases. In: Computational Models of Argument - Proceedings of COMMA 2016, Potsdam, Germany, 12\u201316 September 2016, pp. 461\u2013462 (2016). https:\/\/doi.org\/10.3233\/978-1-61499-686-6-461","DOI":"10.3233\/978-1-61499-686-6-461"},{"key":"3_CR3","unstructured":"Baget, J.F., et al.: A general modifier-based framework for inconsistency-tolerant query answering. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, 25\u201329 April 2016, pp. 513\u2013516 (2016)"},{"key":"3_CR4","unstructured":"Baget, J.F., Gutierrez, A., Lecl\u00e8re, M., Mugnier, M.L., Rocher, S., Sipieter, C.: DLGP: An extended Datalog Syntax for Existential Rules and Datalog$$\\pm $$ Version 2.0, June 2015"},{"issue":"9\u201310","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.artint.2011.03.002","volume":"175","author":"JF Baget","year":"2011","unstructured":"Baget, J.F., Lecl\u00e8re, M., Mugnier, M.L., Salvat, E.: On rules with existential variables: walking the decidability line. Artif. Intell. 175(9\u201310), 1620\u20131654 (2011)","journal-title":"Artif. Intell."},{"key":"3_CR6","unstructured":"Beame, P., Luby, M.: Parallel search for maximal independence given minimal dependence. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, USA, 22\u201324 January 1990, pp. 212\u2013218 (1990)"},{"key":"3_CR7","unstructured":"Benferhat, S., Bouraoui, Z., Croitoru, M., Papini, O., Tabia, K.: Non-objection inference for inconsistency-tolerant query answering. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9\u201315 July 2016, pp. 3684\u20133690 (2016)"},{"key":"3_CR8","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, 22\u201326 July 2012 (2012). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI12\/paper\/view\/4928"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1142\/S0129626400000251","volume":"10","author":"E Boros","year":"2000","unstructured":"Boros, E., Elbassioni, K.M., Gurvich, V., Khachiyan, L.: An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension. Parallel Process. Lett. 10(4), 253\u2013266 (2000)","journal-title":"Parallel Process. Lett."},{"key":"3_CR10","unstructured":"Bourgaux, C.: Inconsistency Handling in Ontology-Mediated Query Answering. Ph.D. thesis, Universit\u00e9 Paris-Saclay, Paris, September 2016. https:\/\/tel.archives-ouvertes.fr\/tel-01378723"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Cal\u00ec, A., Gottlob, G., Lukasiewicz, T., Marnette, B., Pieris, A.: Datalog$$\\pm $$: a family of logical knowledge representation and query languages for new applications. In: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, Edinburgh, United Kingdom, 11\u201314 July 2010, pp. 228\u2013242 (2010). https:\/\/doi.org\/10.1109\/LICS.2010.27","DOI":"10.1109\/LICS.2010.27"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-40381-1_2","volume-title":"Scalable Uncertainty Management","author":"M Croitoru","year":"2013","unstructured":"Croitoru, M., Vesic, S.: What can argumentation do for inconsistent ontology query answering? In: Liu, W., Subrahmanian, V.S., Wijsen, J. (eds.) SUM 2013. LNCS (LNAI), vol. 8078, pp. 15\u201329. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40381-1_2"},{"issue":"6","key":"3_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0020-0190(92)90228-N","volume":"42","author":"E Dahlhaus","year":"1992","unstructured":"Dahlhaus, E., Karpinski, M., Kelsen, P.: An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3. Inf. Process. Lett. 42(6), 309\u2013313 (1992). https:\/\/doi.org\/10.1016\/0020-0190(92)90228-N","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","volume":"42","author":"G Gallo","year":"1993","unstructured":"Gallo, G., Longo, G., Pallottino, S.: Directed hypergraphs and applications. Discrete Appl. Math. 42(2), 177\u2013201 (1993). https:\/\/doi.org\/10.1016\/0166-218X(93)90045-P","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1137\/0218029","volume":"18","author":"MK Goldberg","year":"1989","unstructured":"Goldberg, M.K., Spencer, T.H.: A new parallel algorithm for the maximal independent set problem. SIAM J. Comput. 18(2), 419\u2013427 (1989). https:\/\/doi.org\/10.1137\/0218029","journal-title":"SIAM J. Comput."},{"key":"3_CR16","unstructured":"Gr\u00e9goire, \u00c9., Mazure, B., Piette, C.: Boosting a complete technique to find MSS and MUS thanks to a local search oracle. In: IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, 6\u201312 January 2007, pp. 2300\u20132305 (2007). http:\/\/ijcai.org\/Proceedings\/07\/Papers\/370.pdf"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1016\/j.ejor.2007.06.066","volume":"199","author":"\u00c9 Gr\u00e9goire","year":"2009","unstructured":"Gr\u00e9goire, \u00c9., Mazure, B., Piette, C.: Using local search to find MSSes and MUSes. Eur. J. Oper. Res. 199(3), 640\u2013646 (2009). https:\/\/doi.org\/10.1016\/j.ejor.2007.06.066","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR18","unstructured":"Hecham, A.: Defeasible reasoning for existential rules. (Raisonnement defaisable dans les r\u00e8gles existentielles). Ph.D. thesis (2018). https:\/\/tel.archives-ouvertes.fr\/tel-01904558"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Hecham, A., Bisquert, P., Croitoru, M.: On the chase for all provenance paths with existential rules. In: Proceedings of the Rules and Reasoning - International Joint Conference, RuleML+RR 2017, London, UK, 12\u201315 July 2017, pp. 135\u2013150 (2017)","DOI":"10.1007\/978-3-319-61252-2_10"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Kelsen, P.: On the parallel complexity of computing a maximal independent set in a hypergraph. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, 4\u20136 May 1992, pp. 339\u2013350 (1992). https:\/\/doi.org\/10.1145\/129712.129745","DOI":"10.1145\/129712.129745"},{"key":"3_CR21","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":"3_CR22","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":"3_CR23","unstructured":"Rocher, S.: Interrogation tol\u00e9rante aux incoh\u00e9rences, Technical report. Universit\u00e9 de Montpellier (2013)"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-319-08389-6_27","volume-title":"Graph-Based Representation and Reasoning","author":"N Tamani","year":"2014","unstructured":"Tamani, N., et al.: Eco-efficient packaging material selection for fresh produce: industrial session. In: Hernandez, N., J\u00e4schke, R., Croitoru, M. (eds.) ICCS 2014. LNCS (LNAI), vol. 8577, pp. 305\u2013310. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08389-6_27"},{"key":"3_CR25","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-319-49157-8_10","volume-title":"Metadata and Semantics Research","author":"B Yun","year":"2016","unstructured":"Yun, B., Bisquert, P., Buche, P., Croitoru, M.: Arguing about end-of-life of packagings: preferences to the rescue. In: Garoufallou, E., Subirats Coll, I., Stellato, A., Greenberg, J. (eds.) MTSR 2016. CCIS, vol. 672, pp. 119\u2013131. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49157-8_10"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Yun, B., Vesic, S., Croitoru, M., Bisquert, P.: Inconsistency measures for repair semantics in OBDA. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, 13\u201319 July 2018, pp. 1977\u20131983 (2018). https:\/\/doi.org\/10.24963\/ijcai.2018\/273","DOI":"10.24963\/ijcai.2018\/273"}],"container-title":["Lecture Notes in Computer Science","Ontologies and Concepts in Mind and Machine"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57855-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T04:49:50Z","timestamp":1619239790000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57855-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030578541","9783030578558"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57855-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Conceptual Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bolzano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-conceptstruct2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccs-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"24","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":"10","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":"6","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":"42% - 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.625","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":"2.357","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}