Maslov’s class K revisited

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

Volumn 1632, Issue , 1999, Pages 172-186

  Hustadt, Ullrich ^a   Schmidt, Renate A ^a  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION;

THEOREM PROVING;

EID: 84957640460     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48660-7_12     Document Type: Conference Paper

References (15)

1. L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217-247, 1994.
2. L. Bachmair and H. Ganzinger. A theory of resolution. Research report MPI-I-97-2- 005, Max-Planck-Institut fur Informatik, Saarbrucken, Germany, 1997. To appear in J. A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning.
3. H. de Nivelle. Ordering Refinements of Resolution. PhD thesis, Technische Universiteit Delft, The Netherlands, October 1996.
4. C. Fermuller, A. Leitsch, T. Tammet, and N. Zamov. Resolution Method for the Decicion Problem, volume 679 of LNCS. Springer, 1993.
5. C. Fermuller and G. Salzer. Ordered paramodulation and resolution as decision procedures. In Proc. LPAR’93, volume 698 of LNAI, pages 122-133. Springer, 1993.
6. H. Ganzinger and H. de Nivelle. A superposition decision procedure for the guarded fragment with equality. To appear in Proc. LICS’99. IEEE Computer Soc. Press, 1999.
7. H. Ganzinger, U. Hustadt, C. Meyer, and R. A. Schmidt. A resolution-based decision procedure for extensions of K4. To appear in Advances in Modal Logic, Volume 2. CLSI Publications, 1999.
8. H. Ganzinger, C. Meyer, and M. Veanes. The two-variable guarded fragment with transitive relations. To appear in Proc. LICS’99. IEEE Computer Soc. Press, 1999.
9. G. Gargov and S. Passy. A note on Boolean modal logic. In P. P. Petkov, editor, Mathematical Logic: Proceedings of the 1988 Heyting Summerschool, pages 299-309, New York, 1990. Plenum Press.
10. W. D. Goldfarb. The unsolvability of the Godel class with identity. Journal of Symbolic Logic, 49:1237-1252, 1984.
11. U. Hustadt and R. A. Schmidt. Issues of decidability for description logics in the framework of resolution. To appear in R. Caferra and G. Salzer, editors, Proc. FTP’98, LNAI. Springer, 1999.
12. D. G. Kuehner. A note on the relation between resolution and Maslov’s inverse method. In B. Meltzer and D. Michie, editors, Machine Intelligence 6, chapter 5, pages 73-76. Edinburgh University Press, 1971.
13. S. Ju. Maslov. The inverse method for establishing deducibility for logical calculi. In V. P. Orevkov, editor, The Calculi of Symbolic Logic I: Proceedings of the Steklov Institute of Mathematics edited by I.G. Petrovskii and S. M. Nikol’skii, number 98 (1968), pages 25-96. American Mathematical Soc., 1971.
14. M. Mortimer. On languages with two variables. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik, 21:135-140, 1975.
15. C. Weidenbach. Minimal resolution. Research report MPI-I-94-227, Max-Planck- Institut fur Informatik, Saarbrucken, Germany, 1994