An Intuitionistic Approach to Logic Programming

• A natural extension of SLD-resolution is introduced as a goal directed proof procedure for the full first order implicational fragment of intuitionistic logic. Its intuitionistic semantic fits a procedural interpretation of logic programming. By allowing arbitrary nested implications it can be used for implementing modularity in logic programs. With adequate negation axioms it gives an alternative to negation as failure and leads to a proof procedure for full first order predicate logic.

$Rev: 13581$