Extensions to logic programming motivated by the construction of a
generic theorem prover.
| Elsa L. Gunter |
| AT&T Bell Labs |
Abstract:
In this article, we discuss several possible extensions to traditional
logic programming languages.
The specific extensions proposed here fall into two categories:
logical extensions and the addition of constructs to allow for
increased control. There is a unifying theme to the proposed logical
extensions, which is the scoped introduction of extensions to a
programming context. More specifically these extensions are the
ability to introduce variables whose scope is limited to the term in
which they occur (i.e.
-bound variables within
-terms), the ability to introduce into a goal a fresh constant
whose scope is limited to the derivation of that goal, and the ability
to introduce into a goal a program clause whose scope, once again, is
limited to the derivation of that goal. The purpose of the additions
for increased control are to facilitate the raising and handling of
failures, or exceptions, and continuation thereafter.
To motivate these various extensions, we have repeatedly appealed to
examples related to the construction of a generic theorem prover. It
is our thesis that this problem domain is specific enough to lend
focus when one is considering various language constructs, and yet
complex enough to encompass many of the general difficulties found in
other areas of symbolic computation.
Bibtex Entry
@inproceedings{lpmod,
author = "Elsa L. Gunter",
title = "Extensions to Logic Programming Motivated by the
Construction of a Generic Theorem Prover",
booktitle = "Extension of Logic Programming",
publisher = "Springer-Verlag",
year = 1989,
editor = "P. Schoeder-Heister",
volume = 475,
series = "Lecture Notes in Artificical Intelligence",
pages = "223--245",
month = "December"
}
Postscript version of paper
Back to
bibliography
Elsa Gunter