The generalized counting method for recursive logic queries
Theoretical Computer Science - First International Conference on Database Theory, Rome, September 1986
Bottom-up beats top-down for datalog
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the power of Alexander templates
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)
Magic templates: a spellbinding approach to logic programs
Journal of Logic Programming
Logic programming with functions and predicates: the language Babel
Journal of Logic Programming
A general framework for semantics-based bottom-up abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bottom-up evaluation and query optimization of well-founded models
Theoretical Computer Science
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
The aditi deductive database system
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
A Domain-theoretic Approach to Integrating Functional and Logic Database Languages
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
A Demand Driven Computation Strategy for Lazy Narrowing
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
A General Scheme for Constraint Functional Logic Programming
Proceedings of the Third International Conference on Algebraic and Logic Programming
Higher-order narrowing with definitional trees
Journal of Functional Programming
A Computational Model for Functional Logic Deductive Databases
Proceedings of the 17th International Conference on Logic Programming
| Hi-index | 0.00 |
In this paper we start the design of a functional-logic deductive database language. Given that most logic deductive languages consider bottom-up evaluation as operational mechanism, here we will focus on the development of an operational semantics based on bottom-up evaluation for functional logic languages. As in the logic paradigm, the bottom-up evaluation will consist in a magic transformation for a given program-query into a magic program-query for which the bottom-up evaluation will simulate the top-down one of the original program.