| 1993 |
|---|
| 15 | | Emanuel Knill,
Philip T. Cox,
Tomasz Pietrzykowski:
Equality and Abductive Residua for Horn Clauses.
Theor. Comput. Sci. 120(1): 1-44 (1993) |
| 1992 |
|---|
| 14 | | Philip T. Cox,
Tomasz Pietrzykowski:
Visual Message Flow Language MFL and its Interaface.
Advanced Visual Interfaces 1992: 348-361 |
| 13 | | Philip T. Cox,
Emanuel Knill,
Tomasz Pietrzykowski:
Abduction in Logic Programming with Equality.
FGCS 1992: 539-545 |
| 1990 |
|---|
| 12 | EE | Julie Zweigoron,
John Bierbauer,
Scott Knaster,
Tomasz Pietrzykowski,
John R. Pugh:
Object oriented programming in the computer science curriculum (panel session).
SIGCSE 1990: 260 |
| 1987 |
|---|
| 11 | | Philip T. Cox,
Tomasz Pietrzykowski:
General Diagnosis by Abductive Inference.
SLP 1987: 183-189 |
| 1986 |
|---|
| 10 | | Philip T. Cox,
Tomasz Pietrzykowski:
Causes for Events: Their Computation and Applications.
CADE 1986: 608-621 |
| 1985 |
|---|
| 9 | | Philip T. Cox,
Tomasz Pietrzykowski:
Surface Deduction: A Uniform Mechanism for Logic Programming.
SLP 1985: 220-227 |
| 8 | | Stan Matwin,
Tomasz Pietrzykowski:
Prograph: A Preliminary Report.
Comput. Lang. 10(2): 91-126 (1985) |
| 1984 |
|---|
| 7 | | Philip T. Cox,
Tomasz Pietrzykowski:
A Complete, Nonredundant Algorithm for Reversed Skolemization.
Theor. Comput. Sci. 28: 239-261 (1984) |
| 1982 |
|---|
| 6 | | Tomasz Pietrzykowski,
Stan Matwin:
Exponential Improvement of Efficient Backtracking: A Strategy for Plan-Based Deduction.
CADE 1982: 223-239 |
| 5 | | Stan Matwin,
Tomasz Pietrzykowski:
Exponential Improvement of Efficient Backtracking: data Structure and Implementation.
CADE 1982: 240-259 |
| 1980 |
|---|
| 4 | | Philip T. Cox,
Tomasz Pietrzykowski:
A Complete, Nonredundant Algorithm for Reversed Skolemization.
CADE 1980: 374-385 |
| 1976 |
|---|
| 3 | | D. C. Jensen,
Tomasz Pietrzykowski:
Mechanizing omega-Order Type Theory Through Unification.
Theor. Comput. Sci. 3(2): 123-171 (1976) |
| 1973 |
|---|
| 2 | EE | Tomasz Pietrzykowski:
A Complete Mechanization of Second-Order Type Theory.
J. ACM 20(2): 333-364 (1973) |
| 1962 |
|---|
| 1 | | Tomasz Pietrzykowski:
Application of the Steepest Ascent Method to Concave Programming.
IFIP Congress 1962: 185-189 |
