Tomasz Pietrzykowski

According to our database, Tomasz Pietrzykowski authored at least 21 papers between 1962 and 1993.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

1993

Equality and Abductive Residua for Horn Clauses.

Emanuel Knill, Philip T. Cox, Tomasz Pietrzykowski

Theor. Comput. Sci., 1993

1992

Abduction in Logic Programming with Equality.

Philip T. Cox, Emanuel Knill, Tomasz Pietrzykowski

Proceedings of the International Conference on Fifth Generation Computer Systems. FGCS 1992, 1992

Visual Message Flow Language MFL and its Interaface.

Philip T. Cox, Tomasz Pietrzykowski

Proceedings of the Advanced Visual Interfaces - Proceedings of the International Workshop, 1992

1990

Object oriented programming in the computer science curriculum (panel session).

Julie Zweigoron, John Bierbauer, Scott Knaster, Tomasz Pietrzykowski, John R. Pugh

Proceedings of the 21st SIGCSE Technical Symposium on Computer Science Education, 1990

1989

Prograph: a step towards liberating programming from textual conditioning.

Philip T. Cox, F. R. Giles, Tomasz Pietrzykowski

Proceedings of the IEEE Workshop on Visual Languages, 1989

1987

General Diagnosis by Abductive Inference.

Philip T. Cox, Tomasz Pietrzykowski

Proceedings of the 1987 Symposium on Logic Programming, San Francisco, California, USA, August 31, 1987

1986

Incorporating equality into logic programming via surface deduction.

Philip T. Cox, Tomasz Pietrzykowski

Ann. Pure Appl. Log., 1986

Causes for Events: Their Computation and Applications.

Philip T. Cox, Tomasz Pietrzykowski

Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

1985

Intelligent Backtracking in Plan-Based Deduction.

Stan Matwin, Tomasz Pietrzykowski

IEEE Trans. Pattern Anal. Mach. Intell., 1985

Prograph: A Preliminary Report.

Stan Matwin, Tomasz Pietrzykowski

Comput. Lang., 1985

Surface Deduction: A Uniform Mechanism for Logic Programming.

Philip T. Cox, Tomasz Pietrzykowski

Proceedings of the 1985 Symposium on Logic Programming, 1985

Advanced programming aids in PROGRAPH.

Philip T. Cox, Tomasz Pietrzykowski

Proceedings of the 1985 ACM SIGSMALL symposium on Small systems, 1985

1984

A Complete, Nonredundant Algorithm for Reversed Skolemization.

Philip T. Cox, Tomasz Pietrzykowski

Theor. Comput. Sci., 1984

1983

Intelligent Backtracking for Automated Deduction in FOL.

Stan Matwin, Tomasz Pietrzykowski

Proceedings of the Logic Programming Workshop '83, Praia da Falésia, Algarve, Portugal, 26 June, 1983

1982

Exponential Improvement of Efficient Backtracking: A Strategy for Plan-Based Deduction.

Tomasz Pietrzykowski, Stan Matwin

Proceedings of the 6th Conference on Automated Deduction, 1982

Exponential Improvement of Efficient Backtracking: data Structure and Implementation.

Stan Matwin, Tomasz Pietrzykowski

Proceedings of the 6th Conference on Automated Deduction, 1982

1981

Deduction Plans: A Basis for Intelligent Backtracking.

Philip T. Cox, Tomasz Pietrzykowski

IEEE Trans. Pattern Anal. Mach. Intell., 1981

1976

Mechanizing <i>omega</i>-Order Type Theory Through Unification.

D. C. Jensen, Tomasz Pietrzykowski

Theor. Comput. Sci., 1976

1973

A Complete Mechanization of Second-Order Type Theory.

Tomasz Pietrzykowski

J. ACM, 1973

1972

A complete mechanization of (Ω)-order type theory.

Tomasz Pietrzykowski, D. C. Jensen

Proceedings of the ACM annual conference, 1972

1962

Application of the Steepest Ascent Method to Concave Programming.

Tomasz Pietrzykowski

Proceedings of the Information Processing, Proceedings of the 2nd IFIP Congress 1962, Munich, Germany, August 27, 1962