Several features of the XSB Logic Programming System make it suitable as a database engine including: its foundation on SLG resolution, its efficiency for memory-resident queries, and its flexibility for for data modelling. SLG resolution is a goal-directed resolution strategy that uses memoing and delay to compute the well-founded semantics for general programs. In doing so, XSB eliminates problems with literal ordering and with redundant computations so common when languages like Prolog are used for data-oriented applications. XSB extends the WAM (Warren Abstract Machine)[31] to implement SLG resolution. The implementation has been completed for (modularly) stratified programs, and comparisons indicate that XSB is significantly faster tha...
© Springer-Verlag Berlin Heidelberg 1998. The SLG-WAM implements tabling by freezing the WAM stacks:...
AbstractThe use of tabling in logic programming allows bottom-up evaluation to be incorporated in a ...
AbstractGlobal SLS-resolution is a well-known procedural semantics for top–down computation of queri...
This paper describes the XSB system, and its use as an in-memory deductive database engine. XSB bega...
LabBase is a generic database management system for implementation of laboratory information systems...
SLG is a table-oriented resolution method that is gaining increasing attention due to its ability to...
Tabling can be implemented in a (WAM-based) Prolog system by means of SLG-WAM: consumers suspend and...
Recently tuple-at-a-time evaluation strategies have begun receiving renewed attention for in-memory ...
An accident of implementation may be responsible for the fact that Logic Programming, Deductive Data...
1 Introduction XSB (see [19]) is a standard Prolog system extended with tabled resolution.Tabled res...
XSB [14] is a tabled logic programming system designed to address shortcomings in Prolog's SLD ...
AbstractThe well-founded semantics has gained wide acceptance partly because it is a skeptical seman...
This paper addresses the correctness of the SLG-WAM for definite programs, and describes its archite...
AbstractThe attributed variable data type plays an important role in many extensions to the basic Lo...
Starting from a theoretical understanding of the issues involved in the implementation of a heap gar...
© Springer-Verlag Berlin Heidelberg 1998. The SLG-WAM implements tabling by freezing the WAM stacks:...
AbstractThe use of tabling in logic programming allows bottom-up evaluation to be incorporated in a ...
AbstractGlobal SLS-resolution is a well-known procedural semantics for top–down computation of queri...
This paper describes the XSB system, and its use as an in-memory deductive database engine. XSB bega...
LabBase is a generic database management system for implementation of laboratory information systems...
SLG is a table-oriented resolution method that is gaining increasing attention due to its ability to...
Tabling can be implemented in a (WAM-based) Prolog system by means of SLG-WAM: consumers suspend and...
Recently tuple-at-a-time evaluation strategies have begun receiving renewed attention for in-memory ...
An accident of implementation may be responsible for the fact that Logic Programming, Deductive Data...
1 Introduction XSB (see [19]) is a standard Prolog system extended with tabled resolution.Tabled res...
XSB [14] is a tabled logic programming system designed to address shortcomings in Prolog's SLD ...
AbstractThe well-founded semantics has gained wide acceptance partly because it is a skeptical seman...
This paper addresses the correctness of the SLG-WAM for definite programs, and describes its archite...
AbstractThe attributed variable data type plays an important role in many extensions to the basic Lo...
Starting from a theoretical understanding of the issues involved in the implementation of a heap gar...
© Springer-Verlag Berlin Heidelberg 1998. The SLG-WAM implements tabling by freezing the WAM stacks:...
AbstractThe use of tabling in logic programming allows bottom-up evaluation to be incorporated in a ...
AbstractGlobal SLS-resolution is a well-known procedural semantics for top–down computation of queri...