| 2003 |
|---|
| 37 | EE | Donald W. Loveland,
Adnan H. Yahya:
Satchmorebid: Satchmo(Re) with BIDirectional Relevancy.
New Generation Comput. 21(3): (2003) |
| 2000 |
|---|
| 36 | EE | Donald W. Loveland:
Automated deduction: achievements and future directions.
Commun. ACM 43(11es): 10 (2000) |
| 1999 |
|---|
| 35 | | Donald W. Loveland:
Automated Deduction: Looking Ahead.
AI Magazine 20(1): 77-98 (1999) |
| 1997 |
|---|
| 34 | | Owen L. Astrachan,
Donald W. Loveland:
The Use of Lemmas in the Model Elimination Procedure.
J. Autom. Reasoning 19(1): 117-141 (1997) |
| 1995 |
|---|
| 33 | | Gopalan Nadathur,
Donald W. Loveland:
Uniform Proofs and Disjunctive Logic Programming (Extended Abstract)
LICS 1995: 148-155 |
| 32 | | David W. Reed,
Donald W. Loveland:
Near-Horn Prolog and the Ancestry Family of Procedures.
Ann. Math. Artif. Intell. 14(2-4): (1995) |
| 31 | | Donald W. Loveland,
David W. Reed,
Debra Sue Wilson:
SATCHMORE: SATCHMO with REIevancy.
J. Autom. Reasoning 14(2): 325-351 (1995) |
| 1994 |
|---|
| 30 | | Donald W. Loveland:
Proof Procedures for Disjunctive Logic Programming.
GI Jahrestagung 1994: 92 |
| 1992 |
|---|
| 29 | EE | Marco Valtorta,
Donald W. Loveland:
On the complexity of belief network synthesis and refinement.
Int. J. Approx. Reasoning 7(3-4): 121-148 (1992) |
| 28 | | David W. Reed,
Donald W. Loveland:
A Comparison of Three Prolog Extensions.
J. Log. Program. 12(1&2): 25-50 (1992) |
| 1991 |
|---|
| 27 | | Owen L. Astrachan,
Donald W. Loveland:
METEORs: High Performance Theorem Provers Using Model Elimination.
Automated Reasoning: Essays in Honor of Woody Bledsoe 1991: 31-60 |
| 26 | | Donald W. Loveland,
David W. Reed:
A Near-Horn Prolog for Compilation.
Computational Logic - Essays in Honor of Alan Robinson 1991: 542-564 |
| 25 | | David W. Reed,
Donald W. Loveland,
Bruce T. Smith:
The Near-Horn Approach to Disjunctive Logic Programming.
ELP 1991: 345-369 |
| 24 | | David W. Reed,
Donald W. Loveland,
Bruce T. Smith:
An Alternative Characterization of Disjunctive Logic Programs.
ISLP 1991: 54-68 |
| 23 | | Donald W. Loveland:
Near-Horn Prolog and Beyond.
J. Autom. Reasoning 7(1): 1-26 (1991) |
| 1988 |
|---|
| 22 | | Bruce T. Smith,
Donald W. Loveland:
An nH-Prolog Implementation.
CADE 1988: 766-767 |
| 21 | | Bruce T. Smith,
Donald W. Loveland:
A Simple Near-Horn Prolog Interpreter.
ICLP/SLP 1988: 794-809 |
| 1987 |
|---|
| 20 | | Donald W. Loveland:
Near-Horn PROLOG.
ICLP 1987: 456-469 |
| 19 | | Donald W. Loveland:
Finding Critical Sets.
J. Algorithms 8(3): 362-371 (1987) |
| 18 | | Louis D. Duval,
Robert A. Wagner,
Yijie Han,
Donald W. Loveland:
Finding Test-and-Treatment Procedures Using Parallel Computation.
J. Parallel Distrib. Comput. 4(3): 309-318 (1987) |
| 1986 |
|---|
| 17 | | Luis D. Duval,
Yijie Han,
Robert A. Wagner,
Donald W. Loveland:
Finding Test-and-Treatment Procedures Using Parallel Computation.
ICPP 1986: 688-690 |
| 1985 |
|---|
| 16 | | Donald W. Loveland:
Performance Bounds for Binary Testing with Arbitrary Weights.
Acta Inf. 22(1): 101-114 (1985) |
| 1983 |
|---|
| 15 | | Donald W. Loveland,
Marco Valtorta:
Detecting Ambiguity: An Example in Knowledge Evaluation.
IJCAI 1983: 182-184 |
| 1982 |
|---|
| 14 | | Donald W. Loveland:
6th Conference on Automated Deduction, New York, USA, June 7-9, 1982, Proceedings
Springer 1982 |
| 1981 |
|---|
| 13 | EE | Donald W. Loveland,
C. R. Reddy:
Deleting Repeated Goals in the Problem Reduction Format.
J. ACM 28(4): 646-661 (1981) |
| 1980 |
|---|
| 12 | | Donald W. Loveland,
Robert E. Shostak:
Simplifying Interpreted Formulas.
CADE 1980: 97-109 |
| 1978 |
|---|
| 11 | | C. R. Reddy,
Donald W. Loveland:
Presburger Arithmetic with Bounded Quantifier Alternation
STOC 1978: 320-325 |
| 1976 |
|---|
| 10 | | Donald W. Loveland,
Mark E. Stickel:
A Hole in Goal Trees: Some Guidance from Resolution Theory.
IEEE Trans. Computers 25(4): 335-341 (1976) |
| 1974 |
|---|
| 9 | EE | S. Fleisig,
Donald W. Loveland,
A. K. Smiley III,
D. L. Yarmush:
An Implementation of the Model Elimination Proof Procedure.
J. ACM 21(1): 124-139 (1974) |
| 1973 |
|---|
| 8 | | Donald W. Loveland,
Mark E. Stickel:
A Hole in Goal Trees: Some Guidance from Resolution Theory.
IJCAI 1973: 153-161 |
| 1972 |
|---|
| 7 | EE | Donald W. Loveland:
A Unifying View of Some Linear Herbrand Procedures.
J. ACM 19(2): 366-384 (1972) |
| 1969 |
|---|
| 6 | | Donald W. Loveland:
On Minimal-Program Complexity Measures
STOC 1969: 61-65 |
| 5 | | Donald W. Loveland:
A Variant of the Kolmogorov Concept of Complexity
Information and Control 15(6): 510-526 (1969) |
| 4 | EE | Donald W. Loveland:
Erratum: ``Mechanical Theorem-Proving by Model Elimination''.
J. ACM 16(1): 646 (1969) |
| 3 | EE | Donald W. Loveland:
A Simplified Format for the Model Elimination Theorem-Proving Procedure.
J. ACM 16(3): 349-363 (1969) |
| 1968 |
|---|
| 2 | EE | Donald W. Loveland:
Mechanical Theorem-Proving by Model Elimination.
J. ACM 15(2): 236-251 (1968) |
| 1962 |
|---|
| 1 | EE | Martin Davis,
George Logemann,
Donald W. Loveland:
A machine program for theorem-proving.
Commun. ACM 5(7): 394-397 (1962) |
