Foundations of logic programming
Foundations of logic programming
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Relational queries computable in polynomial time (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Integrating object-oriented data modelling with a rule-based programming paradigm
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semantics and expressiveness issues in active databases (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Heraclitus: elevating deltas to be first-class citizens in a database programming language
ACM Transactions on Database Systems (TODS)
Managing conflicts between rules (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Annals of Mathematics and Artificial Intelligence
Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs
IEEE Transactions on Knowledge and Data Engineering
RQL: A Recursive Query Language
IEEE Transactions on Knowledge and Data Engineering
On Implementing a Language for Specifying Active Database Execution Models
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Database querying under changing preferences
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
In this paper we argue with a basic premise in logic programming research that the meaning of a program can be inferred from its syntax alone. We show that users may have a variety of intended models for programs and that a single program may give different intended models under different assumptions of semantics. Our conclusion is that it is impossible to infer the intended model from the syntax of the program and no single semantics will capture all the intended models. We propose as a solution an explicit specification of control. Towards this purpose we define a rule algebra. The user formulates a program as an algebraic specification that directs the execution towards the intended model. The interesting question at that point is how to efficiently implement such programs. We show a natural and easy transformation such that it takes as input an algebraic specification and produces as output a program belonging to a subclass of locally stratified programs. Moreover, there is a homomorphic correspondence between the algebraic expressions and their translations.