The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Donald W. Loveland: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002