Admissible rules, derivable rules, and extendible logistic systems. - Howard C. Wasserman (Notre Dame J. Formal Log., 1974)

An analysis of the counterfactual conditional. - Howard C. Wasserman (Notre Dame J. Formal Log., 1976)

A note on evaluation mappings. - Howard C. Wasserman (Notre Dame J. Formal Log., 1976)

A second-order axiomatic theory of strings. - Howard C. Wasserman (Notre Dame J. Formal Log., 1978)

The Essential Inadequacy of Deductions in Logic Programming. - Howard C. Wasserman; Keitaro Yukawa; Zhizhang Shen (ILPS, 1993)

The locality principle and completeness in logic programming. - Howard C. Wasserman; Zhizhang Shen (SAC, 1994)

An alternative transformation rule for logic programs. - Howard C. Wasserman; Keitaro Yukawa; Zhizhang Shen (SAC, 1995)

The Essential Inadequacy of Deduction in Logic Programming. - Howard C. Wasserman; Keitaro Yukawa; Zhizhang Shen (Log. J. IGPL, 1995)

On quantitative measurement of negation in logic programming. - Howard C. Wasserman; Keitaro Yukawa; Zhizhang Shen (SAC, 1996)

A Theoretical Foundation and a Method for Document Table Structure Extraction and Decompositon. - Howard C. Wasserman; Keitaro Yukawa; Bon K. Sy; Kui-Lam Kwok; Ihsin T. Phillips (Document Analysis Systems, 2002)

Generalized linear recursive networks: topological and routing properties. - Howard C. Wasserman; S. A. Ghozati (Comput. Electr. Eng., 2003)