{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:10:21Z","timestamp":1726042221894},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030290061"},{"type":"electronic","value":"9783030290078"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-29007-8_11","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T19:10:06Z","timestamp":1566414606000},"page":"185-202","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extending Forgetting-Based Abduction Using Nominals"],"prefix":"10.1007","author":[{"given":"Warren","family":"Del-Pinto","sequence":"first","affiliation":[]},{"given":"Renate A.","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/BF01448035","volume":"110","author":"W Ackermann","year":"1935","unstructured":"Ackermann, W.: Untersuchungen \u00fcber das Eliminationsproblem der mathematischen Logik. Math. Ann. 110, 330\u2013413 (1935)","journal-title":"Math. Ann."},{"key":"11_CR2","volume-title":"The Description Logic Handbook","author":"F Baader","year":"2003","unstructured":"Baader, F., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook. Cambridge University Press, Cambridge (2003)"},{"key":"11_CR3","unstructured":"Bienvenu, M.: Complexity of abduction in the $$\\cal{EL}$$ family of lightweight description logics. In: Proceedings of KR 2008, pp. 220\u2013230. AAAI Press (2008)"},{"key":"11_CR4","unstructured":"Calvanese, D., De Giacomo, G., Lenzerini, M.: Reasoning in expressive description logics with fixpoints based on automata on finite trees. In: Proceedings of IJCAI 1999, pp. 84\u201389. AAAI Press (1999)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1613\/jair.3870","volume":"48","author":"D Calvanese","year":"2013","unstructured":"Calvanese, D., Ortiz, M., Simkus, M., Stefanoni, G.: Reasoning about explanations for negative query answers in DL-Lite. J. Artif. Intell. Res. 48, 635\u2013669 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Del-Pinto, W., Schmidt, R.A.: ABox abduction via forgetting in $$\\cal{ALC}$$ . In: Proceedings of AAAI 2019. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33012768"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0004-3702(01)00070-4","volume":"128","author":"P Doherty","year":"2001","unstructured":"Doherty, P., \u0141ukaszewicz, W., Sza\u0142as, A.: Computing strongest necessary and weakest sufficient conditions of first-order formulas. Artif. Intell. 128, 143\u2013159 (2001)","journal-title":"Artif. Intell."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Du, J., Qi, G., Shen, Y., Pan, J.Z.: Towards practical ABox abduction in large OWL DL ontologies. In: Proceedings of AAAI 2011, pp. 1160\u20131165. AAAI Press (2011)","DOI":"10.1609\/aaai.v25i1.8070"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Du, J., Wan, H., Ma, H.: Practical TBox abduction based on justification patterns. In: Proceedings of AAAI 2017, pp. 1100\u20131106. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10683"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/200836.200838","volume":"42","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: The complexity of logic-based abduction. J. ACM 42, 3\u201342 (1995)","journal-title":"J. ACM"},{"key":"11_CR11","unstructured":"Elsenbroich, C., Kutz, O., Sattler, U.: A case for abductive reasoning over ontologies. In: Proceedings of OWL: Experiences and Directions. CEUR Workshop Proceedings, vol. 216. CEUR-WS.org (2006)"},{"key":"11_CR12","first-page":"1","volume-title":"Abductive Reasoning and Learning","author":"Peter A. Flach","year":"2000","unstructured":"Flach, P.A., Kakas, A.C.: On the relation between abduction and inductive learning. In: Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 4, pp. 155\u2013196 (2000)"},{"key":"11_CR13","volume-title":"Second-Order Quantifier Elimination: Foundations","author":"DM Gabbay","year":"2008","unstructured":"Gabbay, D.M., Schmidt, R.A., Sza\u0142as, A.: Second-Order Quantifier Elimination: Foundations. Computational Aspects and Applications. College Publications, London (2008)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.websem.2005.06.005","volume":"3","author":"Y Guo","year":"2005","unstructured":"Guo, Y., Pan, Z., Heflin, J.: LUBM: a benchmark for OWL knowledge base systems. J. Web Semant. 3, 158\u2013182 (2005)","journal-title":"J. Web Semant."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Halland, K., Britz, K.: ABox abduction in $$\\cal{ALC}$$ using a DL tableau. In: Proceedings of SAICSIT 2012, pp. 51\u201358. ACM (2012)","DOI":"10.1145\/2389836.2389843"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0004-3702(93)90015-4","volume":"63","author":"JR Hobbs","year":"1993","unstructured":"Hobbs, J.R., Stickel, M., Martin, P., Edwards, D.: Interpretation as abduction. Artif. Intell. 63, 69\u2013142 (1993)","journal-title":"Artif. Intell."},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10817-010-9168-z","volume":"46","author":"S Klarman","year":"2011","unstructured":"Klarman, S., Endriss, U., Schlobach, S.: ABox abduction in the description logic $$\\cal{ALC}$$ . J. Autom. Reason. 46, 43\u201380 (2011)","journal-title":"J. Autom. Reason."},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0004-3702(92)90073-7","volume":"53","author":"K Konolige","year":"1992","unstructured":"Konolige, K.: Abduction versus closure in causal theories. Artif. Intell. 53, 255\u2013272 (1992)","journal-title":"Artif. Intell."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Koopmann, P., Schmidt, R.A.: Uniform interpolation and forgetting for $$\\cal{ALC}$$ ontologies with ABoxes. In: Proceedings of AAAI 2015, pp. 175\u2013181. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9206"},{"key":"11_CR20","unstructured":"Koopmann, P., Schmidt, R.A.: LETHE: saturation based reasoning for non-standard reasoning tasks. In: Proceedings of ORE 2015. CEUR Workshop Proceedings, vol. 1387, pp. 23\u201330. CEUR-WS.org (2015)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-37996-3_2","volume-title":"Semantic Technology","author":"P Lambrix","year":"2013","unstructured":"Lambrix, P., Dragisic, Z., Ivanova, V.: Get my pizza right: repairing missing is-a relations in $$\\cal{ALC}$$ ontologies. In: Takeda, H., Qu, Y., Mizoguchi, R., Kitamura, Y. (eds.) JIST 2012. LNCS, vol. 7774, pp. 17\u201332. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37996-3_2"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0004-3702(01)00070-4","volume":"128","author":"F Lin","year":"2001","unstructured":"Lin, F.: On strongest necessary and weakest sufficient conditions. Artif. Intell. 128, 143\u2013159 (2001)","journal-title":"Artif. Intell."},{"key":"11_CR23","unstructured":"Ludwig, M., Konev, B.: Practical uniform interpolation and forgetting for ALC TBoxes with applications to logical difference. In: Proceedings of KR 2014, pp. 318\u2013327. AAAI Press (2014)"},{"key":"11_CR24","unstructured":"Lutz, C., Wolter, F.: Foundations for uniform interpolation and forgetting in expressive description logics. In: Proceedings of IJCAI 2011, pp. 989\u2013995. AAAI Press (2011)"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Matentzoglu, N., Parsia, B.: Bioportal snapshot 30.03.2017 [data set] (2017). Zenodo: https:\/\/doi.org\/10.5281\/zenodo.439510","DOI":"10.5281\/zenodo.439510"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-44960-4_8","volume-title":"Inductive Logic Programming","author":"SH Muggleton","year":"2000","unstructured":"Muggleton, S.H., Bryant, C.H.: Theory completion using inverse entailment. In: Cussens, J., Frisch, A. (eds.) ILP 2000. LNCS (LNAI), vol. 1866, pp. 130\u2013146. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44960-4_8"},{"key":"11_CR27","unstructured":"Pukancov\u00e1, J., Homola, M.: Tableau-based ABox abduction for the $$\\cal{ALCHO}$$ description logic. In: Proceedings of DL 2017. CEUR Workshop Proceedings, vol. 1879. CEUR-WS.org (2017)"},{"key":"11_CR28","unstructured":"Raghavan, S., Mooney, R.: Bayesian abductive logic programs. In: AAAI 2010 Workshop on Statistical Relational AI, pp. 82\u201387. AAAI Press (2010)"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.jal.2008.10.007","volume":"7","author":"O Ray","year":"2009","unstructured":"Ray, O.: Nonmonotonic abductive inductive learning. J. Appl. Log. 7, 329\u2013340 (2009)","journal-title":"J. Appl. Log."},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-40885-4_8","volume-title":"Frontiers of Combining Systems","author":"C Wernhard","year":"2013","unstructured":"Wernhard, C.: Abduction in logic programming as second-order quantifier elimination. In: Fontaine, P., Ringeissen, C., Schmidt, R.A. (eds.) FroCoS 2013. LNCS (LNAI), vol. 8152, pp. 103\u2013119. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40885-4_8"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Zhao, Y.: Automated semantic forgetting for expressive description logics. Ph.D. thesis, The University of Manchester, UK (2018)","DOI":"10.1007\/978-3-319-94205-6_2"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-319-25007-6_34","volume-title":"The Semantic Web - ISWC 2015","author":"Y Zhao","year":"2015","unstructured":"Zhao, Y., Schmidt, R.A.: Concept forgetting in $$\\cal{ALCOI}$$ -ontologies using an Ackermann approach. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9366, pp. 587\u2013602. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25007-6_34"},{"key":"11_CR33","unstructured":"Zhao, Y., Schmidt, R.A.: Forgetting concept and role symbols in $$\\cal{ALCOIH}\\mu ^{+}(\\nabla ,\\sqcap )$$ -ontologies. In: Proceedigs of IJCAI 2016, pp. 1345\u20131352. AAAI Press (2016)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29007-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T22:38:21Z","timestamp":1664145501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29007-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290061","9783030290078"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29007-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FroCoS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Frontiers of Combining Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"frocos2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.frocos2019.org\/","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":"30","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":"20","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":"0","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":"67% - 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.1","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","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)"}}]}}