Foundations of logic programming
Foundations of logic programming
Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Optimizing existential datalog queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A further note on looping in Prolog
ACM SIGPLAN Notices
On eliminating loops in Prolog
ACM SIGPLAN Notices
Graph Theory With Applications
Graph Theory With Applications
Visualizing and querying software structures
ICSE '92 Proceedings of the 14th international conference on Software engineering
Proceedings of the 30th IEEE symposium on Foundations of computer science
Reasoning About Equations and Functional Dependencies on Complex Objects
IEEE Transactions on Knowledge and Data Engineering
On Reasoning about Structural Equality in XML: A Description Logic Approach
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Reasoning about Uniqueness Constraints in Object Relational Databases
IEEE Transactions on Knowledge and Data Engineering
Visualizing and querying software structures
CASCON '91 Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research
Sequence-based abstract interpretation of Prolog
Theory and Practice of Logic Programming
On reasoning about structural equality in XML: a description logic approach
Theoretical Computer Science - Database theory
Visualizing and querying software structures
CASCON First Decade High Impact Papers
| Hi-index | 0.00 |
When a database query is expressed as a set of Horn clauses whose execution is by top-down resolution of goals, there is a need to improve the backtracking behavior of the interpreter. Rather than putting on the programmer the onus of using extra-logical operators such as cut to improve performance, we show that some uses of the cut can be automated by inferring them from functional dependencies. This requires some knowledge of which variables are guaranteed to be bound at query execution time; we give a method for deriving such information using data flow analysis.