T. Swift and D. S. Warren. An abstract machine for SLG resolution. In Proc. of the Symp. on Logic Programming, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....stream, sequences and simple variables. ffl Adding tabulation of functions to a real Prolog system, hopefully representing tables using some of the data structures mentioned above. ffl Investigating the possibility of exploiting tabulation of functions in SLG resolution [9] and the XSB engine [30]. ffl Running benchmarks to measure the time and space requirements with and without tabulation and for various data structures. ffl Investigating a programming methodology that is supported by this form of tabulation. ffl Writing larger application programs that use this form of tabulation. ....

Swift, T. and Warren, D. S., An Abstract Machine for SLG Resolution, Technical report, Dept. of Computer Science, SUNY at Stony Brook, 1994.

....WAM model as the process engine, based upon a system called NanoProlog, developed at our Department by A. M. Dias [13] However, it is possible to include any self contained Prolog as the process engine in the PVM Prolog system. The integration of other engines such as SICStus Prolog [21] and XSB [11] is under way. Parallel Prolog systems supporting forms of implicit parallelism are also natural candidates. This allows to compose a distributed system including conventional Prolog processes and specialized Prolog systems, possibly exploiting internal forms of concurrency and parallelism. As an ....

.... Logic Programming Languages PVM Prolog is currently being used to support the development of high level logic programming languages, such as the PROLOPPE language [17] It is also being used to support the distribution control and communication components of existing logic languages, such as XSB [11] [20] a logic programming system with tabulation. Due to generic nature of the PVM Prolog interface, most of the low level tasks involving parallelism and communication control, as well as all most dependencies from the hardware and operating system environment, are hidden to the language ....

T. Swift, D.S. Warren. An Abstract Machine for SLG Resolution. Procs. of the Symposium of Logic Programming, pp. 663-654, 1994.

....full details of SLG have been presented elsewhere. 3] describes the resolution method itself; 2] discusses algorithms, especially incremental completion algorithms, for implementing SLG. SLG is implemented in the XSB programming system by the SLG WAM, an emulator for SLG based on the WAM [20] [16] discusses the data structures, algorithms and instructions of the SLG WAM. Table access has proven to be a significant and interesting implementation problem, and is discussed separately in [10] Finally, the SLG WAM, currently restricted to modularly stratified programs, forms the engine of the ....

....choose between SLG and SLD evaluation. Predicates in XSB are executed using SLDNF by default and can be declared tabled either by the user on a per predicate basis, or by the system on a per module basis through the directive : table all. The SLG WAM overhead for SLD resolution is minimal. [16] compares the SLGWAM with an equivalent WAM emulator and indicates that the SLG WAM adds about a 15 overhead for standard benchmarks. So that when XSB is used simply as a Prolog system (i.e. no predicates are tabled) it is reasonably competitive with other Prolog implementations based on a WAM ....

[Article contains additional citation context not shown here]

T. Swift and D. S. Warren. An abstract machine for SLG resolution. In Proc. of the Symp. on Logic Programming, 1994.

....are two freely available implementations that make use of the algorithms in this paper. The SLG system, which is a meta interpreter written in Quintus Prolog, implements the algorithms fully. Another, the SLG WAM of XSB compiles a restriction of SLG for left to right modularly stratified programs[25]. The SLGWAM is currently being extended to evaluate the full SLG resolution) To get a rough idea how the meta interpreter and XSB perform, we took the benchmark programs reported in [13] together with their timing information, and then ran them using the meta interpreter and XSB. However, it ....

Swift, T. and Warren, D. S. An abstract machine for SLG resolution. In Intl. Logic Programming Symposium, 1994.

....details of SLG have been presented elsewhere. 3] describes the resolution method itself, while [2] discusses algorithms, especially incremental completion algorithms, for implementing SLG. SLG is implemented in the XSB programming system by the SLG WAM, an emulator for SLG based on the WAM [21] [15] discusses the data structures, algorithms and instructions of the SLG WAM. Table access has proven to be a significant and interesting implementation problem, and is discussed separately from the rest of the SLG WAM in [9] Finally, the SLG WAM, currently restricted to modularly stratified ....

....SLG and SLD evaluation. Predicates in XSB are executed using SLDNF by default and can be declared tabled either by the user on a per predicate basis, or by the system on a per module basis through the directive : table all. It should be noted that SLG WAM overhead for SLD resolution is minimal. [15] compares the SLG WAM with an equivalent WAM emulator and indicates that the SLG WAM adds about a 15 overhead for standard benchmarks. As a Prolog system using only SLD, XSB runs slightly slower than emulated SICStus, and is about three times slower than Quintus 3 . Despite much folklore, the ....

[Article contains additional citation context not shown here]

T. Swift and D. S. Warren. An abstract machine for SLG resolution. Technical report, SUNY at Stony Brook, 1994. Submitted.

....ACCESS PROBLEM 2 [11] as implemented in the XSB system[9] indicate that XSB is an order of magnitude faster than comparable deductive database systems for in memory queries 2 . We believe that the main reason for the difference in speed is due to the fact that the engine of XSB, the SLG WAM[12], uses a paradigm, the WAM, more mature than implementation paradigms available to set at a time methods. Broadly speaking, the compiler for the SLG WAM analyzes programs at a low level, at the level of clause variables and WAM registers, while the magic compilers analyze programs at a higher ....

T. Swift and D. S. Warren. An abstract machine for SLG resolution. Technical report, State University of New York at Stony Brook, 1994. Submitted.

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