To
Mark Reynolds's research page.
·
Thesis
·
Reports
·
Reviews
D. Gabbay, I. Hodkinson,
and M. Reynolds. Temporal
Logic: Mathematical Foundations and Computational Aspects, Volume 1. Oxford University Press, 1994.
D. Gabbay, M. Reynolds and
M. Finger. Temporal
Logic: Mathematical Foundations and Computational Aspects, Volume 2. Oxford University Press, 2000.
H. Barringer, M. Fisher, D.
Gabbay, R. Owens, and M. Reynolds, editors. The Imperative
Future. Research Studies Press, Somerset, 1996.
C. Dixon, M. Finger, M.
Fisher, M. Reynolds, "Special Issue on Temporal Representation and
Reasoning", volume 30, number 1-4, Annals of Maths and Artificial Intelligence,
Kluwer, 2001.
M. Reynolds and M.
Zakharyaschev. Journal of Logic and Computation. Volume
12, Issue 4, pp. 679-697. August 2002.
M. Reynolds and A. Sattar.
“Special Issue on Temporal Reasoning”, Journal of Applied Logic. Volume 4, Issue 2,
Pages 117-214 (June 2006). Articles in the special issue are available online here.
M. Reynolds, A. Sattar
(editors). Proceedings of TIME-ICTL 2003, IEEE, 2003.
Renate Schmidt, Ian
Pratt-Hartmann, Mark Reynolds, Heinrich Wansing (eds.). Advances in Modal
Logic, Volume 5, King’s College Publications, London, 2005.
D. Gabbay and M. Reynolds. Towards a computational treatment of time. In D.M. Gabbay,
C.J. Hogger, and J.A. Robinson, editors, The Handbook of Logic in Artificial Intelligence
and Logic Programming, vol. 4, pages 351-437. Oxford
University Press, 1995.
H. Barringer, D. Gabbay,
and M. Reynolds. Introductory chapter. In H. Barringer, M. Fisher, D. Gabbay,
R. Owens, and M. Reynolds, editors, The Imperative Future, pages 10--39. Research
Studies Press, Somerset, 1996.
M. A. Reynolds. Temporal semantics for Gamma. In J-M.
Andreoli, C. Hankin, and D. Le Metayer, editors, Coordination Programming: Mechanisms, Models
and Semantics, pages 141--170. Imperial College Press,
1996.
R. Hirsch, I. Hodkinson, M.
Marx, S. Mikulas, and M. Reynolds. Mosaics and step-by-step.
Remarks on ``A modal logic of relations''. In E.
Orlowska, editor, Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, volume 24 of
Studies in Fuzziness and Soft Computing, pages 158--167. Springer-Verlag,
1999.
M. Finger and M. Reynolds.
Imperative history: two-dimensional executable temporal logic. In U. Reyle and
H.J. Ohlbach, editors, Logic, Language and Reasoning: Essays in Honour of Dov Gabbay,
pages 81--107. Kluwer, 1999.
M. Finger and M. Reynolds. Two-dimensional executable temporal logic for bitemporal databases.
In H. Barringer, M. Fisher, D. Gabbay and G. Gough, editors, Advances in
Temporal Logic, pages 393--411. Kluwer Academic
Publishers, 2000.
C. Dixon, M. Fisher, and M.
Reynolds. Execution and proof in a horn-clause temporal logic. In H. Barringer,
M. Fisher, D. Gabbay and G. Gough, editors, Advances in Temporal Logic, pages 413--433. Kluwer Academic Publishers, 2000.
M. Finger, D. Gabbay, and
M. Reynolds. Advanced tense logic. In D.M. Gabbay and
F. Guenthner, editors, Handbook of Philosophical Logic, second edition, volume 7, pages
43--204 Kluwer, 2002.
T. French and M. Reynolds. A sound and complete proof system for QPTL. In P. Balbiani,
N-Y. Suzuki, F. Wolter and M. Zakharyaschev, editors, Advances in Modal Logic, Volume 4, pages
127--148, King’s College Publications, London, 2003.
M. Reynolds. An Axiomatization of Prior's Ockhamist Logic of Historical
Necessity. In P. Balbiani, N-Y. Suzuki, F. Wolter and M. Zakharyaschev,
editors, Advances
in Modal Logic, Volume 4, pages 355--370, King’s College Publications,
London, 2003.
M. Reynolds and C. Dixon. Theorem-proving
for discrete temporal logic. In M. Fisher, D. Gabbay, and L. Vila, editors,
Handbook of
Temporal Reasoning in Artificial Intelligence, pages 279--314, Elsevier
2005.
Tim French, Ron van der
Meyden, and Mark Reynolds. Complete Axiomatizations for Logics of
Knowledge and Past Time. In Renate Schmidt, Ian Pratt-Hartmann, Mark Reynolds,
Heinrich Wansing (eds.). Advances in Modal Logic, Volume 5, King’s
College Publications, London, 2005.
I.
Hodkinson and M. Reynolds. Separation--- Past, Present and
Future. In We Will Show Them: Essays in Honour of Dov Gabbay, Vol 2. S.
Artemov, H. Barringer, A. S. d'Avila Garcez, L.
C. Lamb,
and J. Woods (eds.), pages 117--142, College Publications, 2005.
Xiangyu Luo, Kaile Su, Abdul Sattar and
Mark Reynolds, Verification of Multi-agent Systems Via Bounded Model
Checking. In AI 2006: Advances
in Artificial Intelligence. Lecture Notes in Computer
Science, Springer Berlin / Heidelberg, 2006, pp 69-78.
I. Hodkinson and M. Reynolds, Temporal Logic. In Patrick Blackburn, Johan
van Benthem, and Frank Wolter. (eds). Handbook
of Modal Logic, pp
655-720, Elsevier 2007. See
http://www.csc.liv.ac.uk/~frank/MLHandbook
D. Bond and M. Reynolds, Tableaux for Branching Time. In Governatori, Orgun,
Reynolds, Sattar(eds).Modal Logics for Multi-Agent Systems in
preparation 2009.
Back to the top
M. Reynolds. A new construction for free inverse semigroups. Semigroup
Forum,
30:291--296, 1984.
M. Reynolds and R.P.
Sullivan. Products of idempotent linear transformations.
Proc. Royal
Soc. of Edinburgh, 100A:123--138, 1985.
M. Reynolds and R.P.
Sullivan. The ideal structure of idempotent-generated
transformation semigroups. Proc. Edinburgh Math. Soc.,
28:319--331, 1985.
M. Reynolds. An
axiomatization for Until and Since over the reals
without the IRR rule. Studia Logica, 51:165--193, May 1992.
M. Reynolds. Axiomatisation and decidability of F and P in cyclical time.
Journal of Philosophical Logic, 23:197--224, 1994.
D. Brough, M. Fisher, A.
Hunter, R. Owens, H. Barringer, D. Gabbay, G. Gough, I. Hodkinson, P. McBrien,
and M. Reynolds. Languages, meta-languages and metatem: a discussion paper. Journal of the
IGPL, 4(2):255--273, March 1996.
M. Reynolds. Axiomatising
first-order temporal logic: Until and since over linear time. Studia Logica,
57:279--302, 1996.
M. Reynolds. A decidable temporal logic of parallelism. Notre Dame
Journal of Formal Logic, 38(3):419--436, Summer
1997.
A. Zanardo, B. Barcellan,
and M. Reynolds. Non-definability of the class of complete bundled trees. Logic Journal of
the IGPL, 7(1):125--136, 1999.
M. Marx and M. Reynolds. Undecidability of compass logic. J of Logic and Computation, 9(6):897--914, December 1999.
M. Reynolds. An axiomatization of full computation tree logic. Journal of
Symbolic Logic, 66(3):1011--1057, Sept. 2001.
Draft version of manuscript available at http://www.csse.uwa.edu.au/~mark/research/Online/CTLSTAR.htm.
M. Reynolds and M.
Zakharyaschev. On the products of linear modal logics.
Journal of
Logic and Computation, 11(6): 909--931, December 2001. Draft version of
manuscript available at http://www.csse.uwa.edu.au/~mark/research/Online/PRODL.htm.
M. Reynolds. Axioms for Branching Time. Journal of Logic
and Computation. Volume 12, Issue 4, pp. 679-697. August 2002.
M. Reynolds. The complexity of the temporal logic with “until” over general
linear time, Journal
of Computer and System Sciences, 66 (2003) pp 393-426. Earlier draft
version of manuscript available at http://www.csse.uwa.edu.au/~mark/research/Online/CULT.htm.
M. Bellgard, T. Gamble, M.
Reynolds, A. Hunter, E. Trifonov and R. Taplin.
Gap Mapping: A
paradigm for sequence alignment, Applied Bioinformatics 2003: 2(3)
S31-S35. (PubMed
entry)
M. Reynolds. An
axiomatization of PCTL*, Information and
Computation , Volume
201, Issue 1 , 25 August 2005, Pages 72-119.
M. Reynolds. A tableau
for bundled CTL*, Journal of Logic and Computation
,
2007 17(1):117-132.
D. M. Gabbay, I. M.
Hodkinson, and M. A. Reynolds. Temporal expressive
completeness in the presence of gaps. In J. Oikkonen and J. Vaananen,
editors, Logic
Colloquium '90, Proceedings ASL European Meeting 1990, Helsinki, number 2
in Lecture Notes in Logic, pages 89--121. Springer-Verlag,
1993.
M. Reynolds. Axiomatizing U
and S over integer time. In D. Gabbay and H.-J.
Ohlbach, editors, Temporal Logic, First International Conference, ICTL '94, Bonn,
Germany, July 11-14, 1994, Proceedings, volume 827 of Lecture Notes in
A.I., pages 117--132. Springer-Verlag, 1994.
M. Reynolds. Towards first-order concurrent metatem. In M. Fisher and R.
Owens, editors, Proceedings
of IJCAI Workshop on Executable Modal and Temporal Logics, Chambery, France
1993,
volume 897 of LNAI, pages 118--143. Springer-Verlag, 1995.
M. Reynolds. Two-dimensional temporal logic. In J.M. Larrazabal, G.
Mints, and D. Lascar, editors, Logic Colloquium'96, Lecture Notes in Logic, pages 219--236. Springer, 1998.
M. Reynolds. The logic of E-contracting. In J. Gammack, editor, 2nd Western
Australian Workshop on Information Systems Research (WAWISR'99), pages
103-108. Murdoch University, 1999.
M. Reynolds. More Past Glories. In Fifteenth Annual IEEE Symposium on Logic in Computer Science
(LICS'2000), Santa Barbara, California, USA, June 26-28, 2000, pages
229-240, IEEE, Los Alamitos, California, USA, 2000.
M. Marx, S. Mikulas and M.
Reynolds. The Mosaic Method for
Temporal Logics. In R. Dyckhoff, editor, Automated
Reasoning with Analytic Tableaux and Related Methods, Proceedings of
International Conference, TABLEAUX 2000, Saint Andrews, Scotland, July 2000,
pages 324-340, LNAI 1847, Springer, 2000.
M. Reynolds. Continuous Temporal Models. In M. Brooks, D. Corbett, and M.
Stumptner, editors, AI 2001: Advances in Artificial Intelligence, Proceedings of the
14th Australian Joint Conference on Artificial Intelligence (AI'2001),
Adelaide, December 2001, LNAI 2256, Springer, 2001.
Tim French, Ron van der
Meyden, and Mark Reynolds. Complete Axiomatizations for Logics of
Knowledge and Past Time. In Renate Schmidt, Ian Pratt-Hartmann, Mark
Reynolds, Heinrich Wansing (eds.). Proceedings
of AiML-2004: Advances in Modal Logic.
Technical Report UMCS-04-09-01. Computer Science
Department, University Of Manchester. 2004. See http://www.cs.man.ac.uk/cstechrep/Abstracts/UMCS-04-09-01.html
M. Reynolds. Towards a CTL* Tableau. In Ramanujam and Sandeep Sen, editors, Foundations of
Software Technology and Theoretical Computer Science (FSTTCS' 05), Springer
LNCS Volume 3821, pages 378-389. 2005.
B. Baker, W. Lui, M.
Reynolds. "Strategy Specification for Teamwork in Robot Soccer "
published by the University of Western Australia Press in the Proceedings of International Symposium
on Practical Cognitive Agents and Robots with an ISBN 1-74052-130-7.
Digital publication will be available on CDs with an ISBN 1-74052-131-5. The
digital procceeding will also be included in the ACM Digital Library. 2006.
R.
Cardell-Oliver, M. Reynolds and M. Kranz. "Space and Time Logic for
Programming Sensor Networks" in Special Track on Formal Methods for the
Specification and Verification of Sensor Networks
International Symposium on Leveraging Formal Methods, Verification and
Validation (ISOLA) 15-19 November 2006, see IEEE
Xplore (published 2008).
Tim French, John C. McCabe-Dansted, Mark Reynolds: A
Temporal Logic of Robustness.
In B. Konev and F. Wolter (eds), Frontiers of Combining Systems, proceedings of
FroCos 2007: 193-205. Springer 2007. See http://www.springerlink.com/content/1159m1185m2h3j22/.
Kaile Su,
Abdul Sattar, Han Lin, Mark Reynolds: A Modal Logic
for Beliefs and Pro Attitudes. AAAI 2007: 496-501. See here.
Enkhsaikhan, M., Wong, W., Liu, W. and Reynolds, M. (2007).
Measuring
Data-Driven Ontology Changes using Text Mining. In Proc.
Sixth Australasian Data Mining Conference (AusDM 2007), Gold
Coast, Australia. CRPIT, 70. Christen, P., Kennedy, P.J., Li, J., Kolyshkina, I. and Williams, G.J., Eds., ACS.
39-46. See here.
Sabrina Ahmad, Mark Reynolds and Terry Woodings. Understanding
Requirements Engineering. In Pro. International
Conference on Engineering and ICT (ICEI 2007), Melaka, Malaysia, November 2007,
Universiti Teknikal Malaysia, Melaka: pages 341-346.
2007.
Tim French, Szabolcs Mikulas, and Mark Reynolds (2009). A Completeness
Proof for Temporal Epistemic Logic with Perfect Recall over Linear Time.
In Proc. 16th International Symposium on Temporal
Representation and Reasoning (TIME-2009), Brixen-Bressanone, Italy 23-25 July
2009. Accepted to appear.
John McCabe-Dansted, Tim French, Mark Reynolds and Sophie Pinchinat. On
the Expressivity of RoCTL*. In Proc. 16th
International Symposium on Temporal Representation and Reasoning (TIME-2009),
Brixen-Bressanone, Italy 23-25 July 2009. Accepted to appear.
Mark Reynolds. Dense
Time Reasoning via Mosaics .
In Proc. 16th International Symposium on Temporal
Representation and Reasoning (TIME-2009), Brixen-Bressanone, Italy 23-25 July
2009. Accepted to appear.
Mark
Reynolds. A Tableau for CTL*. In
Proc. FM2009, 16th International Symposium on Formal Methods, Eindhoven,
the Netherlands, November 2 - November 6, 2009. The proceedings of FM2009 will
be published as a volume in the Springer Lecture Notes in Computer Science
series. Accepted to appear. See extended technical report version here.
M. Reynolds. Expressive Power
of Query Languages based on Logic Programming. PhD
thesis, London University, 1988.
M. Reynolds. Declarative meaning for logic programs with negation as failure.
Technical Report 89/3, Department of Computer Science, The
University of Western Australia, 1989.
M. Reynolds. A completeness result for logic programming. Technical Report 89/8, Department of Computer Science, The
University of Western Australia, 1989.
M. Reynolds. Metatem in intensive care. Technical
Report tr-97-01, King's College, 1997. At http://www.dcs.kcl.ac.uk/technical-reports/papers/tr97-01.ps.gz
M. Reynolds. A decidable
temporal logic of parallelism.(Long Version). Technical Report tr-98-01, King's College, 1998. At http://www.dcs.kcl.ac.uk/technical-reports/papers/tr98-01.ps.gz
M. Reynolds. Changing
nothing is sometimes doing something. Technical Report
tr-98-02, King's College, 1998. At http://www.dcs.kcl.ac.uk/technical-reports/papers/tr98-02.ps.gz
M. Marx and M. Reynolds. Undecidability of compass logic. Technical Report IR-460,
Faculteit der Exacte Wetenschappen, Vrije Universiteit, Amsterdam, 1999.
M. Reynolds and M.
Zakharyaschev. On the products of linear modal logics, short version. Technical
report IT/99/04, Research Working Paper Series, Division of Business,
Information Technology and Law, Murdoch University, September 1999.
M. Marx, S. Mikulas, and M.
Reynolds. Temporal mosaics. Technical report IT/99/05, Research Working Paper
Series, Division of Business, Information Technology and Law, Murdoch
University, September 1999.
M. Reynolds. A Tableau for CTL*. Draft Technical report, CSSE, UWA, January 2009. At http://www.csse.uwa.edu.au/~mark/research/Online/StarTab.html
M. Reynolds. The Complexity of Temporal Logic over the Reals. Draft
Technical report, CSSE, UWA, June 2009. At http://www.csse.uwa.edu.au/~mark/research/Online/CORT.htm
M. Reynolds. Review of computability and logic by Daniel E. Cohen. Journal
of Logic and Computation, 1:749--751, 1991.
Mandy
Rijskreesbi (alias M. Reynolds). Review of first steps in
modal logic by Sally Popkorn. Journal of Logic and Computation, 6(1):162--165, 1996.
M. Reynolds. Review of
"The Logic Programming Paradigm: 25-year perspective" by K. Apt, V.
Marek, M. Truszczynski and D. Warren (eds.). Studia Logica, vol. 71 (2002), No 1, pp.
145-148, June 2002.
M. Reynolds. Review of
“Papers on time and tense” by Arthur N. Prior, New Edition, edited by P. Hasle,
P. Ohrstrom, T. Brauner and J. Copeland. History and Philosophy of Logic, accepted 2004 to appear.
M. Reynolds. Review of "Many-dimensional
modal logics: Theory and applications" by D. M.
Gabbay, A. Kurucz, F. Wolter, and M. Zakharyaschev. Studia Logica, vol. 81 (2005), pp. 147-150.
M. A. Reynolds. Review of
"The Oxford handbook
of philosophy of mathematics and logic" edited by S. Shapiro. History and
Philosophy of Logic, 27 (November 2006), pp. 339-343.
M. Reynolds. The complexity
of the temporal logic over the reals, submitted 1999. Draft version of
manuscript available at http://www.csse.uwa.edu.au/~mark/research/Online/CORT.htm.
M. Reynolds and T. Stokes. Theorem proving in modal logic using Boolean Rings, 2001.
Draft version of manuscript available at
http://www.csse.uwa.edu.au/~mark/research/Online/BoolRing.htm.
M. Reynolds and T. Stokes. Algebraic-rewriting for Theorem-proving in
Propositional Modal Logic. In ?, editors, Computing: The Australasian Theory Symposium
(CATS) 2006, CRPIT, pages ?. Accepted to appear 2006. WITHDRAWN: needs a big
correction.
D. Gabbay and M. Reynolds. Temporal Logic:
Mathematical Foundations and Computational Aspects, Volume 3. Oxford
University Press, in preparation.