Bottom-up beats top-down for datalog
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of Logic Programming
Handbook of theoretical computer science (vol. B)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Magic templates: a spellbinding approach to logic programs
Journal of Logic Programming
Modular stratification and magic sets for Datalog programs with negation
Journal of the ACM (JACM)
Bottom-up evaluation and query optimization of well-founded models
Theoretical Computer Science
The aditi deductive database system
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
A Computational Model for Functional Logic Deductive Databases
Proceedings of the 17th International Conference on Logic Programming
A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
A Demand Driven Computation Strategy for Lazy Narrowing
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
TOY: A Multiparadigm Declarative System
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Proving Failure in Functional Logic Programs
CL '00 Proceedings of the First International Conference on Computational Logic
A Computational Model for Functional Logic Deductive Databases
Proceedings of the 17th International Conference on Logic Programming
Database query languages and functional logic programming
New Generation Computing
| Hi-index | 0.00 |
This paper adds the handling of negative information to a functional-logic deductive database language. By adopting as semantics for negation the so-called CRWLF, wherein the negation is intended as 'finite failure' of reduction, we will define Herbrand algebras and models for this semantics and a fix point operator to be used in a new goaldirected bottom-up evaluation mechanism based on magic transformations. This bottom-up evaluation will simulate the top-down one of the original program; in fact, it will carry out a goal-directed lazy evaluation.