The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Logic and Data Bases
Relational queries computable in polynomial time (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
On the implementation of a simple class of logic queries for databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Logic and databases: a critique
ACM SIGACT News
Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Evaluation of database recursive logic programs as recurrent function series
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Query processing in deductive databases with incomplete information
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Logic and databases: a critique
ACM SIGPLAN Notices
A graphical query language supporting recursion
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries
IEEE Transactions on Software Engineering
On compile-time query optimization in deductive databases by means of static filtering
ACM Transactions on Database Systems (TODS)
On the expressive power of database queries with intermediate types
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Moving Selections into Linear Least Fixpoint Queries
IEEE Transactions on Knowledge and Data Engineering
RQL: A Recursive Query Language
IEEE Transactions on Knowledge and Data Engineering
Translation and Optimization of Logic Queries: The Algebraic Approach
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Data constructors: on the integration of rules and relations
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
Guarded open answer set programming
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Guarded open answer set programming with generalized literals
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
A UNIVERSAL MODEL FOR NON-PROCEDURAL DATABASE LANGUAGES
Fundamenta Informaticae
| Hi-index | 0.00 |
A logic program consists of a set of Horn clauses, and can be used to express a query on relational data bases. It is shown that logic programs express precisely the queries in YE+ (the set of queries representable by a fixpoint applied to a positive existential query). Queries expressible by logic programs are thus not first order queries in general; nor are all the first order queries expressible as logic programs. A way of adding the negation operator to logic programs is suggested. The resulting set of clausal queries equals FP, the set of first order queries closed under fixpoints (as well as ¬, ∨, 3).