{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:47:25Z","timestamp":1762102045899,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,4,3]],"date-time":"2017-04-03T00:00:00Z","timestamp":1491177600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,4,3]]},"DOI":"10.1145\/3019612.3019715","type":"proceedings-article","created":{"date-parts":[[2017,5,25]],"date-time":"2017-05-25T16:27:32Z","timestamp":1495729652000},"page":"983-988","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Decidability and complexity of threshold description logics induced by concept similarity measures"],"prefix":"10.1145","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Dresden, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver Fern\u00e1ndez","family":"Gil","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Dresden, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,4,3]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"325","volume-title":"Proc. IJCAI'2003","author":"Baader F.","year":"2003","unstructured":"F. Baader . Terminological cycles in a description logic with existential restrictions . In Proc. IJCAI'2003 , pages 325 -- 330 , 2003 . F. Baader. Terminological cycles in a description logic with existential restrictions. In Proc. IJCAI'2003, pages 325--330, 2003."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24246-0_3"},{"key":"e_1_3_2_1_3_1","volume-title":"eport LTCS-16-07, Chair for Automata Theory","author":"Baader F.","year":"2016","unstructured":"F. Baader and O. Fern\u00e1ndez Gil . Decidability and complexity of threshold description logics induced by concept similarity measures. LTCS- R eport LTCS-16-07, Chair for Automata Theory , Institute for Theoretical Computer Science , TU Dresden, Germany, 2016 . See http:\/\/lat.inf.tu-dresden.de\/research\/reports.html. F. Baader and O. Fern\u00e1ndez Gil. Decidability and complexity of threshold description logics induced by concept similarity measures. LTCS-Report LTCS-16-07, Chair for Automata Theory, Institute for Theoretical Computer Science, TU Dresden, Germany, 2016. See http:\/\/lat.inf.tu-dresden.de\/research\/reports.html."},{"key":"e_1_3_2_1_4_1","first-page":"1096","volume-title":"Proc. ECAI'16","volume":"285","author":"Baader F.","year":"2016","unstructured":"F. Baader and O. Fern\u00e1ndez Gil . Extending the description logic \u03c4\u03b5;L(deg) with acyclic TBoxes . In Proc. ECAI'16 , volume 285 , pages 1096 -- 1104 . IOS Press , 2016 . F. Baader and O. Fern\u00e1ndez Gil. Extending the description logic \u03c4\u03b5;L(deg) with acyclic TBoxes. In Proc. ECAI'16, volume 285, pages 1096--1104. IOS Press, 2016."},{"key":"e_1_3_2_1_5_1","first-page":"96","volume-title":"Proc. IJCAI'99","author":"Baader F.","year":"1999","unstructured":"F. Baader , R. K\u00fcsters , and R. Molitor . Computing least common subsumers in description logics with existential restrictions . In Proc. IJCAI'99 , pages 96 -- 103 , 1999 . F. Baader, R. K\u00fcsters, and R. Molitor. Computing least common subsumers in description logics with existential restrictions. In Proc. IJCAI'99, pages 96--103, 1999."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2006.03.002"},{"key":"e_1_3_2_1_7_1","first-page":"298","volume-title":"Proc. ECAI'04","author":"Brandt S.","year":"2004","unstructured":"S. Brandt . Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else ? In Proc. ECAI'04 , pages 298 -- 302 . IOS Press , 2004 . S. Brandt. Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In Proc. ECAI'04, pages 298--302. IOS Press, 2004."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2015.01.002"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1791543"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33353-8_24"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(91)90078-X"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INCoS.2013.77"}],"event":{"name":"SAC 2017: Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Marrakech Morocco","acronym":"SAC 2017"},"container-title":["Proceedings of the Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3019612.3019715","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3019612.3019715","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:40Z","timestamp":1750215820000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3019612.3019715"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,3]]},"references-count":12,"alternative-id":["10.1145\/3019612.3019715","10.1145\/3019612"],"URL":"https:\/\/doi.org\/10.1145\/3019612.3019715","relation":{},"subject":[],"published":{"date-parts":[[2017,4,3]]},"assertion":[{"value":"2017-04-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}