Restricted ∆-trees and Reduction Theorems in Multiple-Valued Logics

In this paper we continue the theoretical study of the possible applications of the ∆-tree data structure for multiple-valued logics, specifically, to be applied to signed propositional formulas. The ∆-trees allow a compact representation for signed formulas as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula. New and improved versions of reduction theorems for finite-valued propositional logics are introduced, and a satisfiability algorithm is provided which further generalise the TAS method [1, 5].

[1]  Manuel Ojeda-Aciego,et al.  Reductions for non-clausal theorem proving , 2001, Theor. Comput. Sci..

[2]  David Pearce,et al.  Computing Equilibrium Models Using Signed Formulas , 2000, Computational Logic.

[3]  Rolf Drechsler,et al.  Functional decomposition of MVL functions using multi-valued decision diagrams , 1997, Proceedings 1997 27th International Symposium on Multiple- Valued Logic.

[4]  Stefano Aguzzoli,et al.  Finiteness in Infinite-Valued Łukasiewicz Logic , 2000, J. Log. Lang. Inf..

[5]  Reiner Hähnle,et al.  Uniform Notation of Tableau Rules for Multiple-Valued Logics , 1991, ISMVL.

[6]  Neil V. Murray,et al.  Improving tableau deductions in multiple-valued logics , 1991, [1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic.

[7]  Manuel Ojeda-Aciego,et al.  Satisfiability testing for Boolean formulas using ∆-trees , 2002 .

[8]  A. Valverde,et al.  Restricted ∆-trees in Multiple-Valued Logics ? , 2002 .

[9]  Manuel Ojeda-Aciego,et al.  Reducing signed propositional formulas , 1999, Soft Comput..

[10]  Nicola Olivetti,et al.  Resolution and Model Building in the Infinite-Valued Calculus of Lukasiewicz , 1998, Theor. Comput. Sci..