Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators

Journal of Symbolic Computation

Volumn 36, Issue 6, 2003, Pages 891-924

  Sofronie Stokkermans, Viorica ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345548345     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(03)00069-5     Document Type: Article

References (42)

1. Anderson, A.R., Belnap, N.D., 1975. Entailment - The Logic of Relevance and Necessity. Princeton University Press.
2. Andréka, H., van Benthem, J., Németi, I., 1998. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic 27, 217-274.
3. Bachmair, L., Ganzinger, H., 1998. Ordered chaining calculi for first-order theories of transitive relations. Journal of the ACM 45 (6), 1007-1049.
4. Bachmair, L., Ganzinger, H., 2001. Resolution theorem proving. In: Robinson, A., Voronkov, A. (Eds.), Handbook of Automated Reasoning, vol. 1. North Holland, pp. 19-100 (Chapter 2).
5. Bachmair, L., Ganzinger, H., Waldmann, U., 1993. Set constraints are the monadic class. In: Eighth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press. pp. 75-83.
6. Blyth, T.S., Varlet, J.C., 1994. Ockham Algebras. Oxford Science Publications.
7. Burris, S., Sankappanavar, H.P., 1981. A Course in Universal Algebra, Graduate Texts in Mathematics. Springer-Verlag.
8. Cosmadakis, S.S., 1985. Equational theories and database constraints. Ph.D. thesis. Massachusetts Institute of Technology.
9. Davey, B.A., Priestley, H.A., 1990. Introduction to Lattices and Order. Cambridge University Press.
10. de Nivelle H., 2001. Translation from S4 into the guarded fragment and the 2-variable fragment. Workshop on Tableaux for Dynamic and Modal Logics.
11. Demri, S., 2001. Personal communication.
12. 3 -time transformation from Grz into decidable fragments of classical first-order logic. In: Caferra, R., Salzer, G. (Eds.), Automated Deduction in Classical and Non-classical Logics, Proceedings of FTP'98. LNAI, vol. 1761. Springer Verlag,
13. Dunn, J.M., 1993. Partial gaggles applied to logics with restricted structural rules. In: Schroeder-Heister, P., Dosen, K. (Eds.), Substructural Logics. Studies in Logic and Computation, vol. 2. Oxford Science Publisher, pp. 63-108.
14. Fermüller, C., Leitsch, A., Tammet, T., Zamov, N., 1993. Resolution Method for the Decision Problem. LNCS, vol. 679. Springer Verlag.
15. Ganzinger, H., de Nivelle, H., 1999. A superposition decision procedure for the guarded fragment with equality. Proceedings of the Fourteenth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, pp. 295-303.
16. Ganzinger, H., Hustadt, U., Meyer, C., Schmidt, R.A., 2001. A resolution-based decision procedure for extensions of K4. In: Zakharyaschev, M., Segerberg, K., de Rijke, M., Wansing, H. (Eds.), Advances in Modal Logic, CSLI Lecture Notes, vol. 119, vol. 2. CSLI, Stanford, USA, pp. 225-246 (Chapter 9).
17. Ganzinger, H., Meyer, C., Veanes, M., 1999. The two-variable guarded fragment with transitive relations. In: Proceedings of the Fourteenth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, pp. 24-34.
18. Gehrke, M., Jónsson, B., 1994. Bounded distributive lattices with operators. Mathematica Japonica 40 (2), 207-215.
19. Gehrke, M., Jónsson, B., 2000. Monotone bounded distributive lattice expansions. Mathematica Japonica 52 (2), 197-213.
20. Goldblatt, R., 1989. Varieties of complex algebras. Annals of Pure and Applied Logic 44 (3), 153-301.
21. Grädel, E., 1999. On the restraining power of guards. The Journal of Symbolic Logic 64, 1719-1742.
22. Halmos, P., 1955. Algebraic logic I. Monadic Boolean algebras. Compositio Mathematicae 12, 217-249.
23. Hunt, H.B., Rosenkrantz, D.J., Bloniarz, P.A., 1987. On the computational complexity of algebra of lattices. SIAM Journal of Computation 16 (1), 129-148.
24. Jónsson, B., Tarski, A., 1951. Boolean algebras with operators, Part I. American Journal of Mathematics 73, 891-939.
25. Jónsson, B., Tarski, A., 1952. Boolean algebras with operators, Part II. American Journal of Mathematics 74, 127-162.
26. McAllester, D., Givan, R., Kozen, D., Witty, C., 1996. Tarskian set constraints. In: Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, pp. 138-151.
27. McKinsey, J.C.C., 1943. The decision problem for some classes of sentences without quantifiers. The Journal of Symbolic Logic 8 (3), 61-76.
28. Mielniczuk, P., Pacholski, L., 1998. Tarskian set constraints are in NEXPTIME. In: Brim, L., Gruska, J., Zlatuska, J. (Eds.), Proceedings of MFCS'98. LNCS, vol. 1450. Springer Verlag, pp. 589-596.
29. Ohlbach, H.J., 1993. Translation methods for non-classical logics: an overview. Bulletin of the IGPL 1 (1), 69-89.
30. Ohlbach, H.J., Nonnengart, A., de Rijke, M., Gabbay, D., 2001. Encoding two-valued nonclassical logics in classic logic. In: Robinson, A., Voronkov, A. (Eds.), Handbook of Automated Reasoning. Elsevier, Amsterdam, Netherlands, pp. 1403-1485 (Chapter 21).
31. Priestley, H.A., 1970. Representation of distributive lattices by means of ordered Stone spaces. Bulletin of the London Mathematical Society 2, 186-190.
32. Priestley, H.A., 1984. Ordered sets and duality for distributive lattices. Annals of Discrete Mathematics 23, 39-60.
33. Sofronie-Stokkermans, V., 1997. Fibered structures and applications to automated theorem proving in certain classes of finitely-valued logics and to modeling interacting systems. Ph.D. thesis, RISC-Linz Report Series 97-16. RISC-Linz, J. Kepler University Linz, Austria.
34. Sofronie-Stokkermans, V., 1999a. On the universal theory of varieties of distributive lattices with operators: Some decidability and complexity results. In: Proceedings of the 16th International Conference on Automated Deduction. LNAI, vol. 1632. Springer Verlag, pp. 157-171.
35. Sofronie-Stokkermans, V., 1999b. Representation theorems and automated theorem proving in non-classical logics. In: Proceedings of the 29th IEEE International Symposium on Multiple-Valued Logic. IEEE Computer Society, pp. 242-247.
36. Sofronie-Stokkermans, V., 2000a. Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics I. Studia Logica 64 (1), 93-132.
37. Sofronie-Stokkermans, V., 2000b. Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics II. Studia Logica 64 (2), 151-172.
38. Sofronie-Stokkermans, V., 2001. Automated theorem proving by resolution for finitely-valued logics based on distributive lattices with operators. Multiple-Valued Logic - An International Journal 6 (3-4), 289-344.
39. Sofronie-Stokkermans, V., 2003. Representation theorems and the semantics of non-classical logics, and applications to automated theorem proving. In: Fitting, M., Orlowska, E. (Eds.), Beyond Two: Theory and Applications of Multiple Valued Logic. Studies in Fuzziness and Soft Computing, vol. 114. Springer, Berlin, pp. 59-100 (Chapter 3).
40. Struth, G., 1998. Canonical transformations in algebra, universal algebra, and logic. Ph.D. thesis. Max-Planck-Institut für Informatik, Saarbrücken.
41. Szwast, W., Tendera, L., 2001. On the decision problem for the guarded fragment with transitivity. In: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society, pp. 147-156.
42. Weidenbach, Ch., Gaede, B., Rock, G., 1996. SPASS & FLOTTER version 0.42. In: McRobie, M.A., Slaney, J.K. (Eds.), Proceedings of the 13th International Conference on Automated Deduction. LNCS, vol. 1104. Springer Verlag, pp. 141-145.