Reducing signed propositional formulas

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 efficient strategies to decrease the size of signed… (More)
DOI: 10.1007/s005000050048

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics