On constructive negation for disjunctive logic programs
Proceedings of the 1990 North American conference on Logic programming
A bottom-up semantics for constructive negation
Proceedings of the eleventh international conference on Logic programming
Default rules: an extension of constructive negation for narrowing-based languages
Proceedings of the eleventh international conference on Logic programming
Compiling intensional sets in CLP
Proceedings of the eleventh international conference on Logic programming
What is failure?: an approach to constructive negation
Acta Informatica
Negation and constraint logic programming
Information and Computation
Constructive Negation Using Typed Existence Properties
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Compilative Constructive Negation in Constraint Logic Programs
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Extending Constructive Negation for Partial Functions in Lazy Functional-logic Languages
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Practical methods for proving termination of general logic programs
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
This paper presents an implementation of a constructive negation method. The constructive negation method makes use of type dependencies between arguments of a predicate to rewrite negative goals in a logic program. The constructive negation method is first reformulated as a derivation rule. Then an algorithm for efficiently implementing the derivation rule is presented and its complexity is analyzed.