Formal Verification of the Sobel Image Processing Chip. - Paliath Narendran; Jonathan Stillman (DAC, 1988)

It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair. - Paliath Narendran; Jonathan Stillman (STACS, 1989)

Uncertainty and Incompleteness: Breaking the Symmetry of Defeasible Reasoning. - Piero P. Bonissone; David A. Cyrluk; James W. Goodwin; Jonathan Stillman (UAI, 1989)

It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics. - Jonathan Stillman (AAAI, 1990)

Semi-Unification. - Deepak Kapur; David R. Musser; Paliath Narendran; Jonathan Stillman (Theor. Comput. Sci., 1991)

The Complexity of Propositional Default Logics. - Jonathan Stillman (AAAI, 1992)

Tachyon: A Constraint-Based Temporal Model and its Implementation. - Jonathan Stillman; Richard Arthur; Andrew Deitsch (SIGART Bull., 1993)

Temporal Reasoning for Automated Workflow in Health Care Enterprises. - Ira J. Haimowitz; James Farley; Glenn S. Fields; Jonathan Stillman; Barbara J. Vivier (Electronic Commerce, 1994)

Developing New Technologies for the ARPA-Rome Planning Initiative. - Jonathan Stillman; Piero P. Bonissone (IEEE Expert, 1995)

Towards human-computer synergetic analysis of large-scale biological data. - Rahul Singh; Hui Yang 002; Ben Dalziel; Daniel Asarnow; William Murad; David Foote; Matthew Gormley; Jonathan Stillman; Susan Fisher (BMC Bioinform., 2013)

On Heuristics for Finding Loop Cutsets in Multiply-Connected Belief Networks - Jonathan Stillman (CoRR, 2013)

Uncertainty and Incompleteness - Piero P. Bonissone; David A. Cyrluk; James W. Goodwin; Jonathan Stillman (CoRR, 2013)