The implementation of a logic requires, besides the definition of a calculus and a decision procedure, the development of techniques to reduce the search space. In this article we introduce some simplification rules for Intuitionistic propositional logic that try to replace a formula with an equi-satisfiable "simpler" one with the aim to reduce the search space. Our results are proved via semantical techniques based on Kripke models. We also provide an empirical evaluation of their impact on implementations. © 2012 ACM 1529-3785/2012/04-ART14 $10.00.
Ferrari, M., Fiorentini, C., Fiorino, G. (2012). Simplification Rules for Intuitionistic Propositional Tableaux. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 13(2), 1-23 [10.1145/2159531.2159536].
Simplification Rules for Intuitionistic Propositional Tableaux
FIORINO, GUIDO GIUSEPPE
2012
Abstract
The implementation of a logic requires, besides the definition of a calculus and a decision procedure, the development of techniques to reduce the search space. In this article we introduce some simplification rules for Intuitionistic propositional logic that try to replace a formula with an equi-satisfiable "simpler" one with the aim to reduce the search space. Our results are proved via semantical techniques based on Kripke models. We also provide an empirical evaluation of their impact on implementations. © 2012 ACM 1529-3785/2012/04-ART14 $10.00.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
