A comprehensive framework for combined decision procedures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3717 LNAI, Issue , 2005, Pages 1-30

  Ghilardi, Silvio ^a   Nicolini, Enrica ^b   Zucchelli, Daniele ^a  

^a Dipartimento di Scienze dell'Informazionen   (Italy)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ISOMORPHISM THEOREM; MONODIC FRAGMENTS; NELSON-OPPEN SCHEMA; NOETHERIANITY CONDITIONS;

CONSTRAINT THEORY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; THEOREM PROVING;

DECISION THEORY;

EID: 33646172114     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11559306_1     Document Type: Conference Paper

References (33)

1. H. Andréka, I. Nemeti, and J. VanBenthem. Modal languages and bounded fragments of predicate logics. Journal of Philosophical Logic, 27:217-274, 1998.
2. Peter B. Andrews. An introduction to mathematical logic and type theory: to truth through proof, volume 27 of Applied Logic Series. Kluwer Acad. Publ., 2002.
3. Peter B. Andrews. Classical type theory. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume II, pages 966-1007. Elsevier/MIT, 2001.
4. Franz Baader and Silvio Ghilardi. Connecting many-sorted theories. In Proceedings of the 20th International Conference on Automated Deduction (CADE-05), Lecture Notes in Artificial Intelligence, 2005.
5. Franz Baader and Silvio Ghilardi. Connecting many-sorted structures and theories through adjoint functions. In Proceedings of the 5th International Workshop on Frontiers of Combining Systems (FROCOS-05), Lecture Notes in Artificial Intelligence, 2005.
6. Franz Baader and Tobias Nipkow. Term rewriting and all that. Cambridge University Press, Cambridge, 1998.
7. Franz Baader and Cesare Tinelli. Deciding the word problem in the union of equational theories. Information and Computation, 178(2):346-390, December 2002.
8. Franz Baader, Silvio Ghilardi, and Cesare Tinelli. A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. Information and Computation, (to appear).
9. Franz Baader, Carsten Lutz, Holger Sturm, and Frank Wolter. Fusions of description logics and abstract description systems. Journal of Artificial Intelligence Research, 16:1-58, 2002.
10. Egon Börger, Erich Grädel, and Yuri Gurevich. The classical decision problem. Universitext. Springer-Verlag, Berlin, 2001.
11. Chen-Chung Chang and H. Jerome Keisler. Model Theory. North-Holland, Amsterdam-London, IIIrd edition, 1990.
12. G. Dowek. Higher order unification and matching. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume II, pages 1009-1062. Elsevier/MIT, 2001.
13. C. Fermüller, A. Leitsch, T. Tammet, and N. Zamov. Resolution methods for the decision problem, volume 679 of Lecture Notes in Computer Science. Springer-Verlag, 1993. Lecture Notes in Artificial Intelligence.
14. D. M. Gabbay and V.B. Shehtman. Undecidability of modal and intermediate first-order logics with two individual variables. Journal of Symbolic Logic, 58:800-823, 1993.
15. D.M. Gabbay, A. Kurucz, F. Wolter, and M. Zakharyaschev. Many-Dimensional Modal Logics: Theory and Applications, volume 148 of Studies in Logic and the Foundations of Mathematics. Elsevier, 2003.
16. Silvio Ghilardi. Model theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning, 33(3-3):221-249, 2005.
17. Silvio Ghilardi, Enrica Nicolini, and Daniele Zucchelli. A comprehensive framework for combined decision procedures. Technical Report 304-05, Dipartimento di Scienze dellInformazione, Università degli Studi di Milano, 2005. URL http://homes.dsi.unimi.it/ghilardi/allegati/frocos05.zip.
18. E. Grädel. Decision procedures for guarded logics. In Proceedings of CADE-16, volume 1632 of Lecture Notes in Computer Science, pages 31-51. Springer, 1999.
19. R. Kontchakov, A. Kurucz, and M. Zakharyaschev. Undecidability of first-order intuituionistic and modal logics with two variables. 2004. manuscript.
20. S. Kripke. The undecidability of monadic modal quantificational theory. Z. Math. Logik Grundlag. Math., 8:113-116, 1962.
21. J. Lambek and P. J. Scott. Introduction to higher order categorical logic, volume 7 of Cambridge Studies in Advanced Mathematics.
22. L. Löwhenheim. Über Möglichkeiten im Relativkalkül. Math. Annalen, 76:228-251, 1915.
23. M. Marx. Tolerance logic. Journal of Logic, Language and Information, 10:353-374, 2001.
24. M. Mortimer. On languages with two variables. Z. Math. Logik Grundlag. Math., 21:135-140, 1975.
25. Greg Nelson and Derek C. Oppen. Simplification by cooperating decision procedures. ACM Trans. on Programming Languages and Systems, 1(2):245-257, October 1979.
26. Derek C. Oppen. Complexity, convexity and combinations of theories. Theoretical Computer Science, 12:291-302, 1980.
27. D. Scott. A decision method for for validity of sentences in two variables. Journal of Symbolic Logic, 27:477, 1962.
28. K. Segerberg. Two-dimensional modal logic. Journal of Philosophical Logic, 2: 77-96, 1973.
29. V.B. Shehtman. On some two-dimensional modal logics. In 8th Congress on Logic Methodology and Philosophy of Science, vol. 1, pages 326-330. Nauka, Moskow, 1987.
30. Cesare Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning, 30(1):1-31, 2003.
31. Cesare Tinelli and Mehdi T. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In Proc. of the 1st Int. Workshop on Frontiers of Combining Systems, pages 103-120. Kluwer Acad. Publ., 1996.
32. F. Wolter and M. Zakharyaschev. Decidable fragments of first-order modal logics. Journal of Symbolic Logic, 66:1415-1438, 2001.
33. Frank Wolter. Fusions of modal logics revisited. In M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors, Advances in Modal Logic. CSLI, Stanford, CA, 1998.