> NEGATION < |
Constructive Negation
Inclusion of negation into logic programs is considered traditionally to be painful as the incorporation of full logic negation tends to super-exponencial time complexity of the prover. Therefore the alternative approaches to negation in logic programs are studied and among them, the procedural negation as failure sounds to be the most successful and the most widely used. With the spread of Constraint Logic Programming (CLP), the other approach called constructive negation becomes more popular. The reasons for acceptance of constructive negation are the preservation of the advantages of the negation as failure, i.e., efficiency and handling special features of the language, and, at the same time, removing the main drawbacks, i.e., handling ground negative subgoals and usage as a test only. The
Aim of the Project The aim of the project is to provide a framework for natural implementation of constructive negation. Currently, we investigate the possibility to extend the proposed framework to Hierarchical Constraint Logic Programming. The project covers: Software To test our research ideas we have implemented the proposed algorithms in Prolog. Note that these programs are software prototypes. Publications Constructive Negation and Constraints (download) Support The project is supported in part by: [Constraints] [Negation] [Meta-interpreters] [Media Analysis] |
||||
Charles
University |
|