Generalising Diverging Sequences of Rewrite Rules by Synthesising New Sorts. - Muffy Thomas; Phil Watson (Functional Programming, 1990)

On Restricted Forms of Enumeration Reducibility. - Phil Watson (Ann. Pure Appl. Log., 1990)

An Efficient Representation of Arithmetic for Term Rewriting. - Dave Cohen; Phil Watson (RTA, 1991)

Order-Sorted Term Rewriting. - A. J. J. Dick; Phil Watson (Comput. J., 1991)

Solving Divergence in Knuth-Bendix Completion by Enriching Signatures. - Muffy Thomas; Phil Watson (Theor. Comput. Sci., 1993)

Machine Discovery in the Presence of Incomplete or Ambiguous Data. - Steffen Lange; Phil Watson (AII/ALT, 1994)

Inductive Learning of Recurrence-Term Languages from Positive Data. - Phil Watson (GOSLER Final Report, 1995)

A Case Study in Timed CSP: The Railroad Crossing Problem. - Luming Lai; Phil Watson (HART, 1997)

Embeddings in the Strong Reducibilities Between 1 and npm. - Phil Watson (Math. Log. Q., 1997)

Inductive Learning with Corroboration. - Phil Watson (ALT, 1999)

Inverse-designed CWDM demultiplexer operated in O-band. - Alfred K. C. Cheung; Krishna Gadepalli; Jian Guan; Andreas Hoenselaar; Yang Meng; Anton Menshov; Jan Petykiewicz; Xavier Serey; Rhett Stucki; Lieven Verslegers; Jiahui Wang; Phil Watson; et al. (OFC, 2024)