Shmuel Kliger and Ehud Shapiro. A decision tree compilation algorithm for FCP(---,:,?). In Fifth International Conference and Symposium on Logic Programming, Seattle, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Implementation Techniques for Prolog - Krall (1994) (3 citations) (Correct)
....coding, where n is the size of a whole line and m so small that m times number of arguments is n 2. Variables are either represented by a special column or by hash values with all bits set to 1 or 0. The CAM is fast, but too special and expensive to be used in general purpose computer systems. In [KS88] Kliger and Shapiro describe an algorithm for the compilation of an FCP( procedure into a control flow decision tree that analyses the possible data states in a procedure call. This tree is translated to a header for the corresponding machine code of the predicate. At run time the ....
Shmuel Kliger and Ehud Shapiro. A decision tree compilation algorithm for FCP(---,:,?). In Fifth International Conference and Symposium on Logic Programming, Seattle, 1988.
A Propositional Meta-Constraint System: Specification, Application .. - Ward (1993) (Correct)
....how our addition example could be programmed in a simple constraint system. If the store is limited to containing uninterpreted functions and constants, but one may ask more complex constraints which will suspend until the necessary variables become ground (such a system is offered by FCP( [76, 35, 32]) then the solution is the following CHAPTER 1. INTRODUCTION 25 Program 1.9 add(X,Y,Z) 9(Sum) Sum = X Y)# : Z = Sum , stop 2 9(Diff) Diff = Z Gamma X)# : Y = Diff , stop 2 9(Diff) Diff = Z Gamma Y)# : X = Diff , stop If one or both of the variables to the right of the equality in ....
Shmuel Klinger and Ehud Shapiro. A decision tree compilation algorithm for FCP(---,:,?). In Kowalski and Bowen [37], pages 1315--1336.
Improving Backward Execution in the Andorra Family of.. - Abreu, Pereira, Codognet (1992) (2 citations) (Correct)
....control strategy, and a more adequate search strategy that reduces the overall number of inferences needed to solve the problem can make up for a slower inference speed. Moreover, a few implementations of concurrent languages now achieve raw speeds close to that of traditional Prolog systems, cf. [8, 14, 9]. Among all the concurrent logic languages, see [22] for a complete presentation and a detailed history of this programming paradigm, the Andorra family of languages is one of the most promising lines of research in this quest to tame parallelism and concurrency, as they try to encompass both ....
Shmuel Klinger and Ehud Shapiro. A decision tree compilation algorithm for FCP (I , : , ?). In Kowalski and Bowen [15], pages 1315--1336.
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