G. Nadathur and D. Miller, An Overview of Prolog, Fifth International Conference on Logic Programming, MIT Press, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Finitary Partial Inductive Definitions as a General Logic - Lars-Henrik Eriksson (1994) (Correct)
....which represents logics using a dependent type system, and the metalogic of Isabelle [18] which uses higher order resolution. A third interesting approach is that of Felty [7, 8] Felty s work intends to specify theorem provers using a higher order logic programming language (specifically lProlog [17]) In that respect, her approach is quite similar to that of Isabelle in that languages of the lProlog family implement higher order resolution. There are, however, important differences in how the resolution mechanism is actually used. In particular, Felty s intention to specify theorem provers ....
Nadathur, G. and Miller, D.: An Overview of lProlog, Fifth International Conference of Logic Programming, pp. 810-827, MIT Press, 1988.
A Deductive Database Language Supporting Modules - Freitag (1992) (6 citations) (Correct)
....deductive database programs with negation and embedded implications. Our semantics extends that defined in [15] which has been restricted to positive programs. Furthermore, as opposed to most other query languages with embedded implications proposed in the literature before (see e.g. 15] [19] [2] 5] our language does not have a top down, SLD resolution based evaluation strategy like e.g. Prolog. Instead, a top down query compilation into an evaluating relational expression can be defined in analogy to ordinary deductive database programs. In a subsequent bottom up query evaluation ....
....to definite programs. In this section, we define the semantics of programs and queries with embedded implications in terms of a transformation into ordinary programs and queries. As opposed to most other query languages with embedded implications proposed in the literature before (see e.g. 15] [19] [2] 5] our language does not have a Prolog like topdown evaluation strategy. Instead, a resolution based top down query compilation into an evaluating relational expression is performed. The compilation step is defined in analogy to ordinary deductive database programs. In a subsequent ....
Nadathur G., Miller D.: An Overview of -Prolog, Proc. of the fifth International Conference on Logic Programming, MIT Press, 1988, pp. 810-827
Lexical Scoping As Universal Quantification - Miller (1989) (42 citations) Self-citation (Miller) (Correct)
....hereditary Harrop formulas presented in [14] it differs only in that we shall provide for more liberal forms of universal quantification in the body of program clauses. This logic, as well as several other extension to Horn clauses, are part of the experimental logic programming language Prolog [17]. The examples in this paper were developed and tested using the LP2.7 [13] and the eLP [1] implementations of Prolog. Although the scoping concepts described in this paper follow naturally from simple proof theoretical considerations, the resulting notions of module and abstract datatype ....
G. Nadathur and D. Miller, An Overview of Prolog, Fifth International Conference on Logic Programming, MIT Press, 1988.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC