 | 2009 |
|---|
| 31 |       | Mark Reynolds:
A Tableau for CTL.
FM 2009: 403-418 |
| 2008 |
|---|
| 30 | | David J. Montana,
Mark Reynolds:
Validation Algorithms for a Secure Internet Routing PKI.
EuroPKI 2008: 17-30 |
| 2007 |
|---|
| 29 |  | Kaile Su,
Abdul Sattar,
Han Lin,
Mark Reynolds:
A Modal Logic for Beliefs and Pro Attitudes.
AAAI 2007: 496-501 |
| 28 | | Majigsuren Enkhsaikhan,
Wilson Wong,
Wei Liu,
Mark Reynolds:
Measuring Data-Driven Ontology Changes using Text Mining.
AusDM 2007: 39-46 |
| 27 | | Tim French,
John C. McCabe-Dansted,
Mark Reynolds:
A Temporal Logic of Robustness.
FroCos 2007: 193-205 |
| 26 | | Mark Reynolds:
A Tableau for Bundled CTL.
J. Log. Comput. 17(1): 117-132 (2007) |
| 2006 |
|---|
| 25 | | Xiangyu Luo,
Kaile Su,
Abdul Sattar,
Mark Reynolds:
Verification of Multi-agent Systems Via Bounded Model Checking.
Australian Conference on Artificial Intelligence 2006: 69-78 |
| 24 | | Rachel Cardell-Oliver,
Mark Reynolds,
Mark Kranz:
A Space and Time Requirements Logic for Sensor Networks.
ISoLA 2006: 283-289 |
| 23 | | Mark Reynolds,
Abdul Sattar:
Editors' introduction.
J. Applied Logic 4(2): 117-118 (2006) |
| 2005 |
|---|
| 22 | | Renate A. Schmidt,
Ian Pratt-Hartmann,
Mark Reynolds,
Heinrich Wansing:
Advances in Modal Logic 5, papers from the fifth conference on "Advances in Modal logic," held in Manchester (UK) in September 2004
King's College Publications 2005 |
| 21 | | Mark Reynolds:
Towards a CTL* Tableau.
FSTTCS 2005: 384-395 |
| 20 | | Ian M. Hodkinson,
Mark Reynolds:
Separation - Past, Present, and Future.
We Will Show Them! (2) 2005: 117-142 |
| 19 | | Mark Reynolds:
An axiomatization of PCTL*.
Inf. Comput. 201(1): 72-119 (2005) |
| 2004 |
|---|
| 18 | | Tim French,
Ron van der Meyden,
Mark Reynolds:
Axioms for Logics of Knowledge and Past Time: Synchrony and Unique Initial States.
Advances in Modal Logic 2004: 53-72 |
| 17 | | April Krukowski,
Mark Reynolds:
Students as service champions: a success story.
SIGUCCS 2004: 284-288 |
| 2003 |
|---|
| 16 | | Mark Reynolds:
The complexity of the temporal logic with "until" over general linear time.
J. Comput. Syst. Sci. 66(2): 393-426 (2003) |
| 2002 |
|---|
| 15 | | Tim French,
Mark Reynolds:
A Sound and Complete Proof System for QPTL.
Advances in Modal Logic 2002: 127-148 |
| 14 | | Mark Reynolds:
Axioms for Branching Time.
J. Log. Comput. 12(4): 679-697 (2002) |
| 2001 |
|---|
| 13 | | Mark Reynolds:
Continuous Temporal Models.
Australian Joint Conference on Artificial Intelligence 2001: 414-425 |
| 12 | | Mark Reynolds,
Michael Zakharyaschev:
On the Products of Linear Modal Logics.
J. Log. Comput. 11(6): 909-931 (2001) |
| 11 | | Mark Reynolds:
An Axiomatization of Full Computation Tree Logic.
J. Symb. Log. 66(3): 1011-1057 (2001) |
| 2000 |
|---|
| 10 | | Mark Reynolds:
More Past Glories.
LICS 2000: 229-240 |
| 9 | | Maarten Marx,
Szabolcs Mikulás,
Mark Reynolds:
The Mosaic Method for Temporal Logics.
TABLEAUX 2000: 324-340 |
| 1999 |
|---|
| 8 | | Maarten Marx,
Mark Reynolds:
Undecidability of Compass Logic.
J. Log. Comput. 9(6): 897-914 (1999) |
| 7 | | Alberto Zanardo,
Bruno Barcellan,
Mark Reynolds:
Non-Definability of the Class of Complete Bundled Trees.
Logic Journal of the IGPL 7(1): 125-136 (1999) |
| 1997 |
|---|
| 6 | | Mark Reynolds:
A Decidable Temporal Logic of Parallelism.
Notre Dame Journal of Formal Logic 38(3): 419-436 (1997) |
| 1996 |
|---|
| 5 | | Howard Barringer,
Graham Gough,
Derek Brough,
Dov M. Gabbay,
Ian M. Hodkinson,
Anthony Hunter,
Richard Owens,
Peter McBrien,
Mark Reynolds,
Michael Fisher:
Languages, Meta-languages and METATEM, A Discussion Paper.
Logic Journal of the IGPL 4(2): 255-272 (1996) |
| 4 | | Mark Reynolds:
Axiomatising first-order temporal logic: until and since over linear time.
Studia Logica 57(2/3): 279-302 (1996) |
| 1994 |
|---|
| 3 | | Mark Reynolds:
Axiomatizing U and S over Integer Time.
ICTL 1994: 117-132 |
| 1993 |
|---|
| 2 | | Mark Reynolds:
Towards First-Order Concurrent METATEM.
Executable Modal and Temporal Logics 1993: 118-143 |
| 1992 |
|---|
| 1 | | Mark Reynolds:
An Axiomatization for Until and Since over the Reals without the IRR Rule.
Studia Logica 51(2): 165-193 (1992) |
