Unifying functional, object-oriented and relational programming with logical semantics
Research directions in object-oriented programming
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Positive/negative conditional rewriting
1st international workshop on Conditional Term Rewriting Systems
Conditional specifications with inequational assumptions
1st international workshop on Conditional Term Rewriting Systems
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Objects, object types and object identification
Categorical methods in computer science with aspects from topology
The expressiveness of a family of finite set languages
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Subtyping in OODB's (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tractable query languages for complex object databases
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the expressive power of database queries with intermediate types
Journal of Computer and System Sciences
New data models and languages—the challenge
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The valid model semantics for logic programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Functional and predictive programming in OODB's
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Towards tractable algebras for bags
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data Type Specification: Parameterization and the Power of Specification Techniques
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
Naturally Embedded Query Languages
ICDT '92 Proceedings of the 4th International Conference on Database Theory
Towards tractable algebras for bags
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Typed query languages for databases containing queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A temporal paraconsistent relational algebra for incomplete and inconsistent information
ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
| Hi-index | 0.00 |
We consider the relationship between the deductive and the functional/algebraic query language paradigms. Previous works considered this subject for a non-recursive algebra, or an algebra with a fixed point operation, and the corresponding class of deductive queries is that defined by stratified programs. We consider here algebraic languages extended by general recursive definitions. We also consider languages that allow non-restricted use of negation. It turns out that recursion and negation in the algebraic paradigm need to be studied together. The semantics used for the comparison is the valid semantics, although other well-known declarative semantics can also be used to derive similar results. We show that the class of queries expressed by general deduction with negation can be captured using algebra with recursive definitions.