Journal of Logic Programming
Relational queries computable in polynomial time
Information and Control
Journal of Logic Programming
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
On the declarative semantics of logic programs with negation
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Every logic program has a natural stratification and an iterated least fixed point model
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A procedural semantics for well founded negation in logic programs
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programming as constructivism: a formalization and its application to databases
PODS '89 Proceedings of the eighth 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
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming
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
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Adding disjunction to datalog (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Programming with non-determinism in deductive databases
Annals of Mathematics and Artificial Intelligence
Semantics and expressiveness of disjunctive ordered logic
Annals of Mathematics and Artificial Intelligence
Computation of Stable Models and Its Integration with Logical Query Processing
IEEE Transactions on Knowledge and Data Engineering
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
Dynamic Programming in Datalog with Aggregates
IEEE Transactions on Knowledge and Data Engineering
Enhancing Disjunctive Datalog by Constraints
IEEE Transactions on Knowledge and Data Engineering
Multiagent Compromises, Joint Fixpoints, and Stable Models
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
New Generation Computing
Magic sets and their application to data integration
ICDT'05 Proceedings of the 10th international conference on Database Theory
| Hi-index | 0.00 |
We compare the expressive powers of three semantics for deductive databases and logic programming: the 3-valued program completion semantics, the well-founded semantics, and the stable semantics, We identify the expressive power of the stable semantics, and in fairly general circumstances that of the well-founded semantics.Over infinite Herbrand models, where the three semantics have equivalent expressive power, we also consider a notion of uniform translatability between the 3-valued program completion and well-founded semantics. In this sense of uniform translatability we show the well-founded semantics to be more expressive.