Abstract
AbstractWe 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 $$\mathcal {ALC}$$ 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.
Publisher
Springer Nature Switzerland
Reference40 articles.
1. Areces, C., Fontaine, P., Merz, S.: Modal satisfiability via SMT solving. In: Software, Services, and Systems, pp. 30–45 (2015). https://doi.org/10.1007/978-3-319-15545-6_5
2. Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic (2017)
3. 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–31 (2018). https://doi.org/10.23638/LMCS-14(4:12)2018
4. Lecture Notes in Computer Science;H Barbosa,2022
5. Barrett, C., Fontaine, P., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2016). http://SMT-LIB.org