The Inverse Method for Many-Valued Logics
Paper i proceeding, 2013
We define an automatic proof procedure for finitely many-valued logics given by truth tables. The proof procedure is based on the inverse method. To define this procedure, we introduce so-called introduction-based sequent calculi. By studying proof-theoretic properties of these calculi we derive efficient validity- and satisfiability-checking procedures based on the inverse method. We also show how to translate the validity problem for a formula to unsatisfiability checking of a set of propositional clauses.
automated reasoning
decision procedures
proof theory
theorem proving
computational logic
Författare
Laura Kovacs
Chalmers, Data- och informationsteknik, Programvaruteknik
Andrei Mantsivoda
Irkutskij Gosudarstvennyj Universitet
Andrei Voronkov
University of Manchester
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
03029743 (ISSN) 16113349 (eISSN)
Vol. 8265 LNAI PART 1 12-23978-3-642-45113-3 (ISBN)
Styrkeområden
Informations- och kommunikationsteknik
Ämneskategorier
Data- och informationsvetenskap
Programvaruteknik
Datavetenskap (datalogi)
DOI
10.1007/978-3-642-45114-0_2
ISBN
978-3-642-45113-3