A new combination procedure for the word problem that generalizes fusion decidability results in modal logics

Information and Computation

Volumn 204, Issue 10, 2006, Pages 1413-1452

  Baader, Franz ^a   Ghilardi, Silvio ^b   Tinelli, Cesare ^c  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF MILAN   (Italy)

^c University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DECISION THEORY; FORMAL LOGIC;

COMBINATION PROCEDURE; DECISION PROCEDURE; EQUATIONAL THEORY; MODAL LOGIC; NEW APPROACHES; WORD PROBLEM;

BOOLEAN ALGEBRA;

EID: 84855195487     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2005.05.009     Document Type: Article

References (48)

1. M. A. Arbib, E. G. Manes, Arrows, Structures and Functors, Academic Press, New York, 1975.
2. F. Baader, P. Hanschke, Extensions of concept languages for a mechanical engineering application, in: Proceedings of the 16th German Workshop on Artificial Intelligence (GWAI'92), Lecture Notes in Computer Science, vol. 671, Springer-Verlag, Bonn (Germany), 1992, pp. 132-143.
3. F. Baader, T. Nipkow, Term Rewriting and All That, Cambridge University Press, United Kingdom, 1998.
4. F. Baader, W. Synder, Unification theory, in: J. Robinson, A. Voronkov (Eds.), Handbook of Automated Reasoning, vol. I, Elsevier Science Publishers, 2001, pp. 447-533.
5. F. Baader, C. Tinelli, A new approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method, in: Proceedings of the 14th International Conference on Automated Deduction (Townsville, Australia), in: W. McCune (Ed.), Lecture Notes in Artificial Intelligence, vol. 1249, Springer-Verlag, Berlin, 1997, pp. 19-33. (Pubitemid 127089506)
6. F. Baader, C. Tinelli, Deciding the word problem in the union of equational theories, Information and Computation #6178(2) (2002) 346-390. (Pubitemid 35369807)
7. F. Baader, H.-J. Bürckert, B. Nebel, W. Nutt, G. Smolka, On the expressivity of feature logics with negation, functional uncertainty, and sort equations, Journal of Logic, Language and Information 2(1993) 1-18.
8. F. Baader, C. Lutz, H. Sturm, F. Wolter, Fusions of description logics and abstract description systems, Journal of Artificial Intelligence Research 16(2002) 1-58. (Pubitemid 43057169)
9. F. Baader, S. Ghilardi, C. Tinelli, A new combination procedure for the word problem that generalizes fusion decidability results in modal logics, in: Proceedings of the Second International Joint Conference on Automated Reasoning (IJCAR'04), Lecture Notes in Artificial Intelligence, vol. 3097, Springer-Verlag, Cork (Ireland), 2004, pp. 183-197. (Pubitemid 38939969)
10. R. Balbes, P. Dwinger, Distributive Lattices, University of Missouri Press, Columbia, 1974.
11. A. Chagrov, M. Zakharyaschev, Modal Logic, Vol. 35 of Oxford Logic Guides, Clarendon Press, Oxford, 1997.
12. C.-C. Chang, H. J. Keisler, Model Theory, third ed., North-Holland, Amsterdam-London, 1990.
13. B. F. Chellas, Modal Logic, an Introduction, Cambridge University Press, Cambridge, 1980.
14. E. M. Clarke, A. E. Emerson, Design and synthesis of synchronisation skeletons usin branching time temporal logic, in: Logic of Programs, Lecture Notes in Computer Science, vol. 131, Springer-Verlag, NY, 1982, pp. 52-71.
15. E. Domenjoud, F. Klay, C. Ringeissen, Combination techniques for non-disjoint equational theories, in: Proceedings of the 12th International Conference on Automated Deduction, Nancy (France), in: A. Bundy (Ed.), Lecture Notes in Artificial Intelligence, vol. 814, Springer-Verlag, Berlin, 1994, pp. 267-281.
16. A. E. Emerson, J. Y. Halpern, 'sometimes' and 'not never' revisited: on branching versus linear time temporal logic, Journal of the ACM 33(1) (1986) 151-178.
17. M. Fattorosi-Barnaba, F. De Caro, Graded modalities I, Studia Logica 44(1985) 197-221.
18. K. Fine, G. Schurz, Transfer theorems for stratified modal logics, in: J. Copeland (Ed.), Logic and Reality: Essays in Pure and Applied Logic. In Memory of Arthur Prior, Oxford University Press, 1996, pp. 169-213.
19. C. Fiorentini, S. Ghilardi, Combining word problems through rewriting in categories with products, Theoretical Computer Science 294(2003) 103-149.
20. D. M. Gabbay, Fibring Logics, Vol. 38 of Oxford Logic Guides, Clarendon Press, Oxford, 1999.
21. D. M. Gabbay, I. Hodkinson, M. Reynolds, Temporal Logic, Vol. I, Vol. 28 of Oxford Logic Guides, Clarendon Press, Oxford, 1994.
22. D. M. Gabbay, A. Kurucz, F. Wolter, M. Zakharyaschev, Many-Dimensional Modal Logics: Theory and Applications, Elsevier, Amsterdam, 2003.
23. S. Ghilardi, Model-theoretic methods in combined constraint satisfiability, Journal of Automated Reasoning 33 (3-4) (2004) 221-249. (Pubitemid 40400715)
24. S. Ghilardi, L. Santocanale, Algebraic and model theoretic techniques for fusion decidability in modal logics, in: Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2003), in: M. Vardi, A. Voronkov (Eds.), Lecture Notes in Computer Science, vol. 2850, Springer-Verlag, Berlin, 2003, pp. 152-166. (Pubitemid 37231446)
25. S. Ghilardi, M. Zawadowski, Sheaves, Games and Model Completions, Vol. 14 of Trends in Logic, Kluwer Academic Publishers, 2002.
26. G. Grätzer, Universal Algebra, second ed., Springer-Verlag, Berlin, 1979.
27. J. Y. Halpern, Y. Moses, A guide to completeness and complexity for modal logics of knowledge and belief, Artificial Intelligence 54(3) (1992) 319-379.
28. W. Hodges, Model Theory, Vol. 42 of Encyclopedia of Mathematics and its Applications, Cambridge University Press, Cambridge, 1993.
29. B. Hollunder, F. Baader, Qualifying number restrictions in concept languages, in: Proceedings of the 2nd International Conference on the Principles of Knowledge Representation and Reasoning (KR'91), 1991, pp. 335-346.
30. M. Kracht, F. Wolter, Properties of independently axiomatizable bimodal logics, The Journal of Symbolic Logic 56(4) (1991) 1469-1485.
31. S. MacLane, G. Birckhoff, Algebra, MacMillan, New York, 1965.
32. U. Martin, T. Nipkow, Boolean unification-the story so far, Journal Symbolic Computation 7 (3, 4) (1989) 275-293.
33. S. McLane, Categories for the working mathematician, Springer-Verlag, Berlin, 1971.
34. G. Nelson, Combining satisfiability procedures by equality-sharing, in: W. W. Bledsoe, D. W. Loveland (Eds.), Automated Theorem Proving: After 25 Years, Vol. 29 of Contemporary Mathematics, American Mathematical Society, Providence, RI, 1984, pp. 201-211.
35. G. Nelson, D. C. Oppen, Simplification by cooperating decision procedures, ACM Transaction on Programming Languages and Systems 1(2) (1979) 245-257.
36. T. Nipkow, Combining matching algorithms: the regular case, Journal of Symbolic Computation 12(1991) 633-653.
37. D. Pigozzi, The join of equational theories, Colloquium Mathematicum 30(1) (1974) 15-25.
38. V. Pratt, Semantical considerations on Floyd-Hoare logic, in: Proceedings of the 17th Annual Symposium on Foundations of Computer Science, IEEE Computer Soc., Silver Spring, MD, 1976, pp. 109-121.
39. H. Rasiowa, An Algebraic Approach to Non-Classical Logics, Vol. 78 of Studies in Logic and the Foundations of Mathematics, North Holland, Amsterdam, 1974.
40. M. Schmidt-Schauß, Unification in a combination of arbitrary disjoint equational theories, Journal of Symbolic Computation 8 (1-2) (1989) 51-100, special issue on unification. Part II.
41. K. Segerberg, An Essay in Classical Modal Logic, Vol. 13 of Filosofiska Studier, Uppsala Universitet, 1971.
42. E. Spaan, Complexity of modal logics, Ph. D. thesis, Department of Mathematics and Computer Science, University of Amsterdam, The Netherlands, 1993.
43. S. K. Thomason, Independent propositional modal logics, Studia Logica 39(1980) 143-144.
44. E. Tidén, First-Order Unification in Combinations of Equational Theories, PhD dissertation, The Royal Institute of Technology, Stockholm, 1986.
45. C. Tinelli, C. Ringeissen, Unions of non-disjoint theories and combinations of satisfiability procedures, Theoretical Computer Science 290(1) (2003) 291-353. (Pubitemid 35264426)
46. S. Tobies, A PSPACE algorithm for graded modal logic, in: Proceedings of the 16th International Conference on Automated Deduction (CADE'99), in: H. Ganzinger (Ed.), Lecture Notes in Artificial Intelligence, vol. 1632, Springer-Verlag, Berlin, 1999, pp. 52-66.
47. W. Van der Hoek, M. de Rijke, Counting objects, Journal Logic and Computation 5(3) (1995) 325-345.
48. F. Wolter, Fusions of modal logics revisited, in: M. Kracht, M. de Rijke, H. Wansing, M. Zakharyaschev (Eds.), Advances in Modal Logic, CSLI, Stanford, CA, 1998.