S. Debray. SB-Prolog System, Version 3.0, A User Manual, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....novel transformation technique called unification factoring that can improve program speed and indexing for compiled code; ffl Source code availability for portability and extensibility. Many of the components of XSB are based on PSB Prolog [41] which itself is based on version 2. 0 of SB Prolog [12]. Though XSB can be used as a Prolog system, we avoid referring to XSB as such, because of the availability of SLG resolution and the handling of HiLog terms. These facilities, while seemingly simple, significantly extend its capabilities beyond those of a typical Prolog system. We feel that these ....

S. Debray. SB-Prolog System, Version 3.0, A User Manual, 1988.

....but it uses a deterministic rule rewrite execution model with predefined argument mode declarations, resembling the functionality provided by Strand [7] Term is implemented in term, imper, bnf, and regex as a compiler that translates term into C. It was bootstrapped using the SB Prolog compiler [5], and a semi automatic translation process. Inter operation with the imperative paradigm is provided by documenting the compiled form of the term predicates and providing access and constructor functions for the term abstract data type, in its converted form of C structures. Logic Programming ....

Debray SK (1988) The SB-Prolog System, Version 3.0: A UserManual. University of Arizona, Department of Computer Science, Tucson, AZ 85721, USA.

....to be executed is tabled. Facts do not need to be tabled as the XSB compiler uses efficient indexing techniques. The user can choose between manual tabling or auto tabling. XSB is not a very fast system, because its abstract machine is based on the non optimised abstract machine of SB Prolog [8]. 2.4 CLP(R) 1.2 CLP is a framework developed by Jaffar and Lassez [16] to introduce constraints in logic programming. Jaffar et al. [14] implemented CLP(R) a constraint logic programming system over the reals. It accepts 4 types of constraints: 1) functor constraints that are treated in the ....

S. Debray. SB-Prolog System, Version 3, A User Manual. Technical report, Dept. of Computer Science, SUNY at Stony Brook, 1988.

....tree, where it may loop in nitely. SLG evaluation, available in XSB, can correctly evaluate many such logic programs. To take the simplest of examples, any query to the program: 1 Many of the Prolog components of XSB are based on PSB Prolog [48] which itself is based on version 2. 0 of SB Prolog [13]. 1 CHAPTER 1. INTRODUCTION 2 : table ancestor 2. ancestor(X,Y) ancestor(X,Z) parent(Z,Y) ancestor(X,Y) parent(X,Y) will terminate in XSB, since ancestor 2 is compiled as a tabled predicate; Prolog systems, however, would go into an in nite loop. The user can declare that SLG ....

S. Debray. SB-Prolog System, Version 3.0, A User Manual, 1988.

....novel transformation technique called unification factoring that can improve program speed and indexing for compiled code; ffl Source code availability for portability and extensibility. Many of the components of XSB are based on PSB Prolog [28] which itself is based on version 2. 0 of SB Prolog [8]. Though XSB can be used as a Prolog system, we avoid referring to XSB as such, because of the availability of SLG resolution and the handling of HiLog terms. These facilities, while seemingly simple, significantly extend its capabilities beyond those of a typical Prolog system. We feel that these ....

S. Debray. SB-Prolog System, Version 3.0, A User Manual, 1988.

....but it uses a deterministic rule rewrite execution model with predefined argument mode declarations, resembling the functionality provided by Strand [7] Term is implemented in term, imper, bnf, and regex as a compiler that translates term into C. It was bootstrapped using the SB Prolog compiler [5], and a semi automatic translation process. Inter operation with the imperative paradigm is provided by documenting the compiled form of the term predicates and providing access and constructor functions for the term abstract data type, in its converted form of C structures. Logic Programming ....

Debray SK (1988) The SB-Prolog System, Version 3.0: A User Manual. University of Arizona, Department of Computer Science, Tucson, AZ 85721, USA.

....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 ....

S. Debray. The SB-Prolog System, Version 2.3.2: A User's Manual. Technical Report 87-15, Dept. of Computer Science, University of Arizona, March 1988.

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