Implicates and reduction techniques for temporal logics

Authors:
I. P. de Guzmán;M. Ojeda-Aciego;A. Valverde
Affiliations:
Dept. Matemática Aplicada, Universidad de Málaga, P.O. Box 4114, 29080 Málaga, Spain E-mail: {guzman,aciego,a_valverde}@ctima.uma.es;Dept. Matemática Aplicada, Universidad de Málaga, P.O. Box 4114, 29080 Málaga, Spain E-mail: {guzman,aciego,a_valverde}@ctima.uma.es;Dept. Matemática Aplicada, Universidad de Málaga, P.O. Box 4114, 29080 Málaga, Spain E-mail: {guzman,aciego,a_valverde}@ctima.uma.es
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
1999

Citing 5
Cited 2

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
The complexity of probabilistic verification

Journal of the ACM (JACM)
Temporal verification of reactive systems: safety

Temporal verification of reactive systems: safety
A temporal logic for proving properties of topologically general executions

Information and Computation

Reduction Theorems for Boolean Formulas Using Delta-Trees

JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
A New Algebraic Tool for Automatic Theorem Provers

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reduction strategies are introduced for the future fragment of a temporal propositional logic on linear discrete time, named FNext. These reductions are based on the information collected from the syntactic structure of the formula, which allows the development of efficient strategies to decrease the size of temporal propositional formulas, viz. new criteria to detect the validity or unsatisfiability of subformulas, and a strong generalisation of the pure literal rule. These results, used as an inner processing step, allow to improve the performance of any automated theorem prover.