Also found in: Acronyms, Wikipedia.


(logic programming)
XSB extends the standard functionality of Prolog (being a descendant of PSB- and SB-Prolog) to include implementations of OLDT (tabling) and HiLog terms. OLDT resolution is extremely useful for recursive query computation, allowing programs to terminate correctly in many cases where Prolog does not. HiLog supports a type of higher-order programming in which predicate symbols can be variable or structured. This allows unification to be performed on the predicate symbols themselves in addition to the arguments of the predicates. Of course, Tabling and HiLog can be used together.

Version 1.2

ports: Sun, Solaris, NeXT, Linux, 386 BSD, IRIX, HP-UX

portability: Generally to 32-bit machines.

interpreter, preprocessor(HiLog), documentation

XSB research group / SUNY at Stony Brook


( E-mail: <xsb-contact@cs.sunysb.edu>.
Mentioned in ?
References in periodicals archive ?
The XSB token can be acquired during XSports' upcoming token sale campaign which will provide a fair and transparent distribution method for the community while funding further development and marketing for the platform.
The SLG-WAM of XSB currently implements early completion in the case where the subgoal is ground.
To determine the overhead of tabled negation in XSB for these programs, the first two rows of Table V compare the performance of tabling using (tnot/1) and Prolog-style negation (not/1).
Normalized CPU Times for Different Types of Negation in XSB even congested SLG-not/1 1 1 SLG-tnot/1 1.
7 of XSB offering an initial implementation of this engine.
As mentioned in the introduction, the tabling engine can efficiently perform mode and type analysis (among many others), and the results of such analysis can be fed back into the XSB compiler.
Normalized CPU Times for Executing Tabling Benchmarks Using XSB TC-chain TC-cycle TC-tree same gen.