Howard C. Wasserman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2003

Generalized linear recursive networks: topological and routing propertiesHoward C. Wasserman, S. A. Ghozati. cee, 29(1):121-134, 2003. [doi]

2002

A Theoretical Foundation and a Method for Document Table Structure Extraction and DecompositonHoward C. Wasserman, Keitaro Yukawa, Bon K. Sy, Kui-Lam Kwok, Ihsin T. Phillips. das 2002: 291-294 [doi]

1996

On quantitative measurement of negation in logic programmingHoward C. Wasserman, Keitaro Yukawa, Zhizhang Shen. SAC 1996: 58-62 [doi]

1995

An alternative transformation rule for logic programsHoward C. Wasserman, Keitaro Yukawa, Zhizhang Shen. SAC 1995: 364-368 [doi]

The Essential Inadequacy of Deduction in Logic ProgrammingHoward C. Wasserman, Keitaro Yukawa, Zhizhang Shen. igpl, 3(1):107-110, 1995. [doi]

1994

The locality principle and completeness in logic programmingHoward C. Wasserman, Zhizhang Shen. SAC 1994: 286-291 [doi]

1993

The Essential Inadequacy of Deductions in Logic ProgrammingHoward C. Wasserman, Keitaro Yukawa, Zhizhang Shen. SLP 1993: 644

1978

A second-order axiomatic theory of stringsHoward C. Wasserman. ndjfl, 19(4):629-633, 1978. [doi]

1976

A note on evaluation mappingsHoward C. Wasserman. ndjfl, 17(4):613-614, 1976. [doi]

An analysis of the counterfactual conditionalHoward C. Wasserman. ndjfl, 17(3):395-400, 1976. [doi]

1974

Admissible rules, derivable rules, and extendible logistic systemsHoward C. Wasserman. ndjfl, 15(2):265-278, 1974. [doi]

Sign in or sign up to see more results.

runs on WebDSL