Skip to main content
Kent Academic Repository

Browse by Person (creator, editor, contributor, etc.)

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 27.

2000

Watson, Phil (2000) Review of Ambainis A. et al, `Ordinal mind change complexity of language identification'. Mathematical Reviews, (2000e:). (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (2000) Review of Case J., `The power of vacillation in language learning'. Mathematical Reviews, (2000e:). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (2000) Review of Schaefer M., `A guided tour of minimal indices and shortest descriptions'. Mathematical Reviews, (2000b:). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (2000) Review of Aizenstein, H. et al, `On learning read-k-satisfy-j DNF'. Mathematical Reviews, (2000a:). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (2000) Review of Gasarch W. et al, `Classification using information'. Mathematical Reviews, (2000a:). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

1999

Watson, Phil (1999) Inductive Learning with Corroboration. In: Algorithmic Learning Theory, Proceedings of the 10th International Conference, Dec 06-08, 1999, Tokyo, Japan. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1999) Review of "Generalization and specialization strategies for learning r.e. languages". Review of: Generalization and specialization strategies for learning r.e. languages by Jain, Sanjay and Sharma, Arun. Mathematical Reviews, (99m:68). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1999) Review of "Learning with refutation". Review of: Learning with refutation by Jain, Sanjay. Mathematical Reviews, (99m:68). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1999) Review of 'The structure of intrinsic complexity of learning'. Review of: The structure of intrinsic complexity of learning by Jain, Sanjay and Sharma, Arun. Mathematical Reviews, (99k:03). (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1999) Review of 'Approximation methods in inductive inference'. Review of: Approximation methods in inductive inference by Moser, W.R.. Mathematical Reviews, (99g:68). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1999) Review of 'Learning via queries and oracles'. Review of: Learning via queries and oracles by Stephan, Frank. Mathematical Reviews, (99f:03). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1999) Inductive learning with corroboration. Technical report. (Full text available)
[img]
Preview
[img]
Preview

Watson, Phil (1999) Review of 'On the relative sizes of learnable sets'. Review of: On the relative sizes of learnable sets' by Fortnow, Lance and Freivalds, Rusins and Gasarch, William I. and Kumme, Martin and Kurtz, Stuart A. and Smith, Carl H. and Stephan, Frank. Mathematical Reviews, (99c:68). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

1997

Watson, Phil (1997) Embeddings in the strong reducibilities between 1 and npm. Mathematical Logic Quarterly, 43 (4). pp. 559-568. ISSN 0942-5616. (doi:https://doi.org/10.1002/malq.19970430411) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Lai, Luming and Watson, Phil (1997) A case study in Timed CSP: the railroad crossing problem. In: Maler, O., ed. Proceedings of the International Workshop on Hybrid and Real-Time Systems (HART 97). Lecture Notes in Computer Science, 1201. Springer Verlag pp. 69-74. ISBN 3-540-62600-X. (doi:https://doi.org/10.1007/BFb0014714) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Evans, A.S. and Holton, D.R.W. and Lai, L.M. and Watson, Phil (1997) A comparison of real-time formal specification languages. In: Duke, David J. and Evans, A.S., eds. Proceedings of the Northern Formal Methods Workshop, Ilkley, September 1996. Electronic Workshops in Computer Science. Springer Verlag ISBN 3-540-76117-9. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

1995

Watson, Phil (1995) Inductive learning of recurrence-term languages from positive data. In: Jantke, Klaus P. and Lange, Steffen, eds. Algorithmic learning for knowledge-based systems. Lecture Notes in Artificial Intelligence, 961 . Springer Verlag, pp. 292-315. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

1994

Lange, Steffen and Watson, Phil (1994) Machine discovery in the presence of incomplete or ambiguous data. In: Jantke, Klaus P., ed. Algorithmic Learning Theory, Proceedings of the 5th International Workshop, Rheinhardsbrunn, Germany, 1994. Lecture Notes in Artificial Intelligence, 872. Springer Verlag pp. 438-452. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

1993

Thomas, Muffy and Watson, Phil (1993) Solving divergence in Knuth-Bendix completion by enriching signatures. Theoretical Computer Science, 112 . pp. 145-185. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Thomas, M. and Kirkwood, C. and Matthews, Brian and Watson, Phil (1993) Verification techniques for LOTOS: final report. Technical report. Department of Computing Science, University of Glasgow (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

1992

Thomas, Muffy and Watson, Phil (1992) Solving divergence in Knuth-Bendix completion by enriching signatures. In: Nivat, M. and Rattray, Charles and Rus, Teodor and Scollo, G., eds. Algebraic Methodology and Software Technology, Proceedings of the 2nd International Conference, Iowa City, U.S.A., 1991. Workshops in Computing. Springer Verlag pp. 377-390. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

1991

Thomas, Muffy and Watson, Phil (1991) Generalising diverging sequences of rewrite rules by synthesising new sorts. In: Jones, Simon L. Peyton and Hutton, Graham and Holst, Carsten Kehler, eds. Functional Programming, Glasgow 1990, Proceedings of the 1990 Glasgow Workshop on Functional Programming. Workshops in Computing. Springer Verlag pp. 268-273. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Dick, A.J.J. and Watson, Phil (1991) Order-sorted term rewriting. Computer Journal, 34 (1). pp. 16-19. ISSN 0010-4620. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cohen, Dave and Watson, Phil (1991) An efficient representation of arithmetic for term rewriting. In: Book, Ronald V., ed. Rewrite Techniques and Applications, Proceedings of the 4th Conference on Rewrite Techniques and Applications, Como, Italy, 1991. Lecture Notes in Computer Science, 488. Springer Verlag pp. 240-251. (doi:https://doi.org/10.1007/3-540-53904-2_100) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

1990

Martin, U.H. and Cohen, Dave and Lai, M.K.F. and Norrie, K.J. and Watson, Phil (1990) Case studies in equational reasoning. Technical report. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1990) On restricted forms of enumeration reducibility. Annals of Pure and Applied Logic, 49 . pp. 75-96. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

1989

Watson, Phil and Dick, A.J.J. (1989) Least sorts in order-sorted term rewriting. Technical report. British Computer Society https://doi.org/10.1093/comjnl/34.1.16. (doi:https://doi.org/10.1093/comjnl/34.1.16) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

This list was generated on Sat May 25 03:37:59 2019 BST.