A temporal negative normal form which preserves implicants and implicates

Journal of Applied Non-Classical Logics

Volumn 10, Issue 3-4, 2000, Pages 243-272

  Cordero, Pablo ^a   Enciso, Manuel ^a   de Guzmán, Inma P ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Automated; Implicants implicates; Temporal logics; Theorem proving

Indexed keywords

EID: 1642413217     PISSN: 11663081     EISSN: 19585780     Source Type: Journal    
DOI: 10.1080/11663081.2000.10510999     Document Type: Article

References (23)

1. G. Aguilera, I. P. de Guzman and M. Ojeda. TAS-D++ syntactic trees transformations for automated theorem proving. Lect. Notes in Artif.Intelligence no. 838, pages 198-216, 1994.
2. G. Aguilera, I. P. de Guzman and M. Ojeda. Automated model building via syntactic trees transformations. In Proceedings of the CADE-12 Workshop on Automated Model Building, pages 4-10, Nancy (France). June, 1994.
3. G. Aguilera, I. P. de Guzman and M. Ojeda. A reduction-based theorem prover for 3-valued logic. Mathware&Soft Computing, IV(2):99-127, 1997. (Pubitemid 127127792)
4. G. Aguilera, I. P. de Guzman, M. Ojeda and A. Valverde. Reducing signed propositional formulas. Soft Computing, 2(4), 1999.
5. R. Ben-Eliyahu and M. Magidor. A temporal logic for proving properties of topologically general executions. In Information and Computation, 124(2):127-144 1996. (Pubitemid 126412200)
6. A. Burrieza and I.P. de Guzmn. A New Algebraic Semantic Aproach and Some Adequate Connectives for Computation with Temporal Logic over Discrete Time. Journal of Applied Nonclassical Logic, Vol 2. 1992
7. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
8. M. Enciso and I. P. de Guzman. A new and complete automated theorem prover for temporal logic. IJCAI-Workshop on Executable Temporal Logics, 1995.
9. M. Enciso, I. P. de Guzman and Carlos Rossi. Temporal reasoning over linear discrete time. JELIA 96. Lect. Notes in Artif. Intelligence, num. 1126:303-319, 1996. (Pubitemid 126122165)
10. M. Fisher. A resolution method for temporal logic. In 12th International Joint Conference on Artificial Intelligence (IJCAI), 1991.
11. M. Fisher. A normal form for temporal logic and its applications in theorem proving. Journal of Logic and Computation, 7(4):429-456, 1997. (Pubitemid 127666902)
12. L. Fix and 0. Grumberg. Verification of temporal properties. Journal of Logic and Compvtation 6(3):343-362, 1996.
13. J. de Kleer, A. K. Mackworth and R. Reiter Characterizing diagnoses systems. Artificial Intelligence, 56 (2-3), 192-222. 1992.
14. Z. Manna and A. Pnueli. The temporal logic of reactive and concurrent systems: specifications. Springer-Verlag, 1992.
15. Z. Manna and A. Pnueli. Temporal verification of reactive systems: Safety. Springer-Verlag, 1995.
16. D. A. Plaisted and S. Greenbaum. A structure-preserving clause form translation. Journal of Symbolic Computation, 2:293-304, 1986.
17. A. G. Ramesh. Some Applications of Non-clausal Deduction. PhD thesis, Department of Computer Science, State University of New York at Albany. 1995.
18. A. G. Ramesh, B. Beckert, R. Hiinle and N. V. Murray. Fast Subsumption Checks Using Anti-Links. Journal of Automated Reasoning, 1996
19. A. G. Ramesh, G. Becker and N. V. Murray. CNF and DNF considered harmful for computing prime implicantsjimplicates. Journal of Automated Reasoning, to appear
20. A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. Journal of the ACM, 32(3):733-749, 1985. (Pubitemid 15507395)
21. T. Ssaso. Logic Synthesis and Optimization. Kluver, Norwell, USA, 1993.
22. G. Venkatesh. Adecision Method for Temporal Logic based in Resolution. Lect. Notes in Artif. Intelligence, num 206:272-289. 1986.
23. P. Wolper. The tableaux method for temporal logic: an overview. Logique et Analyse, 28 annee, 110-111:119-136, 1985.