BCN Prototype - An implementation of Constructive Negation

• The BCN Prototype is a sound and complete implementation of constructive negation for the whole class of normal logic programs.

• It has been implemented in SICStus Prolog 3.10.1.

• The theoretical foundations of this implementation come from Shepherdson’s operators.

• These operators provide a bottom-up scheme for computing literal answers, that is the basis of our implementation.

• The 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.

    Downloads:

• BCN Prototype (for Windows): installationV101.zip
• BCN Prototype User's Manual: manual.pdf
• Program examples: programs.zip
• Some explanations about the above program examples: examples.pdf
• Technical report The BCN Prototype: An implementation of constructive negation:  BCN_TR.pdf

If you have any question or find any bug, please contact: jibalgij@si.ehu.es

This work has been partially supported by the Spanish Project TIC 2001-2476-C03

Last Modified: April 2004