Restricted ideals and the groupability property. Tools for temporal reasoning

Kybernetika

Volumn 39, Issue 5, 2003, Pages 521-546

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

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Ideal; Induction; Lattice; Prime implicants implicates; Temporal reasoning

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SET THEORY;

PRIME IMPLICANTS; TEMPORAL REASONING;

FORMAL LOGIC;

EID: 1642371276     PISSN: 00235954     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (25)

1. S. Abiteboul and V. Vianu: Non-determinism in logic based languages. Ann. Math. Artif. Intell. 3 (1991), 151-186.
2. L. Corciulo, F. Giannotti, D. Pedreschi, and C. Zaniolo: Expressive power of non-deterministic operators for logic-based languages. Workshop on Deductive Databases and Logic Programming, 1994, pp. 27-40.
3. P. Cordero, M. Enciso, and I. de Guzmán: Structure theorems for closed sets of implicates/implicants in temporal logic. (Lecture Notes in Artificial Intelligence 1695.) Springer-Verlag, Berlin 1999.
4. P. Cordero, M. Enciso, and I. de Guzmán: A temporal negative normal form which preserves implicants and implicates. J. Appl. Non-Classical Logics 10 (2000), 3-4, 243-272.
5. P. Cordero, M. Enciso, and I. de Guzmán: From the posets of temporal implicates/implicants to a temporal negative normal form. Rep. Math. Logic 36 (2002), 3-48.
6. P. Cordero, M; Enciso, and I. de Guzmán: Bases for closed sets of implicants and implicates in temporal logic. Acta Inform. 38 (2002), 599-619.
7. P. Cordero, M. Enciso, I. de Guzmán, and J. Martínez: A New algebraic tool for automatic theorem provers. Ann. Math. Artif. Intell. (to appear).
8. I. de Guzmán, M. Ojeda, and A. Valverde: Reductions for non-clausal theorem proving. Theoret. Comput. Sci. 266 (2001), 1-2, 81-112.
9. A. J. Dix: Non-determinism as a paradigm for understanding the user interface. Chapter 4 in Formal Methods in Human-Computer Iteraction. Cambridge University Press, Cambridge 1990, pp. 97-127.
10. F. Giannoti, D. Pedreschi, D. Sacca, and C. Zaniolo: Non-determinism in deductive databases. Proc. 2nd Internat. Conference on Deductive and Object-Oriented Databases, 1991.
11. G. Grätzer: General Lattice Theory. Second edition. Birkhäuser, Basel 1998.
12. G. Gutiérrez, I. de Guzmán, J. Martínez, M. Ojeda, and A. Valverde: Reduction Theorems for Boolean Formulas Using Δ-Trees. Springer Verlag, Berlin 2000.
13. G. Gutiérrez, I. de Guzmán, J. Martínez, M. Ojeda, and A. Valverde: Satisfiability testing for Boolean formulas using Δ-trees. Studia Folder.
14. R. Hänle and G. Escalada: Deduction in many valued logics: a survey. Mathware and Soft Computing, 1997.
15. R. Hänle: Advances in Many-Valued Logics. Kluwer, Dordrecht 1999.
16. P. Jackson and J. Pais: Computing Prime Implicants. (Lecture Notes in Artificial Intelligence 449.) Spriger-Verlag, Berlin 1990, pp. 543-557.
17. A. Kean: The approximation of implicates and explanations. Internat. J. Approx. Reason. 9 (1993), 97-128.
18. A. Kean and G. Tsiknis: An incremental method-for generating prime implicants/implicates. J. Symbolic Comput. 9 (1990), 185-206.
19. J. de Kleer, A. K. Mackworth, and R. Reiter: Characterizing diagnoses and systems. Artif. Intell. 56 (1992), 2-3, 192-222.
20. A. Kogan, T. Ibaraki, and K. Makino: Functional dependencies in horn theories. Artif. Intell. 108 (1999), 1-30.
21. P. Marquis: Extending abduction from propositional to first-order logic. Fund. Artif. Intell. Res. 1991, pp. 141-155.
22. J. Martínez: Ω-álgebras con onds. Doctoral Dissertation, University of Málaga, 2000.
23. J. Martínez, G. Gutierrez, I. P. de Guzmán, and P. Cordero: Multilattices looking at computations. Discrete Mathematics (to appear).
24. A. Mishchenko and R. Brayton: Theory of non-deterministic networks. An International Workshop on Boolean Problems, 2002.
25. M. Tomite: Efficient Parsing for Natural Language. Kluwer, Dordrecht 1986.