Howard C. Wasserman

According to our database, Howard C. Wasserman authored at least 11 papers between 1974 and 2003.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2003

Generalized linear recursive networks: topological and routing properties.

Howard C. Wasserman, S. A. Ghozati

Comput. Electr. Eng., 2003

2002

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

Proceedings of the Document Analysis Systems V, 5th International Workshop, 2002

1996

On quantitative measurement of negation in logic programming.

Howard C. Wasserman, Keitaro Yukawa, Zhizhang Shen

Proceedings of the 1996 ACM Symposium on Applied Computing, 1996

1995

The Essential Inadequacy of Deduction in Logic Programming.

Howard C. Wasserman, Keitaro Yukawa, Zhizhang Shen

Log. J. IGPL, 1995

An alternative transformation rule for logic programs.

Howard C. Wasserman, Keitaro Yukawa, Zhizhang Shen

Proceedings of the 1995 ACM symposium on applied computing, 1995

1994

The locality principle and completeness in logic programming.

Howard C. Wasserman, Zhizhang Shen

Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

1993

The Essential Inadequacy of Deductions in Logic Programming.

Howard C. Wasserman, Keitaro Yukawa, Zhizhang Shen

Proceedings of the Logic Programming, 1993

1978

A second-order axiomatic theory of strings.

Howard C. Wasserman

Notre Dame J. Formal Log., 1978

1976

A note on evaluation mappings.

Howard C. Wasserman

Notre Dame J. Formal Log., 1976

An analysis of the counterfactual conditional.

Howard C. Wasserman

Notre Dame J. Formal Log., 1976

1974

Admissible rules, derivable rules, and extendible logistic systems.

Howard C. Wasserman

Notre Dame J. Formal Log., 1974