Restricted Delta-Trees and Reduction Theorems in Multiple-Valued Logics

Authors:
Inman P. de Guzmán;Manuel Ojeda-Aciego;Agustín Valverde
Affiliations:
-;-;-
Venue:
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Year:
2002

Citing 6
Cited 1

Resolution and model building in the infinite-valued calculus of Łukasiewicz

Theoretical Computer Science
Reductions for non-clausal theorem proving

Theoretical Computer Science
Finiteness in Infinite-Valued Σukasiewicz Logic

Journal of Logic, Language and Information
Restricted Delta-Trees in Multiple-Valued Logics

AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Computing Equilibrium Models Using Signed Formulas

CL '00 Proceedings of the First International Conference on Computational Logic
Functional decomposition of MVL functions using multi-valued decision diagrams

ISMVL '97 Proceedings of the 27th International Symposium on Multiple-Valued Logic

A logic with imprecise probabilities and an application to automated reasoning using rewriting techniques

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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].