Donald W. Loveland - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 43 from 43

2016

Mark Stickel: His Earliest WorkDonald W. Loveland. JAR, 56(2):99-112, 2016. [doi]

DPLL: The Core of Modern Satisfiability SolversDonald W. Loveland, Ashish Sabharwal, Bart Selman. In Eugenio G. Omodeo, Alberto Policriti, editors, Martin Davis on Computability, Computational Logic, and Mathematical Foundations. Volume 10 of Outstanding Contributions to Logic, pages 315-335, Springer, 2016. [doi]

2003

Satchmorebid: Satchmo(Re) with BIDirectional RelevancyDonald W. Loveland, Adnan H. Yahya. ngc, 21(3):177-207, 2003. [doi]

2000

Automated deduction: achievements and future directionsDonald W. Loveland. CACM, 43(11es):10, 2000. [doi]

1999

Automated Deduction: Looking AheadDonald W. Loveland. aim, 20(1):77-98, 1999.

1997

The Use of Lemmas in the Model Elimination ProcedureOwen L. Astrachan, Donald W. Loveland. JAR, 19(1):117-141, 1997.

1995

SATCHMORE: SATCHMO with REIevancyDonald W. Loveland, David W. Reed, Debra Sue Wilson. JAR, 14(2):325-351, 1995.

Uniform Proofs and Disjunctive Logic Programming (Extended Abstract)Gopalan Nadathur, Donald W. Loveland. lics 1995: 148-155

Near-Horn Prolog and the Ancestry Family of ProceduresDavid W. Reed, Donald W. Loveland. AMAI, 14(2-4):225-249, 1995.

1994

Proof Procedures for Disjunctive Logic ProgrammingDonald W. Loveland. gi 1994: 92

1992

A Comparison of Three Prolog ExtensionsDavid W. Reed, Donald W. Loveland. jlp, 12(1&2):25-50, 1992.

On the complexity of belief network synthesis and refinementMarco Valtorta, Donald W. Loveland. ijar, 7(3-4):121-148, 1992. [doi]

1991

1988

A Simple Near-Horn Prolog InterpreterBruce T. Smith, Donald W. Loveland. ICLP 1988: 794-809

An nH-Prolog ImplementationBruce T. Smith, Donald W. Loveland. cade 1988: 766-767

1987

Finding Test-and-Treatment Procedures Using Parallel ComputationLouis D. Duval, Robert A. Wagner, Yijie Han, Donald W. Loveland. jpdc, 4(3):309-318, 1987.

Near-Horn PROLOGDonald W. Loveland. ICLP 1987: 456-469

Finding Critical SetsDonald W. Loveland. jal, 8(3):362-371, 1987.

1986

Finding Test-and-Treatment Procedures Using Parallel ComputationLuis D. Duval, Yijie Han, Robert A. Wagner, Donald W. Loveland. icpp 1986: 688-690

Automated theorem proving: mapping logic into AIDonald W. Loveland. ismis 1986: 214-229 [doi]

1985

Performance Bounds for Binary Testing with Arbitrary WeightsDonald W. Loveland. ACTA, 22(1):101-114, 1985.

1983

Detecting Ambiguity: An Example in Knowledge EvaluationDonald W. Loveland, Marco Valtorta. IJCAI 1983: 182-184

1981

Deleting Repeated Goals in the Problem Reduction FormatDonald W. Loveland, C. R. Reddy. JACM, 28(4):646-661, 1981. [doi]

1980

Simplifying Interpreted FormulasDonald W. Loveland, Robert E. Shostak. cade 1980: 97-109

1978

Automated theorem proving: a logical basisDonald W. Loveland. Volume 6 of Fundamental studies in computer science, North-Holland, 1978. [doi]

Presburger Arithmetic with Bounded Quantifier AlternationC. R. Reddy, Donald W. Loveland. stoc 1978: 320-325

1976

A Hole in Goal Trees: Some Guidance from Resolution TheoryDonald W. Loveland, Mark E. Stickel. TC, 25(4):335-341, 1976.

1974

An Implementation of the Model Elimination Proof ProcedureS. Fleisig, Donald W. Loveland, A. K. Smiley III, D. L. Yarmush. JACM, 21(1):124-139, 1974. [doi]

The heart of computer scienceNorman E. Gibbs, Donald W. Loveland, James M. Ortega. SIGCSE, 6(4):13-14, 1974. [doi]

Position statement: mathematical computer science coursesDonald W. Loveland. SIGCSE, 6(3):106-108, 1974. [doi]

1973

A Hole in Goal Trees: Some Guidance from Resolution TheoryDonald W. Loveland, Mark E. Stickel. IJCAI 1973: 153-161

1972

A Unifying View of Some Linear Herbrand ProceduresDonald W. Loveland. JACM, 19(2):366-384, 1972. [doi]

1969

A Variant of the Kolmogorov Concept of ComplexityDonald W. Loveland. iandc, 15(6):510-526, December 1969.

On Minimal-Program Complexity MeasuresDonald W. Loveland. stoc 1969: 61-65

A Simplified Format for the Model Elimination Theorem-Proving ProcedureDonald W. Loveland. JACM, 16(3):349-363, 1969. [doi]

Erratum: Mechanical Theorem-Proving by Model Elimination Donald W. Loveland. JACM, 16(1):646, 1969. [doi]

1968

Mechanical Theorem-Proving by Model EliminationDonald W. Loveland. JACM, 15(2):236-251, 1968. [doi]

1962

A machine program for theorem-provingMartin Davis, George Logemann, Donald W. Loveland. CACM, 5(7):394-397, 1962. [doi]

1960

Empirical explorations of the geometry theorem machineHerbert L. Gelernter, J. R. Hansen, Donald W. Loveland. aieeire 1960: 143-149 [doi]

Sign in or sign up to see more results.

runs on WebDSL