Negations and quantifiers in NU-Prolog
Proceedings on Third international conference on logic programming
Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Intensional negation of logic programs: examples and implementation techniques
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
A transformational approach to negation in logic programming
Journal of Logic Programming
Handbook of theoretical computer science (vol. B)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Compile-time derivation of variable dependency using abstract interpretation
Journal of Logic Programming
The Go¨del programming language
The Go¨del programming language
Default rules: an extension of constructive negation for narrowing-based languages
Proceedings of the eleventh international conference on Logic programming
Cardinality analysis of Prolog
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
What is failure?: an approach to constructive negation
Acta Informatica
Information and Computation
Lower bound cost estimation for logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Logic Programming with Bounded Quantifiers
Proceedings of the First Russian Conference on Logic Programming
Compilative Constructive Negation in Constraint Logic Programs
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Efficient Negation Using Abstract Interpretation
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
| Hi-index | 0.00 |
Knowledge representation based applications require a more complete set of capabilities than those offered by conventional Prolog compilers. Negation is, probably, the most important one. The inclusion of negation among the logical facilities of LP has been a very active area of research, and several techniques have been proposed. However, the negation capabilities accepted by current Prolog compilers are very limited. In this paper, we discuss the possibility to incorporate some of these techniques in a Prolog compiler in an efficient way. Our idea is to mix some of the existing proposals guided by the information provided by a global analysis of the source code.