| 1999 |
|---|
| 10 | EE | Phil Watson:
Inductive Learning with Corroboration.
ATL 1999: 145-156 |
| 1997 |
|---|
| 9 | | Luming Lai,
Phil Watson:
A Case Study in Timed CSP: The Railroad Crossing Problem.
HART 1997: 69-74 |
| 8 | | Phil Watson:
Embeddings in the Strong Reducibilities Between 1 and npm.
Math. Log. Q. 43: 559-568 (1997) |
| 1995 |
|---|
| 7 | | Phil Watson:
Inductive Learning of Recurrence-Term Languages from Positive Data.
GOSLER Final Report 1995: 292-315 |
| 1994 |
|---|
| 6 | | Steffen Lange,
Phil Watson:
Machine Discovery in the Presence of Incomplete or Ambiguous Data.
AII/ALT 1994: 438-452 |
| 1993 |
|---|
| 5 | | Muffy Thomas,
Phil Watson:
Solving Divergence in Knuth-Bendix Completion by Enriching Signatures.
Theor. Comput. Sci. 112(1): 145-185 (1993) |
| 1991 |
|---|
| 4 | | Muffy Thomas,
Phil Watson:
Solving Divergence in Knuth-Bendix Completion by Enriching Signatures.
AMAST 1991: 377-390 |
| 3 | | Dave Cohen,
Phil Watson:
An Efficient Representation of Arithmetic for Term Rewriting.
RTA 1991: 240-251 |
| 2 | | A. J. J. Dick,
Phil Watson:
Order-Sorted Term Rewriting.
Comput. J. 34(1): 16-19 (1991) |
| 1990 |
|---|
| 1 | | Phil Watson:
On Restricted Forms of Enumeration Reducibility.
Ann. Pure Appl. Logic 49(1): 75-96 (1990) |
