D. Loveland

发表

A Linear Format for Resolution

D. Loveland, 1970 .

Empirical explorations of the geometry theorem machine

D. Loveland, H. Gelernter, J. Hansen, 1960, IRE-AIEE-ACM '60 (Western).

A New Interpretation of the von Mises' Concept of Random Sequence†

D. Loveland, 1966 .

The Kleene hierarchy classification of recursively random sequences

D. Loveland, 1966 .

A Variant of the Kolmogorov Concept of Complexity

Donald W. Loveland, D. Loveland, 1969, Information and Control.

A Hole in Goal Trees: Some Guidance from Resolution Theory

Mark E. Stickel, Donald W. Loveland, D. Loveland, 1973, IEEE Transactions on Computers.

A Simplified Format for the Model Elimination Theorem-Proving Procedure

Donald W. Loveland, D. Loveland, 1969, J. ACM.

Automated Theorem Proving: After 25 Years

W. Bledsoe, D. Loveland, 1984 .

An Implementation of the Model Elimination Proof Procedure

Donald W. Loveland, S. Fleisig, A. K. Smiley, 1974, JACM.

Empirical explorations of the geometry-theorem proving machine

D. Loveland, H. Gelernter, J. Hansen, 1995 .

A machine program for theorem-proving

Donald W. Loveland, Martin D. Davis, George Logemann, 2011, CACM.

A Other Related Work

David W. Etherington, M. Garey, D. Loveland, 1993 .

Deleting Repeated Goals in the Problem Reduction Format

Donald W. Loveland, C. R. Reddy, D. Loveland, 1981, JACM.

Arithmetic Circuit Complexity and Motion Planning Arithmetic Circuit Complexity and Motion Planning

D. Loveland, J. Reif, S. Tate, 1992 .

Arithmetic Circuit Complexity and Motion Planning

D. Loveland, J. Reif, S. Tate, 1991 .

A Near-horn Prolog for Compilation a Near-horn Prolog for Compilation

D. Loveland, David W. Reed, 1989 .

Near-Horn PROLOG

Donald W. Loveland, D. Loveland, 1987, ICLP.

Inference and Decision Mechanisms in Artificial Intelligence : Final Report

A. Biermann, D. Loveland, 2012 .

Uniform Proofs and Disjunctive Logic Programming (Extended

D. Loveland, Gopalan Nadathuri, 1995 .

An Alternative Characterization of Disjunctive Logic Programs an Alternative Characterization of Disjunctive Logic Programs

Donald W. Loveland, Bruce T. Smith, D. Loveland, 1991 .

A Unifying View of Some Linear Herbrand Procedures

Donald W. Loveland, D. Loveland, 1972, J. ACM.

Automated theorem proving: a logical basis

Donald W. Loveland, D. Loveland, 1978, Fundamental studies in computer science.

Part 1. Proof Theory

Donald W. Loveland, D. Loveland, 2014 .

Handbook of Logic in Artificial Intelligence and Logic Programming, Volume2, Deduction Methodologies

Gopalan Nadathur, Donald W. Loveland, A., 1994, Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 2.

Automated theorem proving: a logical basis

Donald W Loveland, D. Loveland, 1978, Fundamental studies in computer science.

Automated theorem proving: a quarter-century review

Donald W. Loveland, D. Loveland, 1984 .

Automated Deduction: Looking Ahead

Donald W. Loveland, D. Loveland, 1999, AI Mag..

Proof Procedures for Logic Programming Proof Procedures for Logic Programming Y 1 Building the Framework: the Resolution Procedure 1.1 the Resolution Procedure

D. Loveland, G. Nadathur, 1994 .

On minimal-program complexity measures

Donald W. Loveland, D. Loveland, 1969, STOC.

On the complexity of belief network synthesis and refinement

Donald W. Loveland, Marco Valtorta, D. Loveland, 1992, Int. J. Approx. Reason..

DPLL: The Core of Modern Satisfiability Solvers

Bart Selman, Ashish Sabharwal, Donald W. Loveland, 2016, Martin Davis on Computability, Computational Logic, and Mathematical Foundations.

6th Conference on Automated Deduction

Donald W. Loveland, D. Loveland, 1982, Lecture Notes in Computer Science.

Proof Procedures for Logic Programming

Gopalan Nadathur, Donald W. Loveland, D. Loveland, 1994 .

Presburger arithmetic with bounded quantifier alternation

Donald W. Loveland, C. R. Reddy, D. Loveland, 1978, STOC.

Near-Horn Prolog and the ancestry family of procedures

David W. Reed, Donald W. Loveland, D. Loveland, 2005, Annals of Mathematics and Artificial Intelligence.

Near-Horn Prolog and beyond

Donald W. Loveland, D. Loveland, 1991, Journal of Automated Reasoning.

The Near-Horn Approach to Disjunctive Logic Programming

David W. Reed, Donald W. Loveland, Bruce T. Smith, 1991, ELP.

METEORs: High Performance Theorem Provers Using Model Elimination

Owen L. Astrachan, Donald W. Loveland, D. Loveland, 1990, Automated Reasoning: Essays in Honor of Woody Bledsoe.

Mechanical Theorem-Proving by Model Elimination

Donald W. Loveland, D. Loveland, 1968, JACM.

A case-analysis approach to disjunctive logic programming

W D Reed, A. Biermann, D. Loveland, 1992 .

A Comparison of Three Prolog Extensions

David W. Reed, Donald W. Loveland, D. Loveland, 1992, J. Log. Program..

A Near-Horn Prolog for Compilation

David W. Reed, Donald W. Loveland, D. Loveland, 1991, Computational Logic - Essays in Honor of Alan Robinson.

Finding Test-and-Treatment Procedures Using Parallel Computation

Yijie Han, Robert A. Wagner, Donald W. Loveland, 1987, J. Parallel Distributed Comput..

The Graduate Course Advisor: A Multi-Phase Rule-Based Expert System

Donald W. Loveland, Marco Valtorta, Bruce T. Smith, 1984 .

SATCHMORE: SATCHMO with RElevancy

David W. Reed, Donald W. Loveland, Debra Sue Wilson, 1995, Journal of Automated Reasoning.

Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter

Raymond Reiter, Fiora Pirri, L. Bolc, 2001 .

Automated Deduction: Looking Ahead

D. Loveland, 1999, AI Mag..

Investigations in Model Elimination Based Theorem Proving

Owen L. Astrachan, J. Kemeny, D. Kreider, 1992 .

SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy

Adnan H. Yahya, Donald W. Loveland, D. Loveland, 2003, New Generation Computing.

Review: Robert Kowalski, Logic for Problem Solving

Donald W. Loveland, D. Loveland, 1982, Journal of Symbolic Logic (JSL).