Tomasz Pietrzykowski

Publication Activity (10 Years)

Years Active: 1962-1993
Publications (10 Years): 0

Publications

Emanuel Knill, Philip T. Cox, Tomasz Pietrzykowski
Equality and Abductive Residua for Horn Clauses. Theor. Comput. Sci. 120 (1) (1993)
Philip T. Cox, Emanuel Knill, Tomasz Pietrzykowski
Abduction in Logic Programming with Equality. FGCS (1992)
Philip T. Cox, Tomasz Pietrzykowski
Visual Message Flow Language MFL and its Interaface. Advanced Visual Interfaces (1992)
Julie Zweigoron, John Bierbauer, Scott Knaster, Tomasz Pietrzykowski, John R. Pugh
Object oriented programming in the computer science curriculum (panel session). SIGCSE (1990)
Philip T. Cox, F. R. Giles, Tomasz Pietrzykowski
Prograph: a step towards liberating programming from textual conditioning. VL (1989)
Philip T. Cox, Tomasz Pietrzykowski
General Diagnosis by Abductive Inference. SLP (1987)
Philip T. Cox, Tomasz Pietrzykowski
Causes for Events: Their Computation and Applications. CADE (1986)
Philip T. Cox, Tomasz Pietrzykowski
Incorporating equality into logic programming via surface deduction. Ann. Pure Appl. Log. 31 (1986)
Stan Matwin, Tomasz Pietrzykowski
Intelligent Backtracking in Plan-Based Deduction. IEEE Trans. Pattern Anal. Mach. Intell. 7 (6) (1985)
Philip T. Cox, Tomasz Pietrzykowski
Advanced programming aids in PROGRAPH. SIGSMALL (1985)
Philip T. Cox, Tomasz Pietrzykowski
Surface Deduction: A Uniform Mechanism for Logic Programming. SLP (1985)
Stan Matwin, Tomasz Pietrzykowski
Prograph: A Preliminary Report. Comput. Lang. 10 (2) (1985)
Philip T. Cox, Tomasz Pietrzykowski
A Complete, Nonredundant Algorithm for Reversed Skolemization. Theor. Comput. Sci. 28 (1984)
Stan Matwin, Tomasz Pietrzykowski
Intelligent Backtracking for Automated Deduction in FOL. Logic Programming Workshop (1983)
Tomasz Pietrzykowski, Stan Matwin
Exponential Improvement of Efficient Backtracking: A Strategy for Plan-Based Deduction. CADE (1982)
Stan Matwin, Tomasz Pietrzykowski
Exponential Improvement of Efficient Backtracking: data Structure and Implementation. CADE (1982)
Philip T. Cox, Tomasz Pietrzykowski
Deduction Plans: A Basis for Intelligent Backtracking. IEEE Trans. Pattern Anal. Mach. Intell. 3 (1) (1981)
Philip T. Cox, Tomasz Pietrzykowski
A Complete, Nonredundant Algorithm for Reversed Skolemization. CADE (1980)
D. C. Jensen, Tomasz Pietrzykowski
-Order Type Theory Through Unification. Theor. Comput. Sci. 3 (2) (1976)
Tomasz Pietrzykowski
A Complete Mechanization of Second-Order Type Theory. J. ACM 20 (2) (1973)
Tomasz Pietrzykowski, D. C. Jensen
A complete mechanization of (Ω)-order type theory. ACM Annual Conference (1) (1972)
Tomasz Pietrzykowski
Application of the Steepest Ascent Method to Concave Programming. IFIP Congress (1962)