Donald W. Loveland

Publication Activity (10 Years)

Years Active: 1960-2016
Publications (10 Years): 1

Publications

Donald W. Loveland
Mark Stickel: His Earliest Work. J. Autom. Reason. 56 (2) (2016)
Donald W. Loveland, Adnan H. Yahya
Satchmorebid: Satchmo(Re) with BIDirectional Relevancy. New Gener. Comput. 21 (3) (2003)
Donald W. Loveland
Automated deduction: achievements and future directions. Commun. ACM 43 (11es) (2000)
Donald W. Loveland
Automated Deduction: Looking Ahead. AI Mag. 20 (1) (1999)
Owen L. Astrachan, Donald W. Loveland
The Use of Lemmas in the Model Elimination Procedure. J. Autom. Reason. 19 (1) (1997)
Gopalan Nadathur, Donald W. Loveland
Uniform Proofs and Disjunctive Logic Programming (Extended Abstract) LICS (1995)
Donald W. Loveland, David W. Reed, Debra Sue Wilson
SATCHMORE: SATCHMO with REIevancy. J. Autom. Reason. 14 (2) (1995)
David W. Reed, Donald W. Loveland
Near-Horn Prolog and the Ancestry Family of Procedures. Ann. Math. Artif. Intell. 14 (2-4) (1995)
Donald W. Loveland
Proof Procedures for Disjunctive Logic Programming. GI Jahrestagung (1994)
David W. Reed, Donald W. Loveland
A Comparison of Three Prolog Extensions. J. Log. Program. 12 (1&2) (1992)
Marco Valtorta, Donald W. Loveland
On the complexity of belief network synthesis and refinement. Int. J. Approx. Reason. 7 (3-4) (1992)
David W. Reed, Donald W. Loveland, Bruce T. Smith
An Alternative Characterization of Disjunctive Logic Programs. ISLP (1991)
Owen L. Astrachan, Donald W. Loveland
METEORs: High Performance Theorem Provers Using Model Elimination. Automated Reasoning: Essays in Honor of Woody Bledsoe (1991)
David W. Reed, Donald W. Loveland, Bruce T. Smith
The Near-Horn Approach to Disjunctive Logic Programming. ELP (1991)
Donald W. Loveland, David W. Reed
A Near-Horn Prolog for Compilation. Computational Logic - Essays in Honor of Alan Robinson (1991)
Donald W. Loveland
Near-Horn Prolog and Beyond. J. Autom. Reason. 7 (1) (1991)
Bruce T. Smith, Donald W. Loveland
A Simple Near-Horn Prolog Interpreter. ICLP/SLP (1988)
Bruce T. Smith, Donald W. Loveland
An nH-Prolog Implementation. CADE (1988)
Donald W. Loveland
Near-Horn PROLOG. ICLP (1987)
Donald W. Loveland
Finding Critical Sets. J. Algorithms 8 (3) (1987)
Louis D. Duval, Robert A. Wagner, Yijie Han, Donald W. Loveland
Finding Test-and-Treatment Procedures Using Parallel Computation. J. Parallel Distributed Comput. 4 (3) (1987)
Louis D. Duval, Yijie Han, Robert A. Wagner, Donald W. Loveland
Finding Test-and-Treatment Procedures Using Parallel Computation. ICPP (1986)
Donald W. Loveland
Automated theorem proving: mapping logic into AI. ISMIS (1986)
Donald W. Loveland
Performance Bounds for Binary Testing with Arbitrary Weights. Acta Informatica 22 (1) (1985)
Donald W. Loveland, Marco Valtorta
Detecting Ambiguity: An Example in Knowledge Evaluation. IJCAI (1983)
Donald W. Loveland, C. R. Reddy
Deleting Repeated Goals in the Problem Reduction Format. J. ACM 28 (4) (1981)
Donald W. Loveland, Robert E. Shostak
Simplifying Interpreted Formulas. CADE (1980)
C. R. Reddy, Donald W. Loveland
Presburger Arithmetic with Bounded Quantifier Alternation STOC (1978)
Donald W. Loveland, Mark E. Stickel
A Hole in Goal Trees: Some Guidance from Resolution Theory. IEEE Trans. Computers 25 (4) (1976)
Donald W. Loveland
Position statement: mathematical computer science courses. ACM SIGCSE Bull. 6 (3) (1974)
Norman E. Gibbs, Donald W. Loveland, James M. Ortega
The heart of computer science. ACM SIGCSE Bull. 6 (4) (1974)
S. Fleisig, Donald W. Loveland, A. K. Smiley III, D. L. Yarmush
An Implementation of the Model Elimination Proof Procedure. J. ACM 21 (1) (1974)
Donald W. Loveland, Mark E. Stickel
A Hole in Goal Trees: Some Guidance from Resolution Theory. IJCAI (1973)
Donald W. Loveland
A Unifying View of Some Linear Herbrand Procedures. J. ACM 19 (2) (1972)
Donald W. Loveland
A Simplified Format for the Model Elimination Theorem-Proving Procedure. J. ACM 16 (3) (1969)
Donald W. Loveland
Erratum: "Mechanical Theorem-Proving by Model Elimination". J. ACM 16 (1) (1969)
Donald W. Loveland
A Variant of the Kolmogorov Concept of Complexity Inf. Control. 15 (6) (1969)
Donald W. Loveland
On Minimal-Program Complexity Measures STOC (1969)
Donald W. Loveland
Mechanical Theorem-Proving by Model Elimination. J. ACM 15 (2) (1968)
Martin Davis, George Logemann, Donald W. Loveland
A machine program for theorem-proving. Commun. ACM 5 (7) (1962)
Herbert L. Gelernter, J. R. Hansen, Donald W. Loveland
Empirical explorations of the geometry theorem machine. IRE-AIEE-ACM Computer Conference (Western) (1960)