The expressive power of stratified logic programs
From MaRDI portal
Recommendations
Cites work
- Contributions to the Theory of Logic Programming
- Elementary induction on abstract structures
- Fixed-point extensions of first-order logic
- Horn clause queries and generalizations
- scientific article; zbMATH DE number 4199654 (Why is no real title available?)
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 4008383 (Why is no real title available?)
- scientific article; zbMATH DE number 4035805 (Why is no real title available?)
- scientific article; zbMATH DE number 4185010 (Why is no real title available?)
- Relational queries computable in polynomial time
- Structure and complexity of relational queries
Cited in
(40)- Datalog extensions for database queries and updates
- Why not negation by fixpoint?
- On the expressive power of database queries with intermediate types
- The expressive power of the bounded-iteration construct
- Capturing complexity classes by fragments of second-order logic
- The functional dimension of inductive definitions
- Testing logic programs for local stratification
- Verifying local stratifiability of logic programs and databases
- Expressive power and complexity of partial models for disjunctive deductive databases
- Semantics and expressiveness issues in active databases
- The expressive power of stratified logic programs with value invention
- Stratified least fixpoint logic
- Non-determinism in logic-based languages
- The expressive powers of stable models for bound and unbound DATALOG queries
- Polynomial-time computable stable models
- Abduction from logic programs: Semantics and complexity
- Program schemes, arrays, Lindström quantifiers and zero-one laws
- Functional queries in datalog
- The expressive powers of the logic programming semantics
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
- The expressiveness of locally stratified programs
- Complexity and undecidability results for logic programming
- scientific article; zbMATH DE number 1696722 (Why is no real title available?)
- On Q-resolution and CDCL QBF solving
- scientific article; zbMATH DE number 4199653 (Why is no real title available?)
- scientific article; zbMATH DE number 4147555 (Why is no real title available?)
- The defining power of stratified and hierarchical logic programs
- Subsumption-stratified datalog
- scientific article; zbMATH DE number 515730 (Why is no real title available?)
- On the impact of stratification on the complexity of nonmonotonic reasoning
- A finite-model-theoretic view on propositional proof complexity
- Complexity and expressive power of second-order extended Horn logic
- A declarative extension of horn clauses, and its significance for Datalog and its applications
- Semantics and expressive power of nondeterministic constructs in deductive databases
- Bottom-up evaluation and query optimization of well-founded models
- Can't you answer while you wait?
- Hypothetical answers to continuous queries over data streams
- Convergence of datalog over (pre-) semirings
- NP-completeness by first-order and quantifier-free interpretations and related topics
- Negation in rule-based database languages: A survey
This page was built for publication: The expressive power of stratified logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803773)
