User loginNavigation 
Uniform Proofs as a Foundation for Logic ProgrammingUniform Proofs as a Foundation for Logic Programming (Dale Miller, Gopalan Nadathur, Frank Pfenning & Andre Scedrov 1989/1991) introduces the concept of unirform provability, which is fundamental to abstract logic programming, which in turn drives much of the more principled work in modern logic programming. In particular, this paper (i) shows that logics that support uniform provability support goaldirected proof search, and so may be used as the foundation of a logic programming language, and (ii) the notion of uniform provability may be used to explore new forms of logic programming, in particular introducing the class of hereditary Harrop formulae which underlies lambdaProlog. A classic... Abstract logic programming is expored in a more introductory manner in this paper. 
Browse archivesActive forum topics

Recent comments
6 days 22 hours ago
1 week 4 days ago
1 week 5 days ago
1 week 5 days ago
2 weeks 4 days ago
3 weeks 2 hours ago
3 weeks 2 hours ago
3 weeks 2 hours ago
4 weeks 2 days ago
4 weeks 3 days ago