The following pages link to Donald W. Loveland (Q287331):
Displaying 29 items.
- Mark Stickel: his earliest work (Q287332) (← links)
- Near-Horn prolog and beyond (Q757031) (← links)
- Performance bounds for binary testing with arbitrary weights (Q1083851) (← links)
- On the complexity of belief network synthesis and refinement (Q1207964) (← links)
- (Q1367082) (redirect page) (← links)
- The use of lemmas in the model elimination procedure (Q1367083) (← links)
- SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy (Q1877374) (← links)
- SATCHMORE: SATCHMO with RElevancy (Q1891262) (← links)
- Near-Horn Prolog and the ancestry family of procedures (Q1924724) (← links)
- (Q3216155) (← links)
- DPLL: The Core of Modern Satisfiability Solvers (Q3305326) (← links)
- Finding critical sets (Q3771640) (← links)
- (Q3880324) (← links)
- A comparison of three PROLOG extensions (Q3992235) (← links)
- A Hole in Goal Trees: Some Guidance from Resolution Theory (Q4088307) (← links)
- (Q4139711) (← links)
- (Q4391447) (← links)
- An Implementation of the Model Elimination Proof Procedure (Q4770008) (← links)
- (Q5397083) (← links)
- On minimal-program complexity measures (Q5402506) (← links)
- A New Interpretation of the von Mises' Concept of Random Sequence (Q5540430) (← links)
- Mechanical Theorem-Proving by Model Elimination (Q5544307) (← links)
- A Simplified Format for the Model Elimination Theorem-Proving Procedure (Q5574714) (← links)
- A variant of the Kolmogorov concept of complexity (Q5582801) (← links)
- The Kleene Hierarchy Classification of Recursively Random Sequences (Q5583065) (← links)
- (Q5600875) (← links)
- A machine program for theorem-proving (Q5621961) (← links)
- A Unifying View of Some Linear Herbrand Procedures (Q5655006) (← links)
- (Q5672215) (← links)
