The expressive powers of stable models for bound and unbound DATALOG queries
From MaRDI portal
Publication:1362337
DOI10.1006/jcss.1997.1446zbMath0882.68088OpenAlexW2030648384MaRDI QIDQ1362337
Publication date: 3 August 1997
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1997.1446
Related Items (6)
On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach ⋮ atalog: A logic language for expressing search and optimization problems ⋮ Expressive power and complexity of partial models for disjunctive deductive databases ⋮ On the computational complexity of assumption-based argumentation for default reasoning. ⋮ Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). ⋮ Functional queries in datalog
Uses Software
Cites Work
- Procedural languages for database queries and updates
- Negation in rule-based database languages: A survey
- The expressive power of stratified logic programs
- The complexity of facets (and some facets of complexity)
- Why not negation by fixpoint?
- Stable and extension class theory for logic programs and default logics
- Multiple total stable models are definitely needed to solve unique solution problems
- Structure and complexity of relational queries
- The expressive powers of the logic programming semantics
- Horn clause queries and generalizations
- Languages that Capture Complexity Classes
- Negation as failure using tight derivations for general logic programs
- Short note preferred extensions are partial stable models
- A survey of complexity results for non-monotonic logics
- Autoepistemic logic
- The well-founded semantics for general logic programs
- On the equivalence of semantics for normal logic programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The expressive powers of stable models for bound and unbound DATALOG queries
