Phil Watson

According to our database, Phil Watson authored at least 10 papers between 1990 and 1999.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1999

Inductive Learning with Corroboration.

Phil Watson

Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999

1997

Embeddings in the Strong Reducibilities Between 1 and npm.

Phil Watson

Math. Log. Q., 1997

A Case Study in Timed CSP: The Railroad Crossing Problem.

Luming Lai, Phil Watson

Proceedings of the Hybrid and Real-Time Systems, 1997

1995

Inductive Learning of Recurrence-Term Languages from Positive Data.

Phil Watson

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

1994

Machine Discovery in the Presence of Incomplete or Ambiguous Data.

Steffen Lange, Phil Watson

Proceedings of the Algorithmic Learning Theory, 1994

1993

Solving Divergence in Knuth-Bendix Completion by Enriching Signatures.

Muffy Thomas, Phil Watson

Theor. Comput. Sci., 1993

1991

Order-Sorted Term Rewriting.

A. J. J. Dick, Phil Watson

Comput. J., 1991

An Efficient Representation of Arithmetic for Term Rewriting.

Dave Cohen, Phil Watson

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990

On Restricted Forms of Enumeration Reducibility.

Phil Watson

Ann. Pure Appl. Log., 1990

Generalising Diverging Sequences of Rewrite Rules by Synthesising New Sorts.

Muffy Thomas, Phil Watson

Proceedings of the 1990 Glasgow Workshop on Functional Programming, 1990