On the Implementation of a Fuzzy DL Solver over Infinite-Valued Product Logic with SMT Solvers
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.
Keywordsdescription logics fuzzy product logic SMT solvers
Unable to display preview. Download preview PDF.
- 2.Cerami, M., Esteva, F., Bou, F.: Decidability of a description logic over infinite-valued product logic. In: Proceedings of KR 2010 (2010)Google Scholar
- 8.Hustadt, U., Motik, B., Sattler, U.: Reducing SHIQ-description logic to disjunctive Datalog programs. In: Proceedings of KR 2004, pp. 152–162 (2004)Google Scholar
- 9.Straccia, U., Bobillo, F.: Mixed integer programming, general concept inclusions and fuzzy description logics. In: Proceedings of EUSFLAT 2007, pp. 213–220 (2007)Google Scholar