A new algebraic tool for Automatic Theorem Provers. Multisemilattice: A structure to improve the efficiency of provers in temporal logics

Annals of Mathematics and Artificial Intelligence

Volumn 42, Issue 4, 2004, Pages 369-398

  Cordero, P ^a   Gutierrez G ^a   Martinez J ^a   De Guzman I P ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

automated deduction; ideals; implicants; lattice theory; multisemilattice; theorem provers

Indexed keywords

EID: 4444301708     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:AMAI.0000038312.77514.3c     Document Type: Article

References (27)

1. G. Aguilera, M. Ojeda and I.P. de Guzmán, A new reduction-based theorem prover for 3-valued logic, Mathware & Soft Computing 4(2) (1997) 99-127.
2. A. Burrieza and I.P. de Guzmán, A new algebraic semantic approach and adequate connectives for computation with temporal logic over discrete time, Journal of Applied Non-Classical Logics 2(2) (1991) 181-200.
3. A. Chagrov and M. Zakharyaschev, Modal Logic, Oxford Science Publications (Clarendon Press, Oxford, 1997).
4. P.M. Cohn, Universal Algebra, Mathematics and Its Applications, Vol. 6 (D. Reidel, 1965).
5. P. Cordero, M. Enciso and I.P. de Guzmán, Structure Theorems for Closed Sets of Implicates/Implicants in Temporal Logic, Lecture Notes in Artificial Intelligence, Vol. 1695 (1999).
6. P. Cordero, M. Enciso and I.P. de Guzmán, A temporal negative normal form which preserves implicants and implicates, Journal of Applied Non-Classical Logics 10(3-4) (2000) 243-272.
7. P. Cordero, M. Enciso and I.P. de Guzmán, From the posets of temporal implicates/implicants to a temporal negative normal form, Reports on Mathematical Logics 36 (2002) 3-48.
8. P. Cordero, M. Enciso and I.P. de Guzmán, Bases for closed sets of implicants and implicates in temporal logic, Acta Informatica 38 (2002) 599-619.
9. I.P. de Guzmán, M. Ojeda and A. Valverde, Implicates and reduction techniques for temporal logics, Annals of Mathematics and Artificial Intelligence 27(1-4) (1999) 3-23.
10. I.P. de Guzmán, M. Ojeda and A. Valverde, Reductions for non-clausal theorem proving, Theoretical Computer Science 266(1-2) (2001) 81-112.
11. I.P. de Guzmán, P. Cordero and M. Enciso, Structure theorems for closed sets of implicates/implicants in temporal logic, in: Lecture Notes in Artificial Intelligence, Vol. 1695 (1999) pp. 193-207.
12. J. de Kleer, A.K. Mackworth and R. Reiter, Characterizing diagnoses and systems, Artificial Intelligence 56(2-3) (1992) 192-222.
13. M. Enciso and I.P. de Guzmán, A new and complete theorem prover for temporal logic, in: IJCAI'95-Workshop on Executable Temporal Logics (August 1995).
14. M. Enciso, I.P. de Guzmán and C. Rossi, Temporal reasoning over linear discrete time, in: Logics in Artificial Intelligence, Lecture Notes in Artificial Intelligence, Vol. 1126 (Springer, 1996) pp. 303-319.
15. M. Enciso, P. Cordero and I.P. de Guzmán, From the posets of temporal implicates/implicants to a temporal negative normal form, Reports on Mathematical Logics 36 (2002) 3-48.
16. G. Grätzer, General Lattice Theory (Birkhäuser, Basel, 1998).
17. G. Gutiérrez, J. Martínez, I.P. de Guzmán, M. Ojeda and A. Valverde, Reduction theorems for boolean formulas using Δ-trees, Lecture Notes in Artificial Intelligence, Vol. 1919 (2000) pp. 179-192.
18. R. Hähnle, Handbook of Philosophical Logic. Advances in Many-Valued Logics, 2nd edition (Kluwer, 1999).
19. R. Hähnle and G. Escalada, Deduction in many valued logics: a survey, Mathware & Soft Computing 4(2) (1997).
20. P. Jackson and J. Pais, Computing prime implicants, in: Lecture Notes in Artificial Intelligence, Vol. 449 (Springer, 1990) pp. 543-557.
21. H. Kamp, Tense logic and theory of linear orders, Ph.D. Thesis, University of California, Los Angeles (1968).
22. A. Kean, The approximation of implicates and explanations, International Journal of Approximate Reasoning 9 (1993) 97-128.
23. A. Kean and G. Tsiknis, An incremental method for generating prime implicants/implicates, Journal of Symbolic Computation 9 (1990) 185-206.
24. A. Kogan, T. Ibaraki and K. Makino, Functional dependencies in horn theories, Artificial Intelligence 108(1-30) (1999).
25. P. Marquis, Extending abduction from prepositional to first-order logic, Fundamentals of Artificial Intelligence Research (1991) 141-155.
26. M. Ojeda, G. Aguilera, A. Valverde and I.P. de Guzmán, Reductions for non-clausal theorem proving, Theoretical Computer Science 266(1/2) (2001) 81-112.
27. R. Socher, Optimizing the clausal normal form transformation, Journal of Automated Reasoning 7(3) (1991) 325-336.