## User login## Navigation |
## 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 goal-directed 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 lambda-Prolog. A classic... Abstract logic programming is expored in a more introductory manner in this paper. |
## Browse archives## Active forum topics |

## Recent comments

2 hours 11 min ago

3 hours 28 min ago

4 hours 5 min ago

4 hours 22 min ago

4 hours 36 min ago

4 hours 54 min ago

4 hours 58 min ago

5 hours 1 min ago

5 hours 6 min ago

5 hours 13 min ago