The expressive powers of stable models for bound and unbound DATALOG queries
From MaRDI portal
Publication:1362337
DOI10.1006/JCSS.1997.1446zbMATH Open0882.68088OpenAlexW2030648384MaRDI QIDQ1362337FDOQ1362337
Authors: Domenico Saccà 
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
Recommendations
- scientific article; zbMATH DE number 1059307
- Complexity of the Stable Model Semantics for Queries on Incomplete Databases
- Expressiveness of logic programs under the general stable model semantics
- Publication:4943320
- The expressive power of higher-order Datalog
- The Complexity and Expressive Power of Limit Datalog
- Circumscribing DATALOG: expressive power and complexity
- Expressive power and complexity of partial models for disjunctive deductive databases
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The well-founded semantics for general logic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Autoepistemic logic
- Languages that Capture Complexity Classes
- Title not available (Why is that?)
- The complexity of facets (and some facets of complexity)
- Negation in rule-based database languages: A survey
- On the equivalence of semantics for normal logic programs
- Title not available (Why is that?)
- Horn clause queries and generalizations
- Structure and complexity of relational queries
- A survey of complexity results for non-monotonic logics
- Short note preferred extensions are partial stable models
- Why not negation by fixpoint?
- Stable and extension class theory for logic programs and default logics
- The expressive powers of the logic programming semantics
- Procedural languages for database queries and updates
- The expressive power of stratified logic programs
- Negation as failure using tight derivations for general logic programs
- Multiple total stable models are definitely needed to solve unique solution problems
- Title not available (Why is that?)
Cited In (10)
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).
- The expressive power of ``possible-is-certain semantics (extended abstract)
- Functional queries in datalog
- Expressive power and complexity of partial models for disjunctive deductive databases
- On the semantics of abstract argumentation frameworks: a logic programming approach
- On the computational complexity of assumption-based argumentation for default reasoning.
- The expressive power of unique total stable model semantics
- Complexity of the Stable Model Semantics for Queries on Incomplete Databases
- On acceptance conditions in abstract argumentation frameworks
- \(\mathcal {NPD}\)atalog: A logic language for expressing \(\mathcal {NP}\) search and optimization problems
Uses Software
This page was built for publication: The expressive powers of stable models for bound and unbound DATALOG queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362337)
