-
1
-
-
85034827823
-
Modal theorem proving
-
J. H. Siekmann, editor Springer Verlag, LNCS 230
-
M. Abadi and Z. Manna. Modal theorem proving. In J. H. Siekmann, editor, CADE-8, pages 172-189. Springer Verlag, LNCS 230, 1986.
-
(1986)
CADE-8
, pp. 172-189
-
-
Abadi, M.1
Manna, Z.2
-
2
-
-
0001129020
-
Modal languages and bounded fragments of predicate logic
-
H. Andreka, I. Nemeti, and J. van Benthem. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27(3):217-274, 1998.
-
(1998)
Journal of Philosophical Logic
, vol.27
, Issue.3
, pp. 217-274
-
-
Andreka, H.1
Nemeti, I.2
Van Benthem, J.3
-
3
-
-
0010983898
-
On modal systems having arithmetical interpretations
-
A. Avron. On modal systems having arithmetical interpretations. The Journal of Symbolic Logic, 49(3):935-942, 1984.
-
(1984)
The Journal of Symbolic Logic
, vol.49
, Issue.3
, pp. 935-942
-
-
Avron, A.1
-
6
-
-
23844503541
-
The range of modal logic - An essay in memory of george gargov
-
To appear
-
J. van Benthem. The Range of Modal Logic - An Essay in Memory of George Gargov. Journal of Applied Non-Classical Logics, 1999. To appear.
-
(1999)
Journal of Applied Non-classical Logics
-
-
Van Benthem, J.1
-
9
-
-
0040977644
-
A polynomial translation of S4 into T and contraction-free tableaux for S4
-
S. Cerrito and M. Cialdea Mayer. A polynomial translation of S4 into T and contraction-free tableaux for S4. Logic Journal of the IGPL, 5(2):287-300, 1997.
-
(1997)
Logic Journal of the IGPL
, vol.5
, Issue.2
, pp. 287-300
-
-
Cerrito, S.1
Cialdea Mayer, M.2
-
11
-
-
85085784553
-
3)-time transformation from grz into decidable fragments of classical first-order logic
-
TU-Wien Technical Report E1852-GS-981
-
3)-time transformation from Grz into decidable fragments of classical first-order logic. In 2nd International Workshop on First-Order Theorem Proving, Vienna, pages 127-134. TU-Wien Technical Report E1852-GS-981, 1998.
-
(1998)
2nd International Workshop on First-order Theorem Proving, Vienna
, pp. 127-134
-
-
Demri, S.1
Goré, R.2
-
12
-
-
84867793280
-
Theoremhood preserving maps as a characterisation of cut elimination for provability logics
-
Forthcoming
-
S. Demri and R. Goré. Theoremhood preserving maps as a characterisation of cut elimination for provability logics. Technical Report, A.R.P., A.N.U., 1999. Forthcoming.
-
(1999)
Technical Report, A.R.P., A.N.U.
-
-
Demri, S.1
Goré, R.2
-
16
-
-
0012186216
-
The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems)
-
LNCS 171, Springer-Verlag
-
M. Fürer. The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems). In Logical machines: Decision problems and complexity, pages 312-319. LNCS 171, Springer-Verlag, 1981.
-
(1981)
Logical Machines: Decision Problems and Complexity
, pp. 312-319
-
-
Fürer, M.1
-
17
-
-
0001580384
-
Relations between propositional normal modal logics: An overview
-
R. Goré, W. Heinle, and A. Heuerding. Relations between propositional normal modal logics: an overview. Journal of Logic and Computation, 7(5):649-658, 1997.
-
(1997)
Journal of Logic and Computation
, vol.7
, Issue.5
, pp. 649-658
-
-
Goré, R.1
Heinle, W.2
Heuerding, A.3
-
18
-
-
84867793278
-
A resolution-based decision procedure for extensions of K4
-
Uppsala, Sweden to appear
-
H. Ganzinger, U. Hustadt, C. Meyer, and R. Schmidt. A resolution-based decision procedure for extensions of K4. In 2nd Workshop on Advances in Modal Logic (AiML'98), Uppsala, Sweden, 1998. to appear.
-
(1998)
2nd Workshop on Advances in Modal Logic (AiML'98)
-
-
Ganzinger, H.1
Hustadt, U.2
Meyer, C.3
Schmidt, R.4
-
19
-
-
0012731607
-
Cut-free sequent and tableau systems for propositional diodorian modal logics
-
R. Goré. Cut-free sequent and tableau systems for propositional Diodorian modal logics. Studia Logica, 53:433-457, 1994.
-
(1994)
Studia Logica
, vol.53
, pp. 433-457
-
-
Goré, R.1
-
20
-
-
0001919918
-
Tableaux methods for modal and temporal logics
-
M. d'Agostino, D. Gabbay, R. Hähnle, and J. Posegga, editors Kluwer, Dordrecht To appear
-
R Goré. Tableaux methods for modal and temporal logics. In M. d'Agostino, D. Gabbay, R. Hähnle, and J. Posegga, editors, Handbook of Tableaux Methods. Kluwer, Dordrecht, 1999. To appear.
-
(1999)
Handbook of Tableaux Methods
-
-
Goré, R.1
-
22
-
-
84896517425
-
Improved decision procedures for the modal logics K, T and S4
-
H. Buning, editor LNCS 1092, Springer-Verlag
-
J. Hudelmaier. Improved decision procedures for the modal logics K, T and S4. In H. Buning, editor, Computer Science Logic (CSL'95), pages 320-334. LNCS 1092, Springer-Verlag, 1996.
-
(1996)
Computer Science Logic (CSL'95)
, pp. 320-334
-
-
Hudelmaier, J.1
-
23
-
-
0000595575
-
The computational complexity of provability in systems of modal propositional logic
-
R. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal of Computing, 6(3):467-480, 1977.
-
(1977)
SIAM Journal of Computing
, vol.6
, Issue.3
, pp. 467-480
-
-
Ladner, R.1
-
24
-
-
0000195160
-
Complexity results for classes of quantificational formulas
-
H. Lewis. Complexity results for classes of quantificational formulas. Journal of Computer and System Sciences, 21:317-353, 1980.
-
(1980)
Journal of Computer and System Sciences
, vol.21
, pp. 317-353
-
-
Lewis, H.1
-
25
-
-
0001110606
-
Gentzen-type and resolution rules Part I: Propositional logic
-
P. Martin-Löf and G. Mints, editors Springer Verlag, LNCS 417
-
G. Mints. Gentzen-type and resolution rules part I: propositional logic. In P. Martin-Löf and G. Mints, editors, International Conference on Computer Logic, Tallinn, pages 198-231. Springer Verlag, LNCS 417, 1988.
-
(1988)
International Conference on Computer Logic, Tallinn
, pp. 198-231
-
-
Mints, G.1
-
27
-
-
0016984007
-
Methods for automated theorem proving in non classical logics
-
Ch. Morgan. Methods for automated theorem proving in non classical logics. IEEE Transactions on Computers, 25(8):852-862, 1976.
-
(1976)
IEEE Transactions on Computers
, vol.25
, Issue.8
, pp. 852-862
-
-
Morgan, Ch.1
-
28
-
-
84957065878
-
A resolution decision procedure for the guarded fragment
-
C. Kirchner and H. Kirchner, editors Lindau, Germany LNAI 1421, Springer-Verlag
-
H. de Nivelle. A resolution decision procedure for the guarded fragment. In C. Kirchner and H. Kirchner, editors, CADE-15, Lindau, Germany, pages 191-204. LNAI 1421, Springer-Verlag, 1998.
-
(1998)
CADE-15
, pp. 191-204
-
-
De Nivelle, H.1
-
29
-
-
84957685576
-
Resolution-based calculi for modal and temporal logics
-
M. McRobbie and J. Slaney, editors LNAI 1104, Springer-Verlag
-
A. Nonnengart. Resolution-based calculi for modal and temporal logics. In M. McRobbie and J. Slaney, editors, CADE-13, pages 599-612. LNAI 1104, Springer-Verlag, 1996.
-
(1996)
CADE-13
, pp. 599-612
-
-
Nonnengart, A.1
-
31
-
-
85028475068
-
Optimized translation of multi modal logic into predicate logic
-
A. Voronkov, editor Springer-Verlag, LNAI 698
-
H.J. Ohlbach. Optimized translation of multi modal logic into predicate logic. In A. Voronkov, editor, LPAR'93, pages 253-264. Springer-Verlag, LNAI 698, 1993.
-
(1993)
LPAR'93
, pp. 253-264
-
-
Ohlbach, H.J.1
-
32
-
-
84957079445
-
Combining hilbert style and semantic reasoning in a resolution framework
-
C. Kirchner and H. Kirchner, editors Lindau, Germany LNAI 1421, Springer-Verlag
-
H. J. Ohlbach. Combining Hilbert style and semantic reasoning in a resolution framework. In C. Kirchner and H. Kirchner, editors, CADE-15, Lindau, Germany, pages 205-219. LNAI 1421, Springer-Verlag, 1998.
-
(1998)
CADE-15
, pp. 205-219
-
-
Ohlbach, H.J.1
-
37
-
-
51249190137
-
Provability interpretations of modal logics
-
R. Solovay. Provability interpretations of modal logics. Israel Journal of Mathematics, 25:287-304, 1976.
-
(1976)
Israel Journal of Mathematics
, vol.25
, pp. 287-304
-
-
Solovay, R.1
|