Theorem

Antony Galton has an Erdös number of at most 10.

Proof

10. Antony Galton

John Gooday and Antony Galton, 'The Transition Calculus: A High-Level Formalism for Reasoning about Action and Change'. Journal of Experimental and Theoretical Artificial Intelligence, 9 (1997) 51-66.

9. John Gooday

A. G. Cohn, B. Bennett, J. M. Gooday and N. Gotts, 'RCC: a Calculus for Region-based Qualitative Spatial Reasoning', GeoInformatica, 1 (1997) 275-316. 

8. Anthony Cohn

Alan M. Frisch, Anthony G. Cohn, 'An Abstract View of Sorted Unification'.  Proc. 11th International Conference on Automated Deduction (CADE 1992) Springer LNCS 607, 178-192.

7. Alan Frisch

 James F. Allen, Alan M. Frisch, Diane J. Litman. 'ARGOT: The Rochester Dialogue System'. Proceedings AAAI 1982, 66-70.

6. James Allen

Patrick J. Hayes, James F. Allen. 'Short Time Periods'. Proceedings IJCAI 1987, 981-983.

5. Patrick Hayes

John McCarthy and P.J. Hayes. 'Some Philosophical Problems from the Standpoint of Artificial Intelligence'. In D. Michie (ed.), Machine Intelligence 4 , American Elsevier, New York, NY, 1969.

4. John McCarthy

Z. Manna, J. McCarthy.  'Properties of Programs and Partial Function Logic'. In D.Michie (ed.), Machine Intelligence 5, Edinburgh University Press 1969, 27-37.

3. Zohar Manna

Z. Manna and A. Pnueli. 'Verification of Concurrent Programs: The Temporal Framework'. In R. S. Boyer and J. S. Moore (eds.), The Correctness Problem in Computer Science. Academic Press, 1981, 215-273.
2. Amir Pnueli

D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. 'On the temporal analysis of fairness'. In Proceedings of the 7th ACM Symposium on Principles of Programming Languages, 1980, 163-173.
1. Saharon Shelah

P. Erdös, S. Shelah. 'Separability Properties of Almost-disjoint Families of Sets'. Israel J. Math. 12 (1972) 207-214

0. Paul Erdös


Any help towards lowering the upper bound would be appreciated.

Antony Galton
, 24/2/03