Carlsson, M. and J. Widen (1988). SICStus Prolog User's Manual.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....whole computation to be considered as successful; background processes are created at run time by the evaluation of an active tuple write. They act as demons on the the blackboard and their termination is of no concern for the success of the computation. Prolog D Linda [118] and SICStus Prolog [36] are extensions of Prolog including Linda primitives to access a tuple space as well. However, these languages have not been conceived to be a full integration of the two models. In particular, a blackboard only acts as communication media between pairs of processes. 2.9 Related Paradigms ....

M. Carlsson, J. Widen, J. Andersson, N. Andersson, K. Boortz, and T. Sjoland. SICStus Prolog User's Manual. Technical Report T91:11B, SICS, Kista, Sweden, 1991.

....explained before, the Mercury version would not be well moded, so that we will restrict our benchmarking activity to the Prolog and functional versions. The efficiency of the implementations depends crucially on the ability of the compiler to support arrays properly. The SICStus Prolog compiler [7] uses the functor metacall predicate to allocate a contiguous block of store, so that arrays with constant time access can be built. To compile the Miranda code we use our own FAST compiler [11] which offers efficient array primitives. Table 1 shows the experimental results obtain for the ....

M. Carlsson, J. Wid'en, J. Andersson, S. Andersson, K. Boortz, H. Nilsson, and Th. Sjoland. SICStus Prolog Users's Manual. Swedish Institute of Comp. Sci, Kista, Sweden, Jan 1993.

....the advantages of the use of anonymous variables. We shall return to their use within the context of specific programs. Anonymous variables form a simple and elegant device which sometimes increases the readability of programs in a remarkable way. Modern versions of Prolog, like SICStus Prolog [CW93], encourage the use of anonymous variables by issuing a warning if a non anonymous variable that occurs only once in a clause is encountered. We incorporate both of these syntactic facilities into pure Prolog. 5.1.2 Computing We now explain the computation process used in Prolog. First of all, ....

M. Carlsson and J. Wid'en. SICStus Prolog User's Manual. SICS, P.O. Box 1263, S-164 28 Kista, Sweden, January 1993.

....excellent optimization by modern C compilers, the sequential core of KLIC shows reasonable performance. For a set of standard benchmark programs that use common features of Prolog and KL1, KLIC runs about twice as fast as native machine code generated by a widely used Prolog system, SICStus Prolog [1]. This was reconfirmed by the two versions of the KL1 to C compiler, one in Prolog and another in KL1 itself 2 . While SICStus generates machine code directly, KLIC s code generation is indirect through C. Deeper analysis of the generated code revealed that the lack of backtracking benefited ....

Mats Carlsson, Johan Wid'en, Johan Andersson, Stefan Andersson, Kent Brootz, Hans Nilsson, and Thomas Sjoland. SICStus Prolog User's Manual, 1993.

....approach to achieving improved performance in logic programming systems. Existing systems are based largely on local analysis (i.e. clause level or, at most, procedure level, as in the WAM) Such techniques have already brought substantial performance improvements to popular Prolog systems [2, 7, 29]. However, global analysis offers the potential to attain substantially better object code and therefore even higher execution speeds. The purpose of dataflow analysis is to determine, at compile time, properties of the terms that variables can be bound to, at runtime, at different points in a ....

M. Carlsson. Sicstus Prolog User's Manual. Po Box 1263, S-16313 Spanga, Sweden, February 1988.

....not the physical one so that the blackboard data are preserved) 7 Related Work MultiBinProlog is certainly not the only Linda like parallel logic programminglanguage in existence today. Several Linda like primitives have been incorporated in the languages Linda D Prolog [14] Sicstus Prolog [3] and FLiPSiDE [13] None of these languages however feature such a tight integration between Prolog and the coordination component as 2 Log does. Shared Prolog [2] and PoliS [5] also have such a tight integration and offer a similar functionality but they differ from 2 Log at the ....

M. Carlsson, J. Widen, J. Andersson, S. Andersson, K. Boortz, H. Nilsson, and T. Sjoland. SICStus Prolog User's Manual. SICS technical report T91:11B, SICS, Kista, Sweden, 1991.

....the constructors appearing in the rules. 6 Experimental Results We have developed a C emulator of the BAM on Sun 4 workstations under UNIX. In order to compare Babel with PROLOG, we have tested some simple and classical benchmarks (see Figure 8) by using the BAM emulator and SICStus Prolog V0.7 [6], a commercial Prolog written in C. QueensN is the well known problem to place N queens, which cannot attack each other, on a N ThetaN chess board. The PROLOG version has been taken from [37] RingsN computes the numbers M (1 M N) which are equal to the number of rings with M elements. Finally, ....

Carlsson, M., SICSTUS PROLOG User's Manual, S-16313, Spanga, Sweden, 1988.

....As explained before, the Mercury version would not be well moded, so that we will restrict our benchmarking activity to the Prolog and functional versions. The eciency of the implementations depends crucially on the ability of the compiler to support arrays properly. The SICStus Prolog compiler [25] uses the functor metacall predicate to allocate a contiguous block of store, so that arrays with constant time access can be built. To compile the Miranda code we use our own FAST compiler [26] This compiler o ers ecient array primitives. The most important of these is the one dimensional ....

M. Carlsson, J. Widen, J. Andersson, S. Andersson, K. Boortz, H. Nilsson, and Th. Sjoland. SICStus Prolog Users's Manual. Swedish Institute of Comp. Sci, Kista, Sweden, Jan 1993.

....discuss directional types as a means for controlling execution of logic programs through a delay mechanism. The idea is to postpone unification of those arguments of the goal which do not satisfy the prescribed type. The principle is reminiscent of that used in existing Prolog systems, like e.g. [14], where an atomic subgoal can be delayed if some of its arguments are not sufficiently instantiated. However, our delays concern unification of single arguments, while Prolog suspends resolution steps. We define formally an execution mechanism, called type driven resolution (or simply ....

....in every incomplete derivation tree which can be constructed under the considered computation rule. The concept of well typed position gives a sufficient condition identifying such arguments for Prolog computation rule. 6 Type driven resolution Several existing Prolog systems (like e.g. [14]) provide delaying primitives, which allow for suspension of resolution of the selected goal until it is sufficiently instantiated, for example until some of its arguments are ground. The non suspension condition can often be formalized as a type of the atom, typically the groundness of some ....

M. Carlsson, J. Wid'en, J. Andersson, S. Andersson, K. Boortz and T. Sjoland. SICStus Prolog user's manual . SICS, Box 1263, S-164 28 Kista, Sweden.

....[17] The Parma system was not available for us, so we used the benchmark data reported in [13] As you can see in table 1 our compiler produces faster code than the Aquarius system. We compared the compile time of the VAM 1P compiler to that of the VAM 2P and SICStus intermediate code translators [5]. It shows that it is about ten times slower than the VAM 2P translator but about two times faster than the SICStus compiler (see table 2) The Aquarius compiler is by a factor of 2000 slower than the VAM 2P translator. A direct comparison is not possible since it is a three pass compiler which ....

Mats Carlsson and J. Widen. SICStus Prolog user's manual. Research Report R88007C, SICS, 1990.

....They also use an advanced cut scheme (cut counters scheme [12] for reducing the speculative work. The Bristol scheduler also uses the cut counters scheme to distinguish between speculative and non speculative work. Both Aurora and Muse are based on the same sequential Prolog, SICStus version 0. 6 [10], and are implemented on the same Sequent Symmetry, but they are based on two different storage models. The Muse system is based on incremental stack copying [1] whereas the Aurora system is based on the SRI model [18] The differences between the current implementations of the new Muse ....

Mats Carlsson, et al. SICStus Prolog User's Manual. SICS Technical Report T91:11B, October 1991.

....or in a continuous inequality. In the former case it can either be a vector of constants or a vector of discrete variables; both of these correspond to the traditional use of the element 3 (Marriott Stuckey 1998) constraint found in all major CP systems and libraries (e.g. Dincbas et al. 1988; Carlsson 1995)) This constraint takes the form elementFD(I, X 1 ; Xn] Y ) where I is an integer variable with domain D I = f1; ng, indexing the list, and Y = X I . Here we will consider the second case, elementLP (I, X 1 ; Xn] Y ) where I is still a discrete, indexing variable, ....

Carlsson, M. 1995. SICStus Prolog User's Manual. SICS research report, Swedish Institute of Computer Science.

....The choice of Prolog as an implementation language for the equation solver for CLP( led to a reduction in code size by an order of magnitude. Beside the principal (software engineering) issues that motivated our implementation of CLP( the availability and the quality of Sicstus Prolog (Carlsson Widen 1990) somehow aposteriori justified the selection of Prolog as an implementation language. Sicstus Prolog has a compiler which can produce native machine code and a garbage collector. The basic mechanisms provided for the implementation of freeze 2 and dif 2 are very useful for the implementation of ....

Carlsson, M., Widen, J. (1990). Sicstus Prolog user's manual, SICS/R88 /88007C, Swedish Institute of Computer Science, Kista, Sweden.

No context found.

M. Carlsson, J. Widn, J. Andersson, S. Andersson, K. Boortz, H. Nilsson, T. Sjland, SICStus Prolog User's Manual , SICS technical report T91:11B, September 1991

No context found.

Carlsson, M. and J. Widen (1988). SICStus Prolog User's Manual.

No context found.

M. Carlsson. Sicstus Prolog User's Manual. Po Box 1263, S-16313 Spanga, Sweden, February 1988.

No context found.

M. Carlsson, J. Wid'en, J. Andersson, S. Andersson, K. Boortz, H. Nilsson, and Th. Sjoland. SICStus Prolog Users's Manual. Swedish Institute of Comp. Sci, Kista, Sweden, Jan 1993.

No context found.

M. Carlsson and J. Widen. Sicstus Prolog User's Manual. Po Box 1263, S-16313 Spanga, Sweden, April 1994.

No context found.

M. Carlsson and J. Widen. Sicstus Prolog User's Manual. Po Box 1263, S-16313 Spanga, Sweden, April 1994.

No context found.

M. Carlsson. Sicstus Prolog User's Manual. Po Box 1263, S-16313 Spanga, Sweden, February 1988.

No context found.

M. Carlsson. Sicstus Prolog User's Manual. Po Box 1263, S-16313 Spanga, Sweden, February 1988.

No context found.

M. Carlsson. Sicstus Prolog User's Manual. Po Box 1263, S-16313 Spanga, Sweden, February 1988.

No context found.

M. Carlsson. Sicstus Prolog User's Manual. Po Box 1263, S-16313 Spanga, Sweden, February 1988.

No context found.

M. Carlsson, J. Wid'en, J. Andersson, S. Andersson, K. Boortz, H. Nilsson, and Th. Sjoland. SICStus Prolog Users's Manual. Swedish Institute of Comp. Sci, Kista, Sweden, Jan 1993.

No context found.

M. Carlsson. Sicstus Prolog User's Manual. Po Box 1263, S-16313 Spanga, Sweden, February 1988.

First 50 documents  Next 50

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