cdwfs is a system for computing the D-WFS semantics of
first order disjunctive logic programs with constraints.
This system has been developed as a part of the research project
DisLoP
funded by
DFG.
Some papers you should read on D-WFS with constraints:
S. Brass, J. Dix:
A General Approach to Bottom-Up Computation
of Disjunctive Semantics.
In: J. Dix, L. Pereira, T. Przymusinski (eds.):
Non-Monotonic Extensions of Logic Programming.,
Pages 127-155, LNAI 927, Springer, Berlin.
Get
the Paper.
J. Dix, F. Stolzenburg:
A Framework to Incorporate Non-Monotonic Reasoning
into Constraint Logic Programming.
In: J. Dix, L.M. Pereira and T. Przymusinski (eds.):
Non-Monotonic Extensions of Logic Programming.,
pages 208-235, LNAI 1216, Springer, Berlin. April 1997.
Extended version will appear in a special Issue of
Journal of Logic Programming in early 1998.
See also Fachberichte Informatik 16/97,
Universität Koblenz.
F. Stolzenburg, O. Obst:
Reasoning with Constraints and Well-Founded Negation.
In: P. Baumgartner (ed.):
Jahrestreffen der GI-Fachgruppe 1.2.1 (Deduktionssysteme) --
Kurzfassung der Vorträge., pages 9-10,
Fachberichte Informatik 23/97, Universität Koblenz.
The cdwfs program computes from an input program
the residual program or program remainder, from which the D-WFS
semantics can be read off directly.
cdwfs was written in Eclipse Prolog by
Oliver Obst and
Frieder Stolzenburg.
You can get the prototype implementation with brief documentation (postscript and also plain text) and examples as a gzipped tar file.
If you have questions or comments, please send an email to Frieder Stolzenburg or Oliver Obst.