Donald W. Loveland

44 papers A* 5A 3B 2C 1Journal 24Unranked 7

Year	Rank	Type	Title / Venue / Authors
2016	—	`ch.`	DPLL: The Core of Modern Satisfiability Solvers. Martin Davis on Computability, Computational Logic, and Mathematical Foundations Donald W. Loveland, Ashish Sabharwal, Bart Selman
2016	J	`jnl`	Mark Stickel: His Earliest Work. J. Autom. Reason. Donald W. Loveland
2003	J	`jnl`	Satchmorebid: Satchmo(Re) with BIDirectional Relevancy. New Gener. Comput. Donald W. Loveland, Adnan H. Yahya
2000	J	`jnl`	Automated deduction: achievements and future directions. Commun. ACM Donald W. Loveland
1999	J	`jnl`	Automated Deduction: Looking Ahead. AI Mag. Donald W. Loveland
1997	J	`jnl`	The Use of Lemmas in the Model Elimination Procedure. J. Autom. Reason. Owen L. Astrachan, Donald W. Loveland
1995	J	`jnl`	Near-Horn Prolog and the Ancestry Family of Procedures. Ann. Math. Artif. Intell. David W. Reed, Donald W. Loveland
1995	J	`jnl`	SATCHMORE: SATCHMO with REIevancy. J. Autom. Reason. Donald W. Loveland, David W. Reed, Debra Sue Wilson
1995	A*	`conf`	Uniform Proofs and Disjunctive Logic Programming (Extended Abstract) LICS Gopalan Nadathur, Donald W. Loveland
1994	—	`conf`	Proof Procedures for Disjunctive Logic Programming. GI Jahrestagung Donald W. Loveland
1992	J	`jnl`	A Comparison of Three Prolog Extensions. J. Log. Program. David W. Reed, Donald W. Loveland
1992	J	`jnl`	On the complexity of belief network synthesis and refinement. Int. J. Approx. Reason. Marco Valtorta, Donald W. Loveland
1991	—	`conf`	A Near-Horn Prolog for Compilation. Computational Logic - Essays in Honor of Alan Robinson Donald W. Loveland, David W. Reed
1991	—	`conf`	An Alternative Characterization of Disjunctive Logic Programs. ISLP David W. Reed, Donald W. Loveland, Bruce T. Smith
1991	—	`conf`	METEORs: High Performance Theorem Provers Using Model Elimination. Automated Reasoning: Essays in Honor of Woody Bledsoe Owen L. Astrachan, Donald W. Loveland
1991	J	`jnl`	Near-Horn Prolog and Beyond. J. Autom. Reason. Donald W. Loveland
1991	—	`conf`	The Near-Horn Approach to Disjunctive Logic Programming. ELP David W. Reed, Donald W. Loveland, Bruce T. Smith
1988	—	`conf`	A Simple Near-Horn Prolog Interpreter. ICLP/SLP Bruce T. Smith, Donald W. Loveland
1988	A	`conf`	An nH-Prolog Implementation. CADE Bruce T. Smith, Donald W. Loveland
1987	J	`jnl`	Finding Critical Sets. J. Algorithms Donald W. Loveland
1987	J	`jnl`	Finding Test-and-Treatment Procedures Using Parallel Computation. J. Parallel Distributed Comput. Louis D. Duval, Robert A. Wagner, Yijie Han, Donald W. Loveland
1987	B	`conf`	Near-Horn PROLOG. ICLP Donald W. Loveland
1986	C	`conf`	Automated theorem proving: mapping logic into AI. ISMIS Donald W. Loveland
1986	B	`conf`	Finding Test-and-Treatment Procedures Using Parallel Computation. ICPP Louis D. Duval, Yijie Han, Robert A. Wagner, Donald W. Loveland
1985	J	`jnl`	Performance Bounds for Binary Testing with Arbitrary Weights. Acta Informatica Donald W. Loveland
1983	A*	`conf`	Detecting Ambiguity: An Example in Knowledge Evaluation. IJCAI Donald W. Loveland, Marco Valtorta
1982	A	`ed.`	6th Conference on Automated Deduction, New York, USA, June 7-9, 1982, Proceedings CADE Donald W. Loveland
1981	J	`jnl`	Deleting Repeated Goals in the Problem Reduction Format. J. ACM Donald W. Loveland, C. R. Reddy
1980	A	`conf`	Simplifying Interpreted Formulas. CADE Donald W. Loveland, Robert E. Shostak
1978	—	`book`	Automated theorem proving: a logical basis. Donald W. Loveland
1978	A*	`conf`	Presburger Arithmetic with Bounded Quantifier Alternation STOC C. R. Reddy, Donald W. Loveland
1976	J	`jnl`	A Hole in Goal Trees: Some Guidance from Resolution Theory. IEEE Trans. Computers Donald W. Loveland, Mark E. Stickel
1974	J	`jnl`	An Implementation of the Model Elimination Proof Procedure. J. ACM S. Fleisig, Donald W. Loveland, A. K. Smiley III, D. L. Yarmush
1974	J	`jnl`	Position statement: mathematical computer science courses. ACM SIGCSE Bull. Donald W. Loveland
1974	J	`jnl`	The heart of computer science. ACM SIGCSE Bull. Norman E. Gibbs, Donald W. Loveland, James M. Ortega
1973	A*	`conf`	A Hole in Goal Trees: Some Guidance from Resolution Theory. IJCAI Donald W. Loveland, Mark E. Stickel
1972	J	`jnl`	A Unifying View of Some Linear Herbrand Procedures. J. ACM Donald W. Loveland
1969	J	`jnl`	A Simplified Format for the Model Elimination Theorem-Proving Procedure. J. ACM Donald W. Loveland
1969	J	`jnl`	A Variant of the Kolmogorov Concept of Complexity Inf. Control. Donald W. Loveland
1969	J	`jnl`	Erratum: "Mechanical Theorem-Proving by Model Elimination". J. ACM Donald W. Loveland
1969	A*	`conf`	On Minimal-Program Complexity Measures STOC Donald W. Loveland
1968	J	`jnl`	Mechanical Theorem-Proving by Model Elimination. J. ACM Donald W. Loveland
1962	J	`jnl`	A machine program for theorem-proving. Commun. ACM Martin Davis, George Logemann, Donald W. Loveland
1960	—	`conf`	Empirical explorations of the geometry theorem machine. IRE-AIEE-ACM Computer Conference (Western) Herbert L. Gelernter, J. R. Hansen, Donald W. Loveland