Abstract
Implicants and implicates has proven to be powerful tools to improve the deduction capabilities of automated theorem provers. In this work, we focussed on the propositional temporal logic and we propose a new theoretical framework to capture maximum information about implicants and implicates. Concretely, we study the structure of the sets of unitary implicates and implicants and present the concept of base as the smallest finite set that generates them. As we shall show, using bases it is possible to handle efficiently the sets of implicants and implicates. For this, we introduce a set of operators having linear cost.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Fisher. A normal form for temporal logic and its applications in theorem proving. Journal of Logic and Computation, 7(4):429–456, 1991.
M. Fisher. A resolution method for temporal logic. In 12 th International Joint Conference on Artificial Intelligence (IJCAI), 1991.
D. M. Gabbay. The declarative past and imperative future, volume 398 of Lecture Notes in Computer Science. Springer Verlag, 1989.
I. P. de Guzmán, G. Aguilera and M. Ojeda. Increasing the efficiency of automated theorem proving. Journal of Applied non Classical logics, 5(1): 9–29, 1995.
I. P. de Guzmán, G. Aguilera and M. Ojeda. Automated model building via syntactic trees transformations. In In Proceedings of the CADE-12 Workshop on Automated Model Building, pages 4–10, Nancy (France), June, Sept. 1994.
I. P. de Guzmán, G. Aguilera and M. Ojeda. A reduction-based theorem prover for 3-valued logic. Mathware & Soft Computing, IV(2):99–127, 1997.
I. P. de Guzmán, G. Aguilera, M. Ojeda and A. Valverde. Reducing signed propositional formulas. Soft Computing, 2(4), 1999 (to appear).
I. P. de Guzmán and M. Enciso. A new and complete automated theorem prover for temporal logic. IJCAI-Workshop on Executable Temporal Logics, 1995.
I. P. de Guzmán, M. Enciso and Carlos Rossi. Temporal reasoning over linear discrete time. Lect. Notes in Artif. Intelligence no. 838, pages 198–216, 1996.
J. de Kleer, A. K. Mackworth, and R. Reiter. Characterizing diagnoses and systems. Artificial Intelligence, 56(2–3), 192–222, 1992.
Z. Manna and A. Pnueli. Temporal verification of reactive systems: Safety. Springer-Verlag, 1995.
T. Ssaso. Logic synthesis and optimization. Kluver, Norwell, USA, 1993.
P. Wolper. The tableaux method for temporal logic: an overview. Logique et Analyse, 28 année, 110–111:119–136, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Guzmán, I.P., Cordero, P., Enciso, M. (1999). Structure Theorems for Closed Sets of Implicates/Implicants in Temporal Logic. In: Barahona, P., Alferes, J.J. (eds) Progress in Artificial Intelligence. EPIA 1999. Lecture Notes in Computer Science(), vol 1695. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48159-1_14
Download citation
DOI: https://doi.org/10.1007/3-540-48159-1_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66548-9
Online ISBN: 978-3-540-48159-1
eBook Packages: Springer Book Archive