Tomasz Pietrzykowski

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