About XSB

Tabled Resolution

Tabled resolution is useful for recursive query computation, allowing programs to terminate correctly in many cases where Prolog does not. Users interested in Parsing, Program Analysis, Model-checking, Data Mining and Diagnosis may benefit from XSB.

XSB's Tabling implementation:

Indexing of Dynamic Code

XSB contains a variety of features to support in-memory data-oriented applications. Using these features, knowledge bases of up to one million clauses can be quickly loaded and efficiently indexed.

HiLog Compilation

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.

XSB's HiLog implementation:


Supported interfaces for XSB include:

XSB has been tested on over a dozen hardware and operating system platforms under Microsoft Windows 95/98, Windows NT, and various versions of 32-bit UNIX. XSB 2.0 has been ported to 64-bit architectures and has been tested on 64-bit SGI machines. Various versions of XSB have been used to construct large-scale commercial systems for the U.S. Customs Service, the U.S. Defense Logistics Agency, the National Security Agency, and Medicine Rules, Inc.

Feedback: The XSB Development Team

$Date: 1999/05/18 15:51:15 $