SLG System
SLG is a research-oriented system for deductive databases and
nonmonotonic reasoning. It is built as a meta interpreter on top of
existing Prolog systems. In addition to all the functionalities of
Prolog, SLG contains several features not usually found in logic
programming systems, including
- Query evaluation under the well-founded semantics using
SLG resolution.
- Query evaluation of deductive databases whose rules may have
explicit universal quantifiers in the body.
- Query answering under stable models.
- Abductive reasoning with integrity constraints.
- Skeptical reasoning with respect to the intersection of
stable models.
Functionalities and limitations of SLG, including examples
and sample traces, are described in
Extending Prolog with Nonmonotonic Reasoning.
The Prolog meta interpreter for SLG is in
slg.pl.
An experimental version of SLG implemented using SICStus Prolog and its
C interface is also available as
WFS.tar.gz.
All comments and bug reports are welcome (mail to:
wchen@seas.smu.edu).
The following are some other papers related to SLG:
-
W. Chen and D. S. Warren, "Tabled Evaluation with Delaying for General Logic Programs",
Journal of ACM. (to appear)
-
W. Chen, "Query Evaluation in Deductive Databases with Alternating Fixpoint
Semantics", ACM Transactions on Database Systems. (to appear)
-
W. Chen and D. S. Warren, "Computation of Stable Models and its Integration with
Logical Query Processing",
IEEE Transactions on Knowledge and Data Engineering. (to appear)
-
W. Chen, T. Swift and D. S. Warren, "Efficient Top-Down Computation of Queries under the
Well-Founded Semantics",
Journal of Logic Programming, 24(3), Pages 161--199, September 1995. (to appear)
-
J. Y. Liu, L. Adams and W. Chen, "Constructive Negation under the
Well-Founded Semantics",
Journal of Logic Programming, accepted.
Email: wchen@seas.smu.edu