On the Implementation of a Fuzzy DL Solver over Infinite-Valued Product Logic with SMT Solvers

Abstract

In this paper we explain the design and preliminary implementation of a solver for the positive satisfiability problem of concepts in a fuzzy description logic over the infinite-valued product logic. This very solver also answers 1-satisfiability in quasi-witnessed models. The solver works by first performing a direct reduction of the problem to a satisfiability problem of a quantifier free boolean formula with non-linear real arithmetic properties, and secondly solves the resulting formula with an SMT solver. We show that the satisfiability problem for such formulas is still a very challenging problem for even the most advanced SMT solvers, and so it represents an interesting problem for the community working on the theory and practice of SMT solvers. URL http://link.springer.com/chapter/10.1007%2F978-3-642-40381-1_25 [7] Source URL: https://www.iiia.csic.es/en/node/54520 Links [1] https://www.iiia.csic.es/en/staff/teresa-alsinet [2] https://www.iiia.csic.es/en/bibliography?f[author]=735 [3] https://www.iiia.csic.es/en/staff/ramon-bejar [4] https://www.iiia.csic.es/en/staff/f%C3%A9lix-bou [5] https://www.iiia.csic.es/en/staff/marco-cerami [6] https://www.iiia.csic.es/en/staff/francesc-esteva [7] http://link.springer.com/chapter/10.1007%2F978-3-642-40381-1_25

Cite this paper

@inproceedings{Wijsen2017OnTI, title={On the Implementation of a Fuzzy DL Solver over Infinite-Valued Product Logic with SMT Solvers}, author={Jef Wijsen}, year={2017} }