By Topic

Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Carlos Ansótegui ; Univ. de Lleida, Lleida, Spain ; Miquel Bofill ; Felip Manyà ; Mateu Villaret

There is a relatively large number of papers dealing with complexity and proof theory issues of infinitely-valued logics. Nevertheless, little attention has been paid so far to the development of efficient solvers for such logics. In this paper we show how the technology of Satisfiability Modulo Theories (SMT) can be used to build efficient automated theorem provers for relevant infinitely-valued logics, including Lukasiewicz, Gödel and Product logics. Moreover, we define a test suite for those logics, and report on an experimental investigation that evaluates the practical complexity of Lukasiewicz and Gödel logics, and provides empirical evidence of the good performance of SMT technology for automated theorem proving on infinitely-valued logics.

Published in:

2012 IEEE 42nd International Symposium on Multiple-Valued Logic

Date of Conference:

14-16 May 2012