DMCA
Reducing Signed Propositional Formulas (1998)
by
Aguilera De Guzman
,
G. Aguilera
,
I. P. De Guzmán
,
M. Ojeda
,
A. Valverde
| Citations: | 1 - 1 self |
BibTeX
@MISC{Guzman98reducingsigned,
author = {Aguilera De Guzman and G. Aguilera and I. P. De Guzmán and M. Ojeda and A. Valverde},
title = {Reducing Signed Propositional Formulas},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
New strategies of reduction for finite valued propositional logics are introduced in the framework of the TAS 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 e#cient 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. 1
