{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:12:05Z","timestamp":1743016325295,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031435126"},{"type":"electronic","value":"9783031435133"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T00:00:00Z","timestamp":1694649600000},"content-version":"vor","delay-in-days":256,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We show that tableau methods for satisfiability in non-classical logics can be supported naturally in SMT solving via the framework of user-propagators. By way of demonstration, we implement the description logic <jats:inline-formula><jats:tex-math>$$\\mathcal {ALC}$$<\/jats:tex-math><\/jats:inline-formula> in the Z3 SMT solver and show that working with user-propagators allows us to significantly outperform encodings to first-order logic with relatively little effort. We promote user-propagators for creating solvers for non-classical logics based on tableau calculi.<\/jats:p>","DOI":"10.1007\/978-3-031-43513-3_2","type":"book-chapter","created":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T14:02:36Z","timestamp":1694613756000},"page":"24-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-Classical Logics in\u00a0Satisfiability Modulo Theories"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0339-1580","authenticated-orcid":false,"given":"Clemens","family":"Eisenhofer","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0331-2451","authenticated-orcid":false,"given":"Ruba","family":"Alassaf","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7834-1567","authenticated-orcid":false,"given":"Michael","family":"Rawson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8299-2714","authenticated-orcid":false,"given":"Laura","family":"Kov\u00e1cs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,14]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Areces, C., Fontaine, P., Merz, S.: Modal satisfiability via SMT solving. In: Software, Services, and Systems, pp. 30\u201345 (2015). https:\/\/doi.org\/10.1007\/978-3-319-15545-6_5","DOI":"10.1007\/978-3-319-15545-6_5"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic (2017)","DOI":"10.1017\/9781139025355"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Bansal, K., Barrett, C.W., Reynolds, A., Tinelli, C.: Reasoning with finite sets and cardinality constraints in SMT. Log. Methods Comput. Sci. 14(4), 1\u201331 (2018). https:\/\/doi.org\/10.23638\/LMCS-14(4:12)2018","DOI":"10.23638\/LMCS-14(4:12)2018"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-99524-9_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H Barbosa","year":"2022","unstructured":"Barbosa, H., et al.: cvc5: a versatile and industrial-strength SMT solver. In: TACAS 2022. LNCS, vol. 13243, pp. 415\u2013442. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_24"},{"key":"2_CR5","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2016). http:\/\/SMT-LIB.org"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability, 2nd edn., vol. 336, pp. 1267\u20131329 (2021)","DOI":"10.3233\/FAIA201017"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability, 2nd edn., pp. 1267\u20131329 (2021). https:\/\/doi.org\/10.3233\/FAIA201017","DOI":"10.3233\/FAIA201017"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Bj\u00f8rner, N.S., Eisenhofer, C., Kov\u00e1cs, L.: Satisfiability modulo custom theories in Z3. In: VMCAI, pp. 91\u2013105 (2023). https:\/\/doi.org\/10.1007\/978-3-031-24950-1_5","DOI":"10.1007\/978-3-031-24950-1_5"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Blackburn, P., van Benthem, J.: Modal logic: a semantic perspective. In: Handbook of Modal Logic, pp. 1\u201384 (2007). https:\/\/doi.org\/10.1016\/s1570-2464(07)80004-8","DOI":"10.1016\/s1570-2464(07)80004-8"},{"key":"2_CR10","unstructured":"Bury, G., Cruanes, S., Delahaye, D.: SMT solving modulo tableau and rewriting theories. In: SMT (2018)"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Caridroit, T., Lagniez, J., Berre, D.L., de Lima, T., Montmirail, V.: A sat-based approach for solving the modal logic s5-satisfiability problem. In: AAAI, pp. 3864\u20133870 (2017). https:\/\/doi.org\/10.1609\/aaai.v31i1.11128","DOI":"10.1609\/aaai.v31i1.11128"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Claessen, K., Ros\u00e9n, D.: SAT modulo intuitionistic implications. In: LPAR, pp. 622\u2013637 (2015). https:\/\/doi.org\/10.1007\/978-3-662-48899-7_43","DOI":"10.1007\/978-3-662-48899-7_43"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"D\u2019Agostino, M., Gabbay, D.M., H\u00e4hnle, R., Posegga, J.: Handbook of tableau methods (2013). https:\/\/doi.org\/10.1007\/978-94-017-1754-0","DOI":"10.1007\/978-94-017-1754-0"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Dutertre, B.: Yices 2.2. In: CAV, pp. 737\u2013744 (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_49","DOI":"10.1007\/978-3-319-08867-9_49"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Fiorentini, C., Gor\u00e9, R., Graham-Lengrand, S.: A proof-theoretic perspective on smt-solving for intuitionistic propositional logic. In: TABLEAUX, pp. 111\u2013129 (2019). https:\/\/doi.org\/10.1007\/978-3-030-29026-9_7","DOI":"10.1007\/978-3-030-29026-9_7"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1305\/ndjfl\/1093894722","volume":"13","author":"M Fitting","year":"1972","unstructured":"Fitting, M.: Tableau methods of proof for modal logics. Notre Dame J. Formal Log. 13(2), 237\u2013247 (1972). https:\/\/doi.org\/10.1305\/ndjfl\/1093894722","journal-title":"Notre Dame J. Formal Log."},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Ge, Y., de Moura, L.M.: Complete instantiation for quantified formulas in satisfiability modulo theories. In: CAV, pp. 306\u2013320 (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_25","DOI":"10.1007\/978-3-642-02658-4_25"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Glei\u00dfner, T., Steen, A.: The MET: the art of flexible reasoning with modalities. In: RuleML+RR, pp. 274\u2013284 (2018). https:\/\/doi.org\/10.1007\/978-3-319-99906-7_19","DOI":"10.1007\/978-3-319-99906-7_19"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Glei\u00dfner, T., Steen, A., Benzm\u00fcller, C.: Theorem provers for every normal modal logic. In: LPAR, pp. 14\u201330 (2017). https:\/\/doi.org\/10.29007\/jsb9","DOI":"10.29007\/jsb9"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Gor\u00e9, R., Kikkert, C.: CEGAR-Tableaux: improved modal satisfiability via modal clause-learning and SAT. In: TABLEAUX, pp. 74\u201391. https:\/\/doi.org\/10.1007\/978-3-030-86059-2_5","DOI":"10.1007\/978-3-030-86059-2_5"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Gor\u00e9, R., Nguyen, L.A.: Analytic cut-free tableaux for regular modal logics of agent beliefs. In: CLIMA, pp. 268\u2013287 (2007). https:\/\/doi.org\/10.1007\/978-3-540-88833-8_15","DOI":"10.1007\/978-3-540-88833-8_15"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Gor\u00e9, R., Olesen, K., Thomson, J.: Implementing tableau calculi using BDDs: BDDTab system description. In: IJCAR, pp. 337\u2013343 (2014). https:\/\/doi.org\/10.1007\/978-3-319-08587-6_25","DOI":"10.1007\/978-3-319-08587-6_25"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Haarslev, V., Sebastiani, R., Vescovi, M.: Automated reasoning in $$\\cal{ALCQ} $$ via SMT. In: CADE, pp. 283\u2013298 (2011). https:\/\/doi.org\/10.1007\/978-3-642-22438-6_22","DOI":"10.1007\/978-3-642-22438-6_22"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for expressive description logics. In: LPAR, pp. 161\u2013180 (1999). https:\/\/doi.org\/10.1007\/3-540-48242-3_11","DOI":"10.1007\/3-540-48242-3_11"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Horrocks, I., Voronkov, A.: Reasoning support for expressive ontology languages using a theorem prover. In: FoIKS, pp. 201\u2013218 (2006). https:\/\/doi.org\/10.1007\/11663881_12","DOI":"10.1007\/11663881_12"},{"issue":"3","key":"2_CR26","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/s10703-016-0247-6","volume":"48","author":"T Liang","year":"2016","unstructured":"Liang, T., Reynolds, A., Tsiskaridze, N., Tinelli, C., Barrett, C., Deters, M.: An efficient SMT solver for string constraints. Formal Methods Syst. Des. 48(3), 206\u2013234 (2016). https:\/\/doi.org\/10.1007\/s10703-016-0247-6","journal-title":"Formal Methods Syst. Des."},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT Solvers. In: Handbook of Satisfiability, 2nd edn., vol. 336, pp. 133\u2013182 (2021)","DOI":"10.3233\/FAIA200987"},{"key":"2_CR28","unstructured":"de Moura, L., Bj\u00f8rner, N.: Relevancy Propagation. Technical Report MSR-TR-2007-140, Microsoft Research, Technical Report (2007), https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/02\/tr-2007-140.pdf"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"de Moura, L.M., Bj\u00f8rner, N.S.: Z3: an efficient SMT solver. In: TACAS, pp. 337\u2013340 (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Nalon, C., Hustadt, U., Papacchini, F., Dixon, C.: Local reductions for the modal cube. In: IJCAR, pp. 486\u2013505 (2022). https:\/\/doi.org\/10.1007\/978-3-031-10769-6_29","DOI":"10.1007\/978-3-031-10769-6_29"},{"issue":"4","key":"2_CR31","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1276920.1276921","volume":"8","author":"RA Schmidt","year":"2007","unstructured":"Schmidt, R.A., Hustadt, U.: The axiomatic translation principle for modal logic. ACM Trans. Comput. Log. 8(4), 19 (2007). https:\/\/doi.org\/10.1145\/1276920.1276921","journal-title":"ACM Trans. Comput. Log."},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Schneider, M., Sutcliffe, G.: Reasoning in the OWL 2 full ontology language using first-order automated theorem proving. In: CADE, pp. 461\u2013475 (2011). https:\/\/doi.org\/10.1007\/978-3-642-22438-6_35","DOI":"10.1007\/978-3-642-22438-6_35"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Sebastiani, R.: From KSAT to delayed theory combination: exploiting DPLL outside the SAT domain. In: FroCoS, pp. 28\u201346 (2007). https:\/\/doi.org\/10.1007\/978-3-540-74621-8_2","DOI":"10.1007\/978-3-540-74621-8_2"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Smullyan, R.M.: First-order logic (1995). https:\/\/doi.org\/10.1007\/978-3-642-86718-7","DOI":"10.1007\/978-3-642-86718-7"},{"key":"2_CR35","unstructured":"Steen, A.: An extensible logic embedding tool for lightweight non-classical reasoning (short paper). In: PAAR (2022)"},{"key":"2_CR36","unstructured":"Steen, A., Fuenmayor, D., Glei\u00dfner, T., Sutcliffe, G., Benzm\u00fcller, C.: Automated reasoning in non-classical logics in the TPTP world. In: PAAR (2022)"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Tishkovsky, D., Schmidt, R.A., Khodadadi, M.: MetTeL$${}^{\\text{2}}$$: towards a tableau prover generation platform. In: PAAR, pp. 149\u2013162 (2012). https:\/\/doi.org\/10.29007\/1c73","DOI":"10.29007\/1c73"},{"key":"2_CR38","doi-asserted-by":"publisher","unstructured":"Tishkovsky, D., Schmidt, R.A., Khodadadi, M.: The tableau prover generator MetTeL2. In: JELIA, pp. 492\u2013495 (2012). https:\/\/doi.org\/10.1007\/978-3-642-33353-8_41","DOI":"10.1007\/978-3-642-33353-8_41"},{"key":"2_CR39","unstructured":"Tsarkov, D., Horrocks, I.: DL reasoner vs. first-order prover. In: DL (2003)"},{"key":"2_CR40","doi-asserted-by":"publisher","unstructured":"Tsarkov, D., Riazanov, A., Bechhofer, S., Horrocks, I.: Using Vampire to reason with OWL. In: ISWC, pp. 471\u2013485 (2004). https:\/\/doi.org\/10.1007\/978-3-540-30475-3_33","DOI":"10.1007\/978-3-540-30475-3_33"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43513-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T14:02:59Z","timestamp":1694613779000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43513-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031435126","9783031435133"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43513-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"14 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TABLEAUX","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Reasoning with Analytic Tableaux and Related Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"21 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tableaux2023.tableaux-ar.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":"43","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":"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":"47% - 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 (2.92)","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)"}}]}}