{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T03:50:53Z","timestamp":1781927453568,"version":"3.54.5"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031450716","type":"print"},{"value":"9783031450723","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-45072-3_4","type":"book-chapter","created":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T11:01:34Z","timestamp":1697281294000},"page":"54-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Combining Proofs for\u00a0Description Logic and\u00a0Concrete Domain Reasoning"],"prefix":"10.1007","author":[{"given":"Christian","family":"Alrabbaa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Franz","family":"Baader","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Borgwardt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"Koopmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alisa","family":"Kovtunova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,10,15]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Alrabbaa, C., Baader, F., Borgwardt, S., Koopmann, P., Kovtunova, A.: Finding small proofs for description logic entailments: theory and practice. In: LPAR (2020). https:\/\/doi.org\/10.29007\/nhpp","DOI":"10.29007\/nhpp"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Alrabbaa, C., Baader, F., Borgwardt, S., Koopmann, P., Kovtunova, A.: Finding good proofs for description logic entailments using recursive quality measures. In: CADE (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_17","DOI":"10.1007\/978-3-030-79876-5_17"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Alrabbaa, C., Baader, F., Borgwardt, S., Koopmann, P., Kovtunova, A.: Combining proofs for description logic and concrete domain reasoning - RuleML+RR23 - Resources (2023). https:\/\/doi.org\/10.5281\/zenodo.8208780","DOI":"10.5281\/zenodo.8208780"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Alrabbaa, C., Baader, F., Borgwardt, S., Koopmann, P., Kovtunova, A.: Combining proofs for description logic and concrete domain reasoning (technical report) (2023). https:\/\/doi.org\/10.48550\/arXiv.2308.03705","DOI":"10.48550\/arXiv.2308.03705"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Alrabbaa, C., et al.: In the head of the beholder: comparing different proof representations. In: RuleML+RR (2022). https:\/\/doi.org\/10.1007\/978-3-031-21541-4_14","DOI":"10.1007\/978-3-031-21541-4_14"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Alrabbaa, C., Koopmann, P., Turhan, A.: Practical query rewriting for DL-Lite with numerical predicates. In: GCAI (2019). https:\/\/doi.org\/10.29007\/gqll","DOI":"10.29007\/gqll"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Armando, A., Castellini, C., Giunchiglia, E., Maratea, M.: A SAT-based decision procedure for the Boolean combination of difference constraints. In: SAT (2004). https:\/\/doi.org\/10.1007\/11527695_2","DOI":"10.1007\/11527695_2"},{"key":"4_CR8","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $$\\cal{EL} $$ envelope. In: IJCAI (2005). http:\/\/ijcai.org\/Proceedings\/05\/Papers\/0372.pdf"},{"key":"4_CR9","unstructured":"Baader, F., Hanschke, P.: A scheme for integrating concrete domains into concept languages. In: IJCAI (1991). http:\/\/ijcai.org\/Proceedings\/91-1\/Papers\/070.pdf"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic. Cambridge University Press, Cambridge (2017). https:\/\/doi.org\/10.1017\/9781139025355","DOI":"10.1017\/9781139025355"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Baader, F., Rydval, J.: Description logics with concrete domains and general concept inclusions revisited. In: IJCAR (2020). https:\/\/doi.org\/10.1007\/978-3-030-51074-9_24","DOI":"10.1007\/978-3-030-51074-9_24"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10817-022-09626-2","volume":"66","author":"F Baader","year":"2022","unstructured":"Baader, F., Rydval, J.: Using model theory to find decidable and tractable description logics with concrete domains. JAR 66(3), 357\u2013407 (2022). https:\/\/doi.org\/10.1007\/s10817-022-09626-2","journal-title":"JAR"},{"issue":"4","key":"4_CR13","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02251834","volume":"34","author":"JL Barlow","year":"1985","unstructured":"Barlow, J.L., Bareiss, E.H.: Probabilistic error analysis of Gaussian elimination in floating point and logarithmic arithmetic. Computing 34(4), 349\u2013364 (1985). https:\/\/doi.org\/10.1007\/BF02251834","journal-title":"Computing"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0004-3702(00)00070-9","volume":"124","author":"FM Donini","year":"2000","unstructured":"Donini, F.M., Massacci, F.: ExpTime tableaux for $$\\cal{ALC} $$. AIJ 124(1), 87\u2013138 (2000). https:\/\/doi.org\/10.1016\/S0004-3702(00)00070-9","journal-title":"AIJ"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Dutertre, B., de Moura, L.M.: A fast linear-arithmetic solver for DPLL(T). In: CAV (2006). https:\/\/doi.org\/10.1007\/11817963_11","DOI":"10.1007\/11817963_11"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Haarslev, V., M\u00f6ller, R., Wessel, M.: The description logic $$\\cal{ALCNH_{R+}} $$ extended with concrete domains: a practically motivated approach. In: IJCAR (2001). https:\/\/doi.org\/10.1007\/3-540-45744-5_4","DOI":"10.1007\/3-540-45744-5_4"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Horridge, M., Parsia, B., Sattler, U.: Justification oriented proofs in OWL. In: ISWC (2010). https:\/\/doi.org\/10.1007\/978-3-642-17746-0_23","DOI":"10.1007\/978-3-642-17746-0_23"},{"key":"4_CR18","unstructured":"Kazakov, Y., Klinov, P., Stupnikov, A.: Towards reusable explanation services in Protege. In: DL (2017). https:\/\/ceur-ws.org\/Vol-1879\/paper31.pdf"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-013-9296-3","volume":"53","author":"Y Kazakov","year":"2013","unstructured":"Kazakov, Y., Kr\u00f6tzsch, M., Siman\u010d\u00edk, F.: The incredible ELK. J. Autom. Reason. 53(1), 1\u201361 (2013). https:\/\/doi.org\/10.1007\/s10817-013-9296-3","journal-title":"J. Autom. Reason."},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Koopmann, P., Del-Pinto, W., Tourret, S., Schmidt, R.A.: Signature-based abduction for expressive description logics. In: KR (2020). https:\/\/doi.org\/10.24963\/kr.2020\/59","DOI":"10.24963\/kr.2020\/59"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Koopmann, P., Schmidt, R.A.: Uniform interpolation of $$\\cal{ALC} $$-ontologies using fixpoints. In: FroCoS (2013). https:\/\/doi.org\/10.1007\/978-3-642-40885-4_7","DOI":"10.1007\/978-3-642-40885-4_7"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Kroening, D., Strichman, O.: Decision Procedures - An Algorithmic Point of View, 2nd edn. EATCS (2016). https:\/\/doi.org\/10.1007\/978-3-662-50497-0","DOI":"10.1007\/978-3-662-50497-0"},{"key":"4_CR23","unstructured":"Lutz, C.: The complexity of description logics with concrete domains. Ph.D. thesis (2002). https:\/\/nbn-resolving.org\/urn:nbn:de:hbz:82-opus-3032"},{"key":"4_CR24","unstructured":"Lutz, C.: Description logics with concrete domains - a survey. In: Advances in Modal Logic, vol. 4 (2002). http:\/\/www.aiml.net\/volumes\/volume4\/Lutz.ps"},{"issue":"4","key":"4_CR25","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/1024922.1024925","volume":"5","author":"C Lutz","year":"2004","unstructured":"Lutz, C.: NExpTime-complete description logics with concrete domains. ACM TOCL 5(4), 669\u2013705 (2004). https:\/\/doi.org\/10.1145\/1024922.1024925","journal-title":"ACM TOCL"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"M\u00e9ndez, J., Alrabbaa, C., Koopmann, P., Langner, R., Baader, F., Dachselt, R.: Evonne: a visual tool for explaining reasoning with OWL ontologies and supporting interactive debugging. CGF (2023). https:\/\/doi.org\/10.1111\/cgf.14730","DOI":"10.1111\/cgf.14730"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1613\/jair.2811","volume":"36","author":"B Motik","year":"2009","unstructured":"Motik, B., Shearer, R., Horrocks, I.: Hypertableau reasoning for description logics. JAIR 36, 165\u2013228 (2009). https:\/\/doi.org\/10.1613\/jair.2811","journal-title":"JAIR"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"de Moura, L.M., Bj\u00f8rner, N.S.: Z3: an efficient SMT solver. In: TACAS (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"4_CR29","unstructured":"Pan, J.Z., Horrocks, I.: Reasoning in the $$\\cal{SHOQ} (\\rm D_n )$$ description logic. In: DL (2002). https:\/\/ceur-ws.org\/Vol-53\/Pan-Horrocks-shoqdn-2002.ps"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Simancik, F., Kazakov, Y., Horrocks, I.: Consequence-based reasoning beyond Horn ontologies. In: IJCAI (2011). https:\/\/doi.org\/10.5591\/978-1-57735-516-8\/IJCAI11-187","DOI":"10.5591\/978-1-57735-516-8\/IJCAI11-187"},{"key":"4_CR31","unstructured":"Turner, P.R.: Gauss elimination: workhorse of linear algebra (1995). https:\/\/apps.dtic.mil\/sti\/pdfs\/ADA313547.pdf. NAWCADPAX-96-194-TR"}],"container-title":["Lecture Notes in Computer Science","Rules and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45072-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T11:02:39Z","timestamp":1697281359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45072-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031450716","9783031450723"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45072-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 October 2023","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":"Oslo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rulemlrr2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.declarativeai.net\/events\/ruleml-rr","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":"46","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":"13","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":"28% - 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":"4","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":"6 subreviewers were invited by the pc members and provided 7 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)"}}]}}