{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:28:04Z","timestamp":1742984884434,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030974534"},{"type":"electronic","value":"9783030974541"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-97454-1_19","type":"book-chapter","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T20:02:28Z","timestamp":1645646548000},"page":"266-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Simulated Annealing Meta-heuristic for Concept Learning in Description Logics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3855-4485","authenticated-orcid":false,"given":"Patrick","family":"Westphal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7171-169X","authenticated-orcid":false,"given":"Sahar","family":"Vahdati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9108-4278","authenticated-orcid":false,"given":"Jens","family":"Lehmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,24]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2007)","DOI":"10.1017\/CBO9780511711787"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.websem.2016.06.001","volume":"39","author":"L B\u00fchmann","year":"2016","unstructured":"B\u00fchmann, L., Lehmann, J., Westphal, P.: DL-learner - a framework for inductive learning on the semantic web. Web Seman. 39, 15\u201324 (2016)","journal-title":"Web Seman."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Castillo, L.P., Wrobel, S.: A comparative study on methods for reducing myopia of hill-climbing search in multirelational learning. In: ICML 2004. ACM (2004)","DOI":"10.1145\/1015330.1015334"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-540-30475-3_31","volume-title":"The Semantic Web \u2013 ISWC 2004","author":"F Esposito","year":"2004","unstructured":"Esposito, F., Fanizzi, N., Iannone, L., Palmisano, I., Semeraro, G.: Knowledge-intensive induction of terminologies from metadata. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 441\u2013455. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30475-3_31"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Fanizzi, N., d\u2019Amato, C., Esposito, F.: DL-FOIL - concept learning in description logics. In: ILP 2008, pp. 107\u2013121 (2008)","DOI":"10.1007\/978-3-540-85928-4_12"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Fanizzi, N., Ferilli, S., Iannone, L., Palmisano, I., Semeraro, G.: Downward refinement in the $$\\cal{ALN}$$ description logic. In: HIS 2004, pp. 68\u201373. IEEE (2005)","DOI":"10.1109\/ICHIS.2004.39"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-030-21348-0_5","volume-title":"The Semantic Web","author":"N Fanizzi","year":"2019","unstructured":"Fanizzi, N., Rizzo, G., d\u2019Amato, C.: Boosting DL concept learners. In: Hitzler, P., et al. (eds.) ESWC 2019. LNCS, vol. 11503, pp. 68\u201383. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21348-0_5"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-030-03667-6_7","volume-title":"Knowledge Engineering and Knowledge Management","author":"N Fanizzi","year":"2018","unstructured":"Fanizzi, N., Rizzo, G., d\u2019Amato, C., Esposito, F.: DLFoil: class expression learning revisited. In: Faron Zucker, C., Ghidini, C., Napoli, A., Toussaint, Y. (eds.) EKAW 2018. LNCS (LNAI), vol. 11313, pp. 98\u2013113. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03667-6_7"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10489-006-0011-5","volume":"26","author":"L Iannone","year":"2007","unstructured":"Iannone, L., Palmisano, I., Fanizzi, N.: An algorithm based on counterfactuals for concept learning in the semantic web. Appl. Intell. 26(2), 139\u2013159 (2007)","journal-title":"Appl. Intell."},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.websem.2011.01.001","volume":"9","author":"J Lehmann","year":"2011","unstructured":"Lehmann, J., Auer, S., B\u00fchmann, L., Tramp, S.: Class expression learning for ontology engineering. J. Web Semant. 9(1), 71\u201381 (2011)","journal-title":"J. Web Semant."},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-78469-2_17","volume-title":"Inductive Logic Programming","author":"J Lehmann","year":"2008","unstructured":"Lehmann, J., Hitzler, P.: A refinement operator based learning algorithm for the $$\\cal{ALC}$$ description logic. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol. 4894, pp. 147\u2013160. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78469-2_17"},{"issue":"1\u20132","key":"19_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10994-009-5146-2","volume":"78","author":"J Lehmann","year":"2010","unstructured":"Lehmann, J., Hitzler, P.: Concept learning in description logics using refinement operators. Mach. Learn. J. 78(1\u20132), 203\u2013250 (2010)","journal-title":"Mach. Learn. J."},{"key":"19_CR13","unstructured":"Luke, S.: Essentials of Metaheuristics, 2nd edn. Lulu, Abu Dhabi (2013)"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Muggleton, S., Watanabe, H. (eds.): Latest Advances in Inductive Logic Programming. World Scientific, Singapore (2014)","DOI":"10.1142\/p954"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.future.2020.02.071","volume":"180","author":"G Rizzo","year":"2020","unstructured":"Rizzo, G., Fanizzi, N., d\u2019Amato, C.: Class expression induction as concept space exploration: from DL-Foil to DL-Focl. FGCS 180, 256\u2013272 (2020)","journal-title":"FGCS"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-030-03667-6_22","volume-title":"Knowledge Engineering and Knowledge Management","author":"G Rizzo","year":"2018","unstructured":"Rizzo, G., Fanizzi, N., d\u2019Amato, C., Esposito, F.: A framework for tackling myopia in concept learning on the web of data. In: Faron Zucker, C., Ghidini, C., Napoli, A., Toussaint, Y. (eds.) EKAW 2018. LNCS (LNAI), vol. 11313, pp. 338\u2013354. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03667-6_22"},{"issue":"6","key":"19_CR17","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1016\/j.ins.2007.10.015","volume":"178","author":"M Serrurier","year":"2008","unstructured":"Serrurier, M., Prade, H.: Improving inductive logic programming by using simulated annealing. Inf. Sci. 178(6), 1423\u20131441 (2008)","journal-title":"Inf. Sci."},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-32689-9_25","volume-title":"Rules on the Web: Research and Applications","author":"AC Tran","year":"2012","unstructured":"Tran, A.C., Dietrich, J., Guesgen, H.W., Marsland, S.: An approach to parallel class expression learning. In: Bikakis, A., Giurca, A. (eds.) RuleML 2012. LNCS, vol. 7438, pp. 302\u2013316. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32689-9_25"},{"issue":"1","key":"19_CR19","first-page":"2145","volume":"18","author":"AC Tran","year":"2017","unstructured":"Tran, A.C., Dietrich, J., Guesgen, H.W., Marsland, S.: Parallel symmetric class expression learning. J. Mach. Learn. Res. 18(1), 2145\u20132178 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"1\u20133","key":"19_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10994-006-7733-9","volume":"64","author":"F \u017delezn\u00fd","year":"2006","unstructured":"\u017delezn\u00fd, F., Srinivasan, A., Page, C.D.: Randomised restarted search in ILP. Mach. Learn. 64(1\u20133), 183\u2013208 (2006)","journal-title":"Mach. Learn."},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Westphal, P., B\u00fchmann, L., Bin, S., Jabeen, H., Lehmann, J.: SML-bench - a benchmarking framework for structured machine learning. SWJ 10(2), 231\u2013245 (2019)","DOI":"10.3233\/SW-180308"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-97454-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T03:36:06Z","timestamp":1726716966000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-97454-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030974534","9783030974541"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-97454-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ILP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Inductive Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lr2020.iit.demokritos.gr\/","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":"10","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":"16","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":"3","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":"160% - 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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}