default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDonald W. Loveland
Person information
- affiliation: Duke University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j24]Donald W. Loveland:
Mark Stickel: His Earliest Work. J. Autom. Reason. 56(2): 99-112 (2016)- [p1]Donald W. Loveland, Ashish Sabharwal, Bart Selman:
DPLL: The Core of Modern Satisfiability Solvers. Martin Davis on Computability, Computational Logic, and Mathematical Foundations 2016: 315-335
2000 – 2009
- 2003
- [j23]Donald W. Loveland, Adnan H. Yahya:
Satchmorebid: Satchmo(Re) with BIDirectional Relevancy. New Gener. Comput. 21(3): 177-207 (2003) - 2000
- [j22]Donald W. Loveland:
Automated deduction: achievements and future directions. Commun. ACM 43(11es): 10 (2000)
1990 – 1999
- 1999
- [j21]Donald W. Loveland:
Automated Deduction: Looking Ahead. AI Mag. 20(1): 77-98 (1999) - 1997
- [j20]Owen L. Astrachan, Donald W. Loveland:
The Use of Lemmas in the Model Elimination Procedure. J. Autom. Reason. 19(1): 117-141 (1997) - 1995
- [j19]David W. Reed, Donald W. Loveland:
Near-Horn Prolog and the Ancestry Family of Procedures. Ann. Math. Artif. Intell. 14(2-4): 225-249 (1995) - [j18]Donald W. Loveland, David W. Reed, Debra Sue Wilson:
SATCHMORE: SATCHMO with REIevancy. J. Autom. Reason. 14(2): 325-351 (1995) - [c17]Gopalan Nadathur, Donald W. Loveland:
Uniform Proofs and Disjunctive Logic Programming (Extended Abstract). LICS 1995: 148-155 - 1994
- [c16]Donald W. Loveland:
Proof Procedures for Disjunctive Logic Programming. GI Jahrestagung 1994: 92 - 1992
- [j17]Marco Valtorta, Donald W. Loveland:
On the complexity of belief network synthesis and refinement. Int. J. Approx. Reason. 7(3-4): 121-148 (1992) - [j16]David W. Reed, Donald W. Loveland:
A Comparison of Three Prolog Extensions. J. Log. Program. 12(1&2): 25-50 (1992) - 1991
- [j15]Donald W. Loveland:
Near-Horn Prolog and Beyond. J. Autom. Reason. 7(1): 1-26 (1991) - [c15]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 - [c14]Donald W. Loveland, David W. Reed:
A Near-Horn Prolog for Compilation. Computational Logic - Essays in Honor of Alan Robinson 1991: 542-564 - [c13]David W. Reed, Donald W. Loveland, Bruce T. Smith:
The Near-Horn Approach to Disjunctive Logic Programming. ELP 1991: 345-369 - [c12]David W. Reed, Donald W. Loveland, Bruce T. Smith:
An Alternative Characterization of Disjunctive Logic Programs. ISLP 1991: 54-68
1980 – 1989
- 1988
- [c11]Bruce T. Smith, Donald W. Loveland:
An nH-Prolog Implementation. CADE 1988: 766-767 - [c10]Bruce T. Smith, Donald W. Loveland:
A Simple Near-Horn Prolog Interpreter. ICLP/SLP 1988: 794-809 - 1987
- [j14]Donald W. Loveland:
Finding Critical Sets. J. Algorithms 8(3): 362-371 (1987) - [j13]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): 309-318 (1987) - [c9]Donald W. Loveland:
Near-Horn PROLOG. ICLP 1987: 456-469 - 1986
- [c8]Louis D. Duval, Yijie Han, Robert A. Wagner, Donald W. Loveland:
Finding Test-and-Treatment Procedures Using Parallel Computation. ICPP 1986: 688-690 - [c7]Donald W. Loveland:
Automated theorem proving: mapping logic into AI. ISMIS 1986: 214-229 - 1985
- [j12]Donald W. Loveland:
Performance Bounds for Binary Testing with Arbitrary Weights. Acta Informatica 22(1): 101-114 (1985) - 1983
- [c6]Donald W. Loveland, Marco Valtorta:
Detecting Ambiguity: An Example in Knowledge Evaluation. IJCAI 1983: 182-184 - 1982
- [e1]Donald W. Loveland:
6th Conference on Automated Deduction, New York, USA, June 7-9, 1982, Proceedings. Lecture Notes in Computer Science 138, Springer 1982, ISBN 3-540-11558-7 [contents] - 1981
- [j11]Donald W. Loveland, C. R. Reddy:
Deleting Repeated Goals in the Problem Reduction Format. J. ACM 28(4): 646-661 (1981) - 1980
- [c5]Donald W. Loveland, Robert E. Shostak:
Simplifying Interpreted Formulas. CADE 1980: 97-109
1970 – 1979
- 1978
- [b1]Donald W. Loveland:
Automated theorem proving: a logical basis. Fundamental studies in computer science 6, North-Holland 1978, ISBN 0720404991, pp. I-XIII, 1-405 - [c4]C. R. Reddy, Donald W. Loveland:
Presburger Arithmetic with Bounded Quantifier Alternation. STOC 1978: 320-325 - 1976
- [j10]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
- [j9]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) - [j8]Donald W. Loveland:
Position statement: mathematical computer science courses. ACM SIGCSE Bull. 6(3): 106-108 (1974) - [j7]Norman E. Gibbs, Donald W. Loveland, James M. Ortega:
The heart of computer science. ACM SIGCSE Bull. 6(4): 13-14 (1974) - 1973
- [c3]Donald W. Loveland, Mark E. Stickel:
A Hole in Goal Trees: Some Guidance from Resolution Theory. IJCAI 1973: 153-161 - 1972
- [j6]Donald W. Loveland:
A Unifying View of Some Linear Herbrand Procedures. J. ACM 19(2): 366-384 (1972)
1960 – 1969
- 1969
- [j5]Donald W. Loveland:
A Variant of the Kolmogorov Concept of Complexity. Inf. Control. 15(6): 510-526 (1969) - [j4]Donald W. Loveland:
Erratum: "Mechanical Theorem-Proving by Model Elimination". J. ACM 16(1): 646 (1969) - [j3]Donald W. Loveland:
A Simplified Format for the Model Elimination Theorem-Proving Procedure. J. ACM 16(3): 349-363 (1969) - [c2]Donald W. Loveland:
On Minimal-Program Complexity Measures. STOC 1969: 61-65 - 1968
- [j2]Donald W. Loveland:
Mechanical Theorem-Proving by Model Elimination. J. ACM 15(2): 236-251 (1968) - 1962
- [j1]Martin Davis, George Logemann, Donald W. Loveland:
A machine program for theorem-proving. Commun. ACM 5(7): 394-397 (1962) - 1960
- [c1]Herbert L. Gelernter, J. R. Hansen, Donald W. Loveland:
Empirical explorations of the geometry theorem machine. IRE-AIEE-ACM Computer Conference (Western) 1960: 143-149
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
