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

Group by: Item Type | Date | No Grouping

Jump to: Article | Book section | Monograph | Conference or workshop item

Number of items: 22.

Article

Watson, P. (2000) Review of Ambainis A. et al, `Ordinal mind change complexity of language identification'. Mathematical Reviews (2000e:68079). The full text of this publication is not available from this repository.

Watson, P. (2000) Review of Case J., `The power of vacillation in language learning'. Mathematical Reviews (2000e:68081). The full text of this publication is not available from this repository.

Watson, P. (2000) Review of Schaefer M., `A guided tour of minimal indices and shortest descriptions'. Mathematical Reviews (2000b:03156). The full text of this publication is not available from this repository.

Watson, P. (2000) Review of Aizenstein, H. et al, `On learning read-k-satisfy-j DNF'. Mathematical Reviews (2000a:68060). The full text of this publication is not available from this repository.

Watson, P. (2000) Review of Gasarch W. et al, `Classification using information'. Mathematical Reviews (2000a:68062). The full text of this publication is not available from this repository.

Watson, P. (1997) Embeddings in the strong reducibilities between 1 and npm. Mathematical Logic Quarterly, 43 (4). pp. 559-568. ISSN 0942-5616 . The full text of this publication is not available from this repository.

Thomas, M. and Watson, P. (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 available from this repository.

Dick, A.J.J. and Watson, P. (1991) Order-sorted term rewriting. The Computer Journal, 34 (1). pp. 16-19. The full text of this publication is not available from this repository.

Watson, P. (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 available from this repository.

Cooper, S.B. and Lempp, S. and Watson, P. (1989) Weak density and cupping in the d-r.e. degrees. Israel Journal of Mathematics, 67 (1). pp. 137-152. The full text of this publication is not available from this repository.

Book section

Watson, P. (1995) Inductive learning of recurrence-term languages from positive data. In: Jantke, K.P. and Lange, S., 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 available from this repository.

Monograph

Watson, P. (1999) Inductive learning with corroboration. Technical report.

Preview

Preview

Thomas, M. and Kirkwood, C. and Matthews, B. and Watson, P. (1993) Verification techniques for LOTOS: final report. Technical report. Department of Computing Science, University of Glasgow The full text of this publication is not available from this repository.

Martin, U.H. and Cohen, D.A. and Lai, M.K.F. and Norrie, K.J. and Watson, P. (1990) Case studies in equational reasoning. Technical report. The full text of this publication is not available from this repository.

Watson, P. and Dick, A.J.J. (1989) Least sorts in order-sorted term rewriting. Technical report. British Computer Society 10.1093/comjnl/34.1.16 . The full text of this publication is not available from this repository.

Conference or workshop item

Watson, P. (1999) Inductive Learning with Corroboration. In: Watanabe, O. and Yokomori, T., eds. Algorithmic Learning Theory, Proceedings of the 10th International Conference. Lecture Notes in Artificial Intelligence, 1720. Springer Verlag pp. 145-156. ISBN 3-540-66748-2. The full text of this publication is not available from this repository.

Lai, L.M. and Watson, P. (1997) A case study in Timed CSP: the railroad crossing problem. In: Maler, O., ed. Hybrid and Real-Time Systems. Lecture Notes in Computer Science, 1201. Springer Verlag pp. 69-74. ISBN 3-540-62600-X. The full text of this publication is not available from this repository.

Evans, A.S. and Holton, D.R.W. and Lai, L.M. and Watson, P. (1997) A comparison of real-time formal specification languages. In: Duke, D.J. and Evans, A.S., eds. BCS-FACS Northern formal methods workshop. Electronic Workshops in Computer Science. Springer Verlag ISBN 3540761179. The full text of this publication is not available from this repository.

Lange, S. and Watson, P. (1994) Machine discovery in the presence of incomplete or ambiguous data. In: Algorithmic Learning Theory, Proceedings of the 5th International Workshop, Rheinhardsbrunn, Germany, 1994. The full text of this publication is not available from this repository.

Thomas, M. and Watson, P. (1992) Solving divergence in Knuth-Bendix completion by enriching signatures. In: Algebraic Methodology and Software Technology, Proceedings of the 2nd International Conference, Iowa City, U.S.A., 1991. The full text of this publication is not available from this repository.

Cohen, D. and Watson, P. (1991) An efficient representation of arithmetic for term rewriting. In: Rewrite Techniques and Applications, Proceedings of the 4th Conference on Rewrite Techniques and Applications, Como, Italy, 1991. The full text of this publication is not available from this repository.

Thomas, M. and Watson, P. (1991) Generalising diverging sequences of rewrite rules by synthesising new sorts. In: Functional Programming, Glasgow 1990, Proceedings of the 1990 Glasgow Workshop on Functional Programming. The full text of this publication is not available from this repository.

This list was generated on Thu May 23 02:56:41 2013 BST.