Abstract
New strategies of reduction for finite-valued propositional logics are introduced in the framework of the TAS1 methodology developed by the authors [1]. A new data structure, the Δ^-sets, is introduced to store information about the formula being analysed, and its usefulness is shown by developing efficient strategies to decrease the size of signed propositional formulas, viz., new criteria to detect the validity or unsatisfiability of subformulas, and a strong generalisation of the pure literal rule.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Aguilera, G., de Guzmán, I., Ojeda-Aciego, M. et al. Reducing signed propositional formulas. Soft Computing 2, 157–166 (1999). https://doi.org/10.1007/s005000050048
Issue Date:
DOI: https://doi.org/10.1007/s005000050048