D. Gabbay and U. Reyle, N-Prolog: An Extension to Prolog with Hypothetical Implications. I, Journal of Logic Programming 1, 1984, 319 -- 355. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Lexical Scoping As Universal Quantification - Miller (1989) (42 citations) (Correct)
....constructions described in [9] since it makes it possible to provide scope to individual, function, and predicate constants. The logic described in this paper is related to logics considered by many researchers in logic programming and, most recently, in theorem proving and type theory. See [3, 5, 7, 8, 14] for the description of closely logics applied to logic programming. Similar logics, especially higher order versions, have been used as meta languages in specifying and implementing theorem provers [2, 18, 19] The logic presented here is most closely related to the first order hereditary Harrop ....
....given local scope. Consider the following D formula. reverse(L,K) all rev ( all L (rev( L,L) all X,L,K,M (rev( X L] K,M) rev(L,K, X M] rev(L,K, Notice that the variables L and K are bound with different scopes in this clause. In attempting to prove the goal reverse([1,2,3],K) from this clause, an interpreter would first generate a new predicate symbol, say c, then add the Horn clauses c( L,L) c( X L] K,M) c(L,K, X M] to the current program, and then try to prove c( 1,2,3] K, After the answer substitution K = 3,2,1] is discovered, both c and the ....
[Article contains additional citation context not shown here]
D. Gabbay and U. Reyle, N-Prolog: An Extension to Prolog with Hypothetical Implications. I, Journal of Logic Programming 1, 1984, 319 -- 355.
Proof Procedures for Logic Programming - Donald W. Loveland, Gopalan.. (1994) (5 citations) (Correct)
....best known extension of pure Horn clause logic within the logic programming paradigm permits negation in goals, using the notion of negation as failure. However, the idea of using implications and universal quantifiers and, in fact, arbitrary logical connectives in goals has also been advocated [GR84a, LT84, McC88a, McC88b, Mil89b, MNPS91]. There is a wide spectrum of logical languages between those given by Horn clause logic and full quantificational logic, especially if the derivability relation to be used is also open to choice. An obvious question that arises in this situation is whether some of these languages provide more ....
D. Gabbay and U. Reyle. N-Prolog: An extension to Prolog with hypothetical implications I. Journal of Logic Programming, 1(4):319--355, 1984.
Uniform Provability in Classical Logic - Nadathur (1996) (8 citations) (Correct)
....[LR91, RLS91] Finally suppose that disjunction and is disallowed in the heads of program clauses but that the syntax for these formulas and goals is otherwise unaltered from the one presented at the beginning of this section. The resulting goals subsume (conjunctions of) the N clauses of [GR84]. In this context, the RESTART rule and only (restricted versions of) the degenerate forms of the ATOMIC and BACKCHAIN rules are relevant and our proof procedure reduces to (a simple generalization of) the QNR Prolog procedure described in [Gab85] An important aspect of the proof procedure we ....
D. Gabbay and U. Reyle. N-Prolog: An extension to Prolog with hypothetical implications I. Journal of Logic Programming, 1(4):319--355, 1984.
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