{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:41:22Z","timestamp":1726044082218},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030310943"},{"type":"electronic","value":"9783030310950"}],"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-31095-0_9","type":"book-chapter","created":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T12:02:53Z","timestamp":1568376173000},"page":"128-143","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient TBox Reasoning with Value Restrictions\u2014Introducing the $$\\mathcal {F\\!L}_{o}{} \\textit{wer}$$ Reasoner"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Michel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anni-Yasmin","family":"Turhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Zarrie\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"key":"9_CR1","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $$\\cal{EL}$$ envelope. In: IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, 2005, pp. 364\u2013369. http:\/\/ijcai.org\/Proceedings\/05\/Papers\/0372.pdf"},{"key":"9_CR2","unstructured":"Baader, F., Fern\u00e1ndez Gil, O., Pensel, M.: Standard and Non-Standard Inferences in the Description Logic $$\\cal{FL}_0$$ using Tree Automata. LTCS-Report 18\u201304, Chair for Automata Theory, Institute for Theoretical Computer Science, TU Dresden, Dresden, Germany (2018). http:\/\/lat.inf.tu-dresden.de\/research\/reports.html"},{"key":"9_CR3","unstructured":"Baader, F., Fern\u00e1ndez Gil, O., Marantidis, P.: Matching in the description logic $$\\cal{FL}_0$$ with respect to general TBoxes. In: LPAR-22, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 2018, EPiC Series in Computing, EasyChair, vol. 57, pp. 76\u201394 (2018). http:\/\/www.easychair.org\/publications\/paper\/XrXz"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Baader, F., Fern\u00e1ndez Gil, O., Pensel, M.: Standard and non-standard inferences in the description logic $$\\cal{FL}_0$$ using tree automata. In: GCAI-2018, 4th Global Conference on Artificial Intelligence, 2018, EPiC Series in Computing, EasyChair, vol. 55, pp. 1\u201314 (2018). http:\/\/www.easychair.org\/publications\/paper\/H6d9","DOI":"10.25368\/2022.240"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-48758-8_4","volume-title":"Logics in Artificial Intelligence","author":"F Baader","year":"2016","unstructured":"Baader, F., Marantidis, P., Okhotin, A.: Approximate unification in the description logic $$\\cal{FL}_0$$ . In: Michael, L., Kakas, A. (eds.) JELIA 2016. LNCS (LNAI), vol. 10021, pp. 49\u201363. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48758-8_4"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Baader, F., Marantidis, P., Pensel, M.: The data complexity of answering instance queries in $$\\cal{FL}_0$$ . In: Companion of the The Web Conference 2018, WWW 2018, ACM, pp. 1603\u20131607 (2018). https:\/\/doi.org\/10.1145\/3184558.3191618","DOI":"10.1145\/3184558.3191618"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1013882326814","volume":"69","author":"F Baader","year":"2001","unstructured":"Baader, F., Sattler, U.: An overview of tableau algorithms for description logics. Studia Logica 69(1), 5\u201340 (2001). https:\/\/doi.org\/10.1023\/A:1013882326814","journal-title":"Studia Logica"},{"key":"9_CR8","unstructured":"Brachman, R.J., Levesque, H.J.: The tractability of subsumption in frame-based description languages. In: Proceedings of the National Conference on Artificial Intelligence, 1984, AAAI Press, pp. 34\u201337 (1984). http:\/\/www.aaai.org\/Library\/AAAI\/1984\/aaai84-036.php"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0004-3702(82)90020-0","volume":"19","author":"Charles L. Forgy","year":"1982","unstructured":"Forgy, C.: Rete: a fast algorithm for the many patterns\/many objects match problem. Artif. Intell. 19(1), 17\u201337 (1982). https:\/\/doi.org\/10.1016\/0004-3702(82)90020-0","journal-title":"Artificial Intelligence"},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.websem.2008.05.001","volume":"6","author":"B Cuenca Grau","year":"2008","unstructured":"Cuenca Grau, B., Horrocks, I., Motik, B., Parsia, B., Patel-Schneider, P.F., Sattler, U.: OWL 2: the next step for OWL. J. Web Semant. 6(4), 309\u2013322 (2008)","journal-title":"J. Web Semant."},{"issue":"1","key":"9_CR11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.3233\/SW-2011-0025","volume":"2","author":"M Horridge","year":"2011","unstructured":"Horridge, M., Bechhofer, S.: The OWL API: a java API for OWL ontologies. Seman. Web 2(1), 11\u201321 (2011)","journal-title":"Seman. Web"},{"key":"9_CR12","unstructured":"Kazakov, Y., de Nivelle, H.: Subsumption of concepts in $$\\cal{FL}_0$$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete. In: Proceedings of the 2003 International Workshop on Description Logics (DL 2003), 2003, CEUR Workshop Proceedings. http:\/\/ceur-ws.org\/Vol-81\/kazakov.pdf"},{"key":"9_CR13","unstructured":"Kr\u00f6tzsch, M., Rudolph, S., Hitzler, P.: Complexity boundaries for Horn description logics. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, AAAI Press, pp. 452\u2013457 (2007). http:\/\/www.aaai.org\/Library\/AAAI\/2007\/aaai07-071.php"},{"key":"9_CR14","unstructured":"Michel, F.: Entwurf und Implementierung eines Systems zur Entscheidung von Subsumption in der Beschreibungslogik $$\\cal{FL}_0$$ . Bachelor\u2019s thesis, TU Dresden (2017). (in German)"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0004-3702(90)90087-G","volume":"43","author":"B Nebel","year":"1990","unstructured":"Nebel, B.: Terminological reasoning is inherently intractable. Artif. Intell. 43(2), 235\u2013249 (1990). https:\/\/doi.org\/10.1016\/0004-3702(90)90087-G","journal-title":"Artif. Intell."},{"issue":"4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s10817-017-9406-8","volume":"59","author":"B Parsia","year":"2017","unstructured":"Parsia, B., Matentzoglu, N., Gon\u00e7alves, R.S., Glimm, B., Steigmiller, A.: The OWL reasoner evaluation (ORE) 2015 competition report. J. Autom. Reason. 59(4), 455\u2013482 (2017)","journal-title":"J. Autom. Reason."},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-35176-1_1","volume-title":"The Semantic Web \u2013 ISWC 2012","author":"A Armas Romero","year":"2012","unstructured":"Armas Romero, A., Cuenca Grau, B., Horrocks, I.: MORe: modular combination of OWL reasoners for ontology classification. In: Cudr\u00e9-Mauroux, P., et al. (eds.) ISWC 2012. LNCS, vol. 7649, pp. 1\u201316. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35176-1_1"},{"key":"9_CR18","unstructured":"Simancik, F., Kazakov, Y., Horrocks, I.: Consequence-based reasoning beyond Horn ontologies. In: IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011, IJCAI\/AAAI, pp. 1093\u20131098 (2011). https:\/\/doi.org\/10.5591\/978-1-57735-516-8\/IJCAI11-187"}],"container-title":["Lecture Notes in Computer Science","Rules and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31095-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T17:10:40Z","timestamp":1664385040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31095-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030310943","9783030310950"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31095-0_9","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":"12 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RuleML+RR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Rules and Reasoning","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rulemlrr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.ruleml-rr.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":"26","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":"5","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":"38% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Authors were able to respond to the reviews.","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)"}}]}}