BCN Prototype - An implementation of Constructive
BCN Prototype is a sound and complete implementation of constructive
negation for the whole class of normal logic programs.
has been implemented in SICStus Prolog 3.10.1.
theoretical foundations of this implementation come from Shepherdson’s
operators provide a bottom-up scheme for computing literal answers, that is
the basis of our implementation.
constraint solver that we have implemented obtains the literal answers in an
efficient, incremental and lazy way.
The procedural mechanism for goal computation, not
only obtains all the correct answers for a given goal, but also detects
failure. In spite of the bottom-up nature of the answers calculation, the
procedural mechanism is in charge of detecting when a goal should fail.
If you have any question or find any bug, please contact: firstname.lastname@example.org
This work has been partially supported by the Spanish Project TIC
Last Modified: April 2004