Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
dc.contributor.author
dc.date.accessioned
2016-09-21T10:42:03Z
dc.date.available
2016-09-21T10:42:03Z
dc.date.issued
2016-06-01
dc.identifier.issn
0165-0114
dc.identifier.uri
dc.description.abstract
There is a relatively large number of papers dealing with complexity and proof theory issues of multiple-valued logics. Nevertheless, little attention has been paid so far to the development of efficient and robust solvers for such logics. In this paper we investigate how the technology of Satisfiability Modulo Theories (SMT) can be effectively used to build efficient automated theorem provers for relevant finitely-valued and infinitely-valued logics, taking the logics of Łukasiewicz, Gödel and Product as case studies. Besides, we report on an experimental investigation that evaluates the performance of SMT technology when solving multiple-valued logic problems, and compares the finitely-valued solvers for Łukasiewicz and Gödel logics with their infinitely-valued solvers from a computational point of view. We also compare the performance of SMT technology and MIP technology when testing the satisfiability on a genuine family of multiple-valued clausal forms
dc.description.sponsorship
Research partially supported by the Generalitat de Catalunya grant AGAUR 2014-SGR-118, and the Ministerio de Economía y Competitividad projects CO-PRIVACY TIN2011-27076-C03-03, TASSAT-2 TIN2013-48031-C4-4-P and HeLo TIN2012-33042. The third author was supported by Mobility Grant PRX14/00195 of the Ministerio de Educación, Cultura y Deporte
dc.format.mimetype
application/pdf
dc.language.iso
eng
dc.publisher
Elsevier
dc.relation
info:eu-repo/grantAgreement/MINECO//TIN2012-33042/ES/HERRAMIENTAS LOGICAS PARA PROBLEMAS COMBINATORIOS/
dc.relation.isformatof
Reproducció digital del document publicat a: http://dx.doi.org/10.1016/j.fss.2015.04.011
dc.relation.ispartof
© Fuzzy Sets and Systems, 2016, vol. 292, p. 32-48
dc.relation.ispartofseries
Articles publicats (D-IMA)
dc.rights
Tots els drets reservats
dc.subject
dc.title
Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers
dc.type
info:eu-repo/semantics/article
dc.rights.accessRights
info:eu-repo/semantics/embargoedAccess
dc.embargo.terms
Cap
dc.date.embargoEndDate
info:eu-repo/date/embargoEnd/2026-01-01
dc.type.version
info:eu-repo/semantics/publishedVersion
dc.identifier.doi
dc.identifier.idgrec
023519
dc.contributor.funder
dc.relation.ProjectAcronym