David B. Sturgill, an American mathematician, computer scientist and associate professor at Department of Computer Science [1], Baylor University. His research interests covers parallel computation and its application to traditional artificial intelligence problems, including parallel search which involved the development of a parallel theorem prover called Distributed, Adaptive, Logical Inference (DALI), and Nagging, a parallelization technique designed to speed the solution of first-order inference problems by detecting and pruning unnecessary search, which is naturally fault tolerant and relatively robust in the presence of high communication latency [2].
David Sturgill [3]

Selected Publications

• David Sturgill, Alberto Maria Segre (1994). A Novel Asynchronous Parallelism Scheme for First-Order Logic. CADE'1994
• Alberto Maria Segre, David Sturgill (1994). Using Hundreds of Workstations to Solve First-Order Logic Problems. AAAI'1994
• David Sturgill, Alberto Maria Segre (1997). Nagging: A Distributed, Adversarial Search-Pruning Technique Applied to First-Order Inference. Journal of Automated Reasoning, Vol. 19, No. 3 ^[5]

External Links

• David Sturgill
• The Mathematics Genealogy Project - David Sturgill

References

1. ^ Baylor University | Texas Engineering College, Top Engineering Graduate School, Texas Computer Science, Texas Computer Science Degree
2. ^ David Sturgill, Alberto Maria Segre (1994). A Novel Asynchronous Parallelism Scheme for First-Order Logic. CADE'1994
3. ^ David Sturgill
4. ^ DBLP: David B. Sturgill
5. ^ Nagging from Wikipedia

What links here?