Lee Naish. Heterogeneous SLD resolution. The Journal of Logic Programming, 1(4):297--303, December 1984. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Improving Backward Execution in the Andorra Family of.. - Abreu, Pereira, Codognet (1992) (2 citations) (Correct)
....Such a re ordering of the continuation goals (goals that remain in the resolvent) upon backtracking, based only on the information of which is the current failing goal, can thus save much deduction backtracking work. This simple idea has indeed been first proposed by Lee Naish for some years[19] as an example of heterogeneous SLD resolution. A related computation rule is presented, and it is argued that it is a form of intelligent backtracking. However, such a strategy is not well suited to the computational model of Prolog as implemented for example by stack based architectures such as ....
Lee Naish. Heterogeneous SLD resolution. The Journal of Logic Programming, 1(4):297--303, December 1984.
Improving Backward Execution in Non-Deterministic.. - Abreu, Pereira, Codognet (1992) (Correct)
....Such a re ordering of the continuation goals (goals that remain in the resolvent) upon backtracking, based only on the information of which is the current failing goal, can thus save much deduction backtracking work. This simple idea has indeed been first proposed by Lee Naish for some years[12] as an example of heterogeneous SLD resolution. A related computation rule is presented, and it is argued that it is a form of intelligent backtracking. However, such a strategy is not well suited to the computational model of Prolog as implemented for example by stack based architectures such as ....
Lee Naish. Heterogeneous SLD resolution. The Journal of Logic Programming, 1(4):297--303, December 1984.
A Confluent Semantic Basis For The Analysis Of.. - Codish, Falaschi, .. (1994) (Correct)
....generalizes in a sense the standard result for logic programming, i.e. Theorem 9.2 in [15] Theorem 4 in [29] for moded equational programs, and Theorem 3.7 in [23] for determinate concurrent constraint programs. In particular, this result could be applied to definite programs with delay [21]. Independence of scheduling in the confluent semantics for fair infinite computations generalizes Theorem 6.5 [14] for logic programming. Our definition of suspension is the one generally assumed in the context of concurrent (constraint) logic languages [24, 26] The definition of local ....
L. Naish. Heterogeneous SLD resolution. Journal of Logic Programming, 1(4), 1984.
Suspension Analyses for Concurrent Logic Programs - Codish, Falaschi, Marriott (1994) (10 citations) (Correct)
....with the atom, rather than suspending only if this is true for all such clauses. A more complex modification, giving rise to a better floundering analysis, is to associate the remaining defining clauses with each atom in the state. This corresponds to abstracting the HSLD operational semantics [18] for these languages. Each of these modifications gives rise to a floundering analysis for logic languages with delay. In order to prove that these floundering analyses are correct, the key technical result required is an analogue of Theorem 4.11. That is, that the scheduling rule used in the ....
L. Naish. Heterogeneous SLD resolution. Journal of Logic Programming, 1(4), 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