default search action
Tomasz Pietrzykowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1993
- [j8]Emanuel Knill, Philip T. Cox, Tomasz Pietrzykowski:
Equality and Abductive Residua for Horn Clauses. Theor. Comput. Sci. 120(1): 1-44 (1993) - 1992
- [c14]Philip T. Cox, Tomasz Pietrzykowski:
Visual Message Flow Language MFL and its Interaface. Advanced Visual Interfaces 1992: 348-361 - [c13]Philip T. Cox, Emanuel Knill, Tomasz Pietrzykowski:
Abduction in Logic Programming with Equality. FGCS 1992: 539-545 - 1990
- [c12]Julie Zweigoron, John Bierbauer, Scott Knaster, Tomasz Pietrzykowski, John R. Pugh:
Object oriented programming in the computer science curriculum (panel session). SIGCSE 1990: 260
1980 – 1989
- 1989
- [c11]Philip T. Cox, F. R. Giles, Tomasz Pietrzykowski:
Prograph: a step towards liberating programming from textual conditioning. VL 1989: 150-156 - 1987
- [c10]Philip T. Cox, Tomasz Pietrzykowski:
General Diagnosis by Abductive Inference. SLP 1987: 183-189 - 1986
- [j7]Philip T. Cox, Tomasz Pietrzykowski:
Incorporating equality into logic programming via surface deduction. Ann. Pure Appl. Log. 31: 177-189 (1986) - [c9]Philip T. Cox, Tomasz Pietrzykowski:
Causes for Events: Their Computation and Applications. CADE 1986: 608-621 - 1985
- [j6]Stan Matwin
, Tomasz Pietrzykowski:
Prograph: A Preliminary Report. Comput. Lang. 10(2): 91-126 (1985) - [j5]Stan Matwin
Intelligent Backtracking in Plan-Based Deduction. IEEE Trans. Pattern Anal. Mach. Intell. 7(6): 682-692 (1985) - [c8]Philip T. Cox, Tomasz Pietrzykowski:
Advanced programming aids in PROGRAPH. SIGSMALL 1985: 27-33 - [c7]Philip T. Cox, Tomasz Pietrzykowski:
Surface Deduction: A Uniform Mechanism for Logic Programming. SLP 1985: 220-227 - 1984
- [j4]Philip T. Cox, Tomasz Pietrzykowski:
A Complete, Nonredundant Algorithm for Reversed Skolemization. Theor. Comput. Sci. 28: 239-261 (1984) - 1983
- [c6]Stan Matwin, Tomasz Pietrzykowski:
Intelligent Backtracking for Automated Deduction in FOL. Logic Programming Workshop 1983: 186-191 - 1982
- [c5]Tomasz Pietrzykowski, Stan Matwin
Exponential Improvement of Efficient Backtracking: A Strategy for Plan-Based Deduction. CADE 1982: 223-239 - [c4]Stan Matwin
Exponential Improvement of Efficient Backtracking: data Structure and Implementation. CADE 1982: 240-259 - 1981
- [j3]Philip T. Cox, Tomasz Pietrzykowski:
Deduction Plans: A Basis for Intelligent Backtracking. IEEE Trans. Pattern Anal. Mach. Intell. 3(1): 52-65 (1981) - 1980
- [c3]Philip T. Cox, Tomasz Pietrzykowski:
A Complete, Nonredundant Algorithm for Reversed Skolemization. CADE 1980: 374-385
1970 – 1979
- 1976
- [j2]D. C. Jensen, Tomasz Pietrzykowski:
Mechanizing omega-Order Type Theory Through Unification. Theor. Comput. Sci. 3(2): 123-171 (1976) - 1973
- [j1]Tomasz Pietrzykowski:
A Complete Mechanization of Second-Order Type Theory. J. ACM 20(2): 333-364 (1973) - 1972
- [c2]Tomasz Pietrzykowski, D. C. Jensen:
A complete mechanization of (Ω)-order type theory. ACM Annual Conference (1) 1972: 82-92
1960 – 1969
- 1962
- [c1]Tomasz Pietrzykowski:
Application of the Steepest Ascent Method to Concave Programming. IFIP Congress 1962: 185-189
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-04 03:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: