Abstract
In the literature, little attention has been paid to the development of solvers for systems of mathematical fuzzy logic, even though there is an important number of studies on complexity and proof theory for them. In this paper, extending a recent approach by Ansótegui et al., we present ongoing work on an efficient and modular SMT-based solver for a wide family of continuous t-norm based fuzzy logics. The solver is able to deal with most famous fuzzy logics (including BL, Łukasiewicz, Gödel and Product); and for each of them, it is able to test, among others, satisfiability, tautologicity and logical consequence problems. Note that, unlike the classical case, these problems are not in general interdefinable in fuzzy logics. Some empirical results are reported at the end of the paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aguzzoli, S., Gerla, B., Haniková, Z.: Complexity issues in basic logic. Soft Computing 9(12), 919–934 (2005)
Ansótegui, C., Bofill, M., Manyà, F., Villaret, M.: Building automated theorem provers for infinitely valued logics with satisfiability modulo theory solvers. In: ISMVL 2012, pp. 25–30. IEEE Computer Society (2012)
Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB standard: Version 2.0. Technical report, Department of Computer Science, The University of Iowa (2010), http://www.SMT-LIB.org
Bobillo, F., Straccia, U.: Fuzzy description logics with general t-norms and datatypes. Fuzzy Sets and Systems 160(23), 3382–3402 (2009)
Cignoli, R., Torrens, A.: An algebraic analysis of product logic. Multiple-Valued Logic 5, 45–65 (2000)
Cintula, P., Hájek, P., Noguera, C.: Handbook of Mathematical Fuzzy Logic. Studies in Logic, 2 volumes 37, 38. Mathematical Logic and Foundation, College Publications (2011)
de Moura, L., Bjørner, N.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)
Esteva, F., Godo, L., Montagna, M.: Equational Characterization of the Subvarieties of BL Generated by t-norm Algebras. Studia Logica 76(2), 161–200 (2004)
Hähnle, R.: Automated deduction in multiple valued logics. Oxford Univ. Pr. (1993)
Hájek, P.: Metamathematics of fuzzy logic. Kluwer Academic Publishers (1998)
Montagna, F.: Generating the variety of BL-algebras. Soft Computing 9(12), 869–874 (2005)
Mundici, D.: Satisfiability in many-valued sentential logic is NP-complete. Theoretical Computer Science 52(1-2), 145–153 (1987)
Rothenberg, R.: A class of theorems in Łukasiewicz logic for benchmarking automated theorem provers. In: Olivetti, N., Schwind, C. (eds.) TABLEAUX 2007, pp. 101–111 (2007)
Schockaert, S., Janssen, J., Vermeir, D.: Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction. Journal of Automated Reasoning (to appear)
Schockaert, S., Janssen, J., Vermeir, D., De Cock, M.: Finite Satisfiability in Infinite-Valued Łukasiewicz Logic. In: Godo, L., Pugliese, A. (eds.) SUM 2009. LNCS, vol. 5785, pp. 240–254. Springer, Heidelberg (2009)
Sebastiani, R.: Lazy satisfiability modulo theories. Journal on Satisfiability, Boolean Modeling and Computation 3(3-4), 141–224 (2007)
Vidal, A., Bou, F., Godo, L.: An SMT-based solver for continuous t-norm based logics (extended version). Technical report, IIIA - CSIC (2012), http://www.iiia.csic.es/files/pdfs/ctnormSolver-long.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vidal, A., Bou, F., Godo, L. (2012). An SMT-Based Solver for Continuous t-norm Based Logics. In: Hüllermeier, E., Link, S., Fober, T., Seeger, B. (eds) Scalable Uncertainty Management. SUM 2012. Lecture Notes in Computer Science(), vol 7520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33362-0_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-33362-0_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33361-3
Online ISBN: 978-3-642-33362-0
eBook Packages: Computer ScienceComputer Science (R0)