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

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3097, Issue , 2004, Pages 183-197

  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

ALGORITHMS; BOOLEAN ALGEBRA; DECISION MAKING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; AUTOMATION; COMPUTABILITY AND DECIDABILITY; DECISION THEORY; FORMAL LOGIC; THEOREM PROVING;

EQUATIONAL THEORIES; LOGICAL THEORY; NELSON-OPPEN COMBINATION PROCEDURE; NON-DISJOINT SIGNATURES; COMBINATION PROCEDURE; DECISION PROCEDURE; EQUATIONAL THEORY; MODAL LOGIC; NEW APPROACHES; WORD PROBLEM;

DECISION THEORY; COMPUTATION THEORY;

EID: 9444243358     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-25984-8_11     Document Type: Conference Paper

References (25)

1. F. Baader, H.-J. Bürckert, B. Nebel, W. Nutt, and G. Smolka. On the expressivity of feature logics with negation, functional uncertainty, and sort equations. J. of Logic, Language and Information, 2:1-18, 1993.
2. F. Baader, S. Ghilardi, and C. Tinelli. A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. Technical Report 03-03, Department of Computer Science, The University of Iowa, December 2003.
3. F. Baader and P. Hanschke. Extensions of concept languages for a mechanical engineering application. In Proc. of the 16th German Workshop on Artificial Intelligence (GWAI'98), volume 671 of Lecture Notes in Computer Science, pages 132-143, Bonn (Germany), 1992. Springer-Verlag.
4. F. Baader, C. Lutz, H. Sturm, and F. Wolter. Fusions of description logics and abstract description systems. Journal of Artificial Intelligence Research, 16:1-58, 2002.
5. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, United Kingdom, 1998.
6. F. Baader and C. Tinelli. A new approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method. In W. McCune, editor, Proceedings of the 14th International Conference on Automated Deduction (Townsville, Australia), volume 1249 of Lecture Notes in Artificial Intelligence, pages 19-33. Springer-Verlag, 1997.
7. F. Baader and C. Tinelli. Deciding the word problem in the union of equational theories. Information and Computation, 178(2):346-390, December 2002.
8. A. Chagrov and M. Zakharyaschev. Modal Logic, volume 35 of Oxford Logic Guides. Clarendon Press, Oxford, 1997.
9. C.-C. Chang and H. J. Keisler. Model Theory. North-Holland, Amsterdam-London, IIIrd edition, 1990.
10. B. F. Chellas. Modal Logic, an Introduction. Cambridge University Press, Cam-bridge, 1980.
11. E. Domenjoud, F. Klay, and C. Ringeissen. Combination techniques for non-disjoint equational theories. In A. Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction, Nancy (France), volume 814 of Lecture Notes in Artificial Intelligence, pages 267-281. Springer-Verlag, 1994.
12. Camillo Fiorentini and S. Ghilardi. Combining word problems through rewriting in categories with products. Theoretical Computer Science, 294:103-149, 2003.
13. S. Ghilardi. Model Theoretic Methods in Combined Constraint Satisfiability. Journal of Automated Reasoning, 2004. To appear.
14. S. Ghilardi and L. Santocanale. Algebraic and model theoretic techniques for fusion decidability in modal logics. In Moshe Vardi and Andrei Voronkov, editors, Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2003), volume 2850 of Lecture Notes in Computer Science, pages 152-166. Springer-Verlag, 2003.
15. M. Kracht and F. Wolter. Properties of independently axiomatizable bimodal logics, The Journal of Symbolic Logic, 56(4):1469-1485, December 1991.
16. G. Nelson. Combining satisfiability procedures by equality-sharing. In W. W. Bledsoe and D. W. Loveland, editors, Automated Theorem Proving: After 25 Years, volume 29 of Contemporary Mathematics, pages 201-211. American Mathematical Society, Providence, RI, 1984.
17. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Trans. on Programming Languages and Systems, 1(2);245-257, October 1979.
18. T. Nipkow. Combining matching algorithms: The regular case. Journal of Symbolic Computation, 12:633-653, 1991.
19. D. Pigozzi. The join of equational theories. Colloquium Mathematicum, 30(1):15-25, 1974.
20. H. Rasiowa. An Algebraic Approach to Non-Classical Logics, volume 78 of Studies in Logic and the Foundations of Mathematics. North Holland, Amsterdam, 1974.
21. M. Schmidt-Schauß. Unification in a combination of arbitrary disjoint equational theories. Journal of Symbolic Computation, 8(1-2):51-100, July/August 1989. Special issue on unification. Part II.
22. K. Segerberg. An Essay in Classical Modal Logic, volume 13 of Filosofiska Studier. Uppsala Universitet, 1971.
23. E. Spaan. Complexity of Modal Logics. PhD thesis, Department of Mathematics and Computer Science, University of Amsterdam, The Netherlands, 1993.
24. C. Tinelli and C. Ringeissen. Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science, 290(1):291-353, 2003.
25. F. Wolter. Fusions of modal logics revisited. In M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors, Advances in Modal Logic. CSLI, 1998.