Automatic proving of fuzzy formulae with fuzzy logic programming and SMT
In this paper we deal with propositional fuzzy formulae containing several propositional
symbols linked with connectives defined in a lattice of truth degrees more complex than …
symbols linked with connectives defined in a lattice of truth degrees more complex than …
[PDF][PDF] XIII Spanish Conference on Programming and Computer Languages (PROLE 2013)
I Castineiras, F Sáenz-Pérez - Electronic Communications of the EASST, 2013 - core.ac.uk
The CFLP system T OY (FD) is implemented in SICStus Prolog, and supports FD constraints
by interfacing the CP (FD) solvers of Gecode and ILOG Solver. In this paper, T OY (FD) is …
by interfacing the CP (FD) solvers of Gecode and ILOG Solver. In this paper, T OY (FD) is …