-
3
-
-
77952047132
-
A temporal description logic for reasoning over conceptual schemas and queries
-
LNCS, Springer, Berlin
-
A. Artale, E. Franconi, F. Wolter, M. Zakharyaschev, A temporal description logic for reasoning over conceptual schemas and queries, in: Proceedings of JELIA 2002, vol. 2424, LNCS, Springer, Berlin, 2002, pp. 98-110
-
(2002)
Proceedings of JELIA 2002
, vol.2424
, pp. 98-110
-
-
Artale, A.1
Franconi, E.2
Wolter, F.3
Zakharyaschev, M.4
-
4
-
-
0009858375
-
Resolution theorem proving
-
A. Robinson A. Voronkov Elsevier Amsterdam
-
L. Bachmair, and H. Ganzinger Resolution theorem proving A. Robinson A. Voronkov Handbook of Automated Reasoning 2001 Elsevier Amsterdam 19 99 (Chapter 2)
-
(2001)
Handbook of Automated Reasoning
, pp. 19-99
-
-
Bachmair, L.1
Ganzinger, H.2
-
7
-
-
22044442325
-
Monodic temporal resolution
-
in press. Preliminary version available as Technical Report ULCS-03-001, The University of Liverpool
-
A. Degtyarev, M. Fisher, B. Konev, Monodic temporal resolution, ACM Transactions on Computational Logic, in press. Preliminary version available as Technical Report ULCS-03-001, The University of Liverpool, http://www.csc.liv. ac.uk/research
-
ACM Transactions on Computational Logic
-
-
Degtyarev, A.1
Fisher, M.2
Konev, B.3
-
8
-
-
84974739759
-
Towards first-order temporal resolution
-
LNCS, Springer, Berlin
-
A. Degtyarev, M. Fisher, Towards first-order temporal resolution, in: Proceedings of KI 2001, vol. 2174, LNCS, Springer, Berlin, 2001, pp. 18-32
-
(2001)
Proceedings of KI 2001
, vol.2174
, pp. 18-32
-
-
Degtyarev, A.1
Fisher, M.2
-
9
-
-
9444242316
-
Equality and monodic first-order temporal logic
-
A. Degtyarev, M. Fisher, and A. Lisitsa Equality and monodic first-order temporal logic Studia Logica 72 2 2002 147 156
-
(2002)
Studia Logica
, vol.72
, Issue.2
, pp. 147-156
-
-
Degtyarev, A.1
Fisher, M.2
Lisitsa, A.3
-
11
-
-
20144368058
-
Using Otter for temporal resolution
-
Kluwer Dordrecht
-
C. Dixon Using Otter for temporal resolution Advances in Temporal Logic 2000 Kluwer Dordrecht 149 166
-
(2000)
Advances in Temporal Logic
, pp. 149-166
-
-
Dixon, C.1
-
12
-
-
20144377517
-
Miss Scarlett in the ballroom with the lead piping
-
IOS Press
-
C. Dixon, Miss Scarlett in the Ballroom with the Lead Piping, in: Proceedings of ECAI 2004, IOS Press, 2004
-
(2004)
Proceedings of ECAI 2004
-
-
Dixon, C.1
-
14
-
-
5644231064
-
Using temporal logics of knowledge in the formal verification of security protocols
-
IEEE Computer Society Press, Silver Spring, MD
-
C. Dixon, M.-C.F. Gago, M. Fisher, W. van der Hoek, Using temporal logics of knowledge in the formal verification of security protocols, in: Proceedings of TIME 2004, IEEE Computer Society Press, Silver Spring, MD, 2004, pp. 148-151
-
(2004)
Proceedings of TIME 2004
, pp. 148-151
-
-
Dixon, C.1
Gago, M.-C.F.2
Fisher, M.3
Van Der Hoek, W.4
-
15
-
-
0001449325
-
Temporal and modal logic
-
J. van Leeuwen Elsevier Amsterdam
-
E.A. Emerson Temporal and modal logic J. van Leeuwen Handbook of Theoretical Computer Science 1990 Elsevier Amsterdam 997 1072 (Chapter 16)
-
(1990)
Handbook of Theoretical Computer Science
, pp. 997-1072
-
-
Emerson, E.A.1
-
17
-
-
0002612248
-
Resolution decision procedures
-
A. Robinson, A. Voronkov (Eds.) Elsevier, Amsterdam Chapter 25
-
C. Fermüller, A. Leitsch, U. Hustadt, T. Tammet, Resolution decision procedures, in: A. Robinson, A. Voronkov (Eds.), Handbook of Automated Reasoning, vol. 2, Elsevier, Amsterdam, 2001, pp. 1791-1850 (Chapter 25)
-
(2001)
Handbook of Automated Reasoning
, vol.2
, pp. 1791-1850
-
-
Fermüller, C.1
Leitsch, A.2
Hustadt, U.3
Tammet, T.4
-
18
-
-
0030100531
-
An introduction to executable temporal logics
-
M. Fisher An introduction to executable temporal logics Knowledge Engineering Review 11 1 1996 43 56
-
(1996)
Knowledge Engineering Review
, vol.11
, Issue.1
, pp. 43-56
-
-
Fisher, M.1
-
19
-
-
0030295478
-
A temporal semantics for concurrent metatem
-
M. Fisher A temporal semantics for concurrent metatem Journal of Symbolic Computation 22 5/6 1997 627 648
-
(1997)
Journal of Symbolic Computation
, vol.22
, Issue.56
, pp. 627-648
-
-
Fisher, M.1
-
20
-
-
0001765029
-
A normal form for temporal logics and its applications in theorem proving and execution
-
M. Fisher A normal form for temporal logics and its applications in theorem proving and execution Journal of Logic and Computation 7 4 1997 429 456
-
(1997)
Journal of Logic and Computation
, vol.7
, Issue.4
, pp. 429-456
-
-
Fisher, M.1
-
22
-
-
20144383669
-
Deductive verification of cache coherence protocols
-
Technical Report DSSE-TR-2003-2, University of Southampton
-
M. Fisher, A. Lisitsa, Deductive verification of cache coherence protocols, in: Proceedings of 3rd International Workshop on Automated Verification of Critical Systems (AVoCS 2003), Technical Report DSSE-TR-2003-2, University of Southampton, 2003, pp. 177-186
-
(2003)
Proceedings of 3rd International Workshop on Automated Verification of Critical Systems (AVoCS 2003)
, pp. 177-186
-
-
Fisher, M.1
Lisitsa, A.2
-
23
-
-
20144382819
-
Temporal deductive verification of cache coherence protocols
-
The University of Liverpool
-
M. Fisher, A. Lisitsa, Temporal deductive verification of cache coherence protocols, Technical Report ULCS-03-024, The University of Liverpool, http://www.csc.liv.ac.uk/research
-
Technical Report
, vol.ULCS-03-024
-
-
Fisher, M.1
Lisitsa, A.2
-
24
-
-
33646891858
-
Monodic ASMs and temporal verification
-
LNCS, Springer, Berlin
-
M. Fisher, A. Lisitsa, Monodic ASMs and temporal verification, in: Proceedings ASM 2004, vol. 3065, LNCS, Springer, Berlin, 2004, pp. 95-110
-
(2004)
Proceedings ASM 2004
, vol.3065
, pp. 95-110
-
-
Fisher, M.1
Lisitsa, A.2
-
28
-
-
9444266012
-
On the computational complexity of spatio-temporal logics
-
AAAI Press
-
D. Gabelaia, R. Kontchakov, A. Kurucz, F. Wolter, and M. Zakharyaschev On the computational complexity of spatio-temporal logics Proceedings of FLAIRS 2003 2003 AAAI Press 460 464
-
(2003)
Proceedings of FLAIRS 2003
, pp. 460-464
-
-
Gabelaia, D.1
Kontchakov, R.2
Kurucz, A.3
Wolter, F.4
Zakharyaschev, M.5
-
29
-
-
0034858512
-
Logician in the land of OS: Abstract State Machines at Microsoft
-
IEEE Computer Society Silver Spring, MD
-
Y. Gurevich Logician in the land of OS: Abstract State Machines at Microsoft Proceedings of LICS 2001 2001 IEEE Computer Society Silver Spring, MD 129 136
-
(2001)
Proceedings of LICS 2001
, pp. 129-136
-
-
Gurevich, Y.1
-
30
-
-
1342319529
-
Monodic packed fragment with equality is decidable
-
I. Hodkinson Monodic packed fragment with equality is decidable Studia Logica 72 2002 185 197
-
(2002)
Studia Logica
, vol.72
, pp. 185-197
-
-
Hodkinson, I.1
-
34
-
-
9444227097
-
TeMP: A temporal monodic prover
-
LNAI, Springer, Berlin
-
U. Hustadt, B. Konev, A. Riazanov, A. Voronkov, TeMP: A temporal monodic prover, in: Proceedings IJCAR 2004, vol. 3097, LNAI, Springer, Berlin, 2004, pp. 326-330
-
(2004)
Proceedings IJCAR 2004
, vol.3097
, pp. 326-330
-
-
Hustadt, U.1
Konev, B.2
Riazanov, A.3
Voronkov, A.4
-
35
-
-
9444237474
-
Temporalising tableaux
-
R. Kontchakov, C. Lutz, F. Wolter, and M. Zakharyaschev Temporalising tableaux Studia Logica 76 1 2004 91 134
-
(2004)
Studia Logica
, vol.76
, Issue.1
, pp. 91-134
-
-
Kontchakov, R.1
Lutz, C.2
Wolter, F.3
Zakharyaschev, M.4
-
39
-
-
0011040511
-
Decidability and incompleteness results for first-order temporal logic of linear time
-
S. Merz Decidability and incompleteness results for first-order temporal logic of linear time Journal of Applied Non-Classical Logics 2 1992 139 156
-
(1992)
Journal of Applied Non-Classical Logics
, vol.2
, pp. 139-156
-
-
Merz, S.1
-
40
-
-
0000330818
-
Theorem proving with ordering and equality constrained clauses
-
R. Nieuwenhuis, and A. Rubio Theorem proving with ordering and equality constrained clauses Journal of Symbolic Computation 19 4 1995 321 351
-
(1995)
Journal of Symbolic Computation
, vol.19
, Issue.4
, pp. 321-351
-
-
Nieuwenhuis, R.1
Rubio, A.2
-
41
-
-
0000872752
-
Paramodulation-based theorem proving
-
A. Robinson A. Voronkov Elsevier Amsterdam
-
R. Nieuwenhuis, and A. Rubio Paramodulation-based theorem proving A. Robinson A. Voronkov Handbook of Automated Reasoning 2001 Elsevier Amsterdam 371 443 (Chapter 7)
-
(2001)
Handbook of Automated Reasoning
, pp. 371-443
-
-
Nieuwenhuis, R.1
Rubio, A.2
-
42
-
-
15544368828
-
Computing small clause normal forms
-
A. Robinson A. Voronkov Elsevier Amsterdam
-
A. Nonnengart, and C. Weidenbach Computing small clause normal forms A. Robinson A. Voronkov Handbook of Automated Reasoning 2001 Elsevier Amsterdam 335 370 (Chapter 6)
-
(2001)
Handbook of Automated Reasoning
, pp. 335-370
-
-
Nonnengart, A.1
Weidenbach, C.2
-
46
-
-
0036327027
-
The design and implementation of Vampire
-
A. Riazanov, and A. Voronkov The design and implementation of Vampire AI Communications 15 2-3 2002 91 110
-
(2002)
AI Communications
, vol.15
, Issue.2-3
, pp. 91-110
-
-
Riazanov, A.1
Voronkov, A.2
-
47
-
-
7044238419
-
A principle for incorporating axioms into the first-order translation of modal formulae
-
LNAI, Springer, Berlin
-
R.A. Schmidt, U. Hustadt, A principle for incorporating axioms into the first-order translation of modal formulae, in: Proceedings of CADE-19, vol. 2741, LNAI, Springer, Berlin, 2003, pp. 412-426
-
(2003)
Proceedings of CADE-19
, vol.2741
, pp. 412-426
-
-
Schmidt, R.A.1
Hustadt, U.2
-
49
-
-
38249043285
-
Concerning the semantic consequence relation in first-order temporal logic
-
A. Szalas Concerning the semantic consequence relation in first-order temporal logic Theoretical Computer Science 47 1986 329 334
-
(1986)
Theoretical Computer Science
, vol.47
, pp. 329-334
-
-
Szalas, A.1
-
50
-
-
0024016465
-
Incompleteness of first-order temporal logic with until
-
A. Szalas, and L. Holenderski Incompleteness of first-order temporal logic with until Theoretical Computer Science 57 1988 317 325
-
(1988)
Theoretical Computer Science
, vol.57
, pp. 317-325
-
-
Szalas, A.1
Holenderski, L.2
-
51
-
-
0003915516
-
-
Benjamin/Cummings, Menlo Park, CA
-
A. Tansel (Ed.), Temporal Databases: Theory, Design, and Implementation, Benjamin/Cummings, Menlo Park, CA, 1993
-
(1993)
Temporal Databases: Theory, Design, and Implementation
-
-
Tansel, A.1
-
52
-
-
0001340960
-
On the complexity of derivations in propositional calculus
-
J. Siekmann, G. Wrightson (Eds.) Springer, Berlin original paper (in Russian) appeared in 1968
-
G. Tseitin, On the complexity of derivations in propositional calculus, in: J. Siekmann, G. Wrightson (Eds.), Automation of Reasoning (Classical Papers on Computational Logic), vol. 2, Springer, Berlin, 1983, pp. 466-483 (original paper (in Russian) appeared in 1968)
-
(1983)
Automation of Reasoning (Classical Papers on Computational Logic)
, vol.2
, pp. 466-483
-
-
Tseitin, G.1
-
54
-
-
0035629553
-
Decidable fragments of first-order modal logics
-
F. Wolter, and M. Zakharyaschev Decidable fragments of first-order modal logics Journal of Symbolic Logic 66 2001 1415 1438
-
(2001)
Journal of Symbolic Logic
, vol.66
, pp. 1415-1438
-
-
Wolter, F.1
Zakharyaschev, M.2
-
55
-
-
0005468763
-
Qualitative spatio-temporal representation and reasoning: A computational perspective
-
Morgan Kaufmann Los Altos, CA
-
F. Wolter, and M. Zakharyaschev Qualitative spatio-temporal representation and reasoning: a computational perspective Exploring Artificial Intelligence in the New Millenium 2002 Morgan Kaufmann Los Altos, CA 175 216
-
(2002)
Exploring Artificial Intelligence in the New Millenium
, pp. 175-216
-
-
Wolter, F.1
Zakharyaschev, M.2
-
56
-
-
0036885383
-
Axiomatizing the monodic fragment of first-order temporal logic
-
F. Wolter, and M. Zakharyaschev Axiomatizing the monodic fragment of first-order temporal logic Annals of Pure and Applied logic 118 2002 133 145
-
(2002)
Annals of Pure and Applied Logic
, vol.118
, pp. 133-145
-
-
Wolter, F.1
Zakharyaschev, M.2
|