The expressive powers of stable models for bound and unbound DATALOG queries
From MaRDI portal
(Redirected from Publication:1362337)
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
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 4147465 (Why is no real title available?)
- scientific article; zbMATH DE number 4160107 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 1398073 (Why is no real title available?)
- A survey of complexity results for non-monotonic logics
- Autoepistemic logic
- Horn clause queries and generalizations
- Languages that Capture Complexity Classes
- Multiple total stable models are definitely needed to solve unique solution problems
- Negation as failure using tight derivations for general logic programs
- Negation in rule-based database languages: A survey
- On the equivalence of semantics for normal logic programs
- Procedural languages for database queries and updates
- Short note preferred extensions are partial stable models
- Stable and extension class theory for logic programs and default logics
- Structure and complexity of relational queries
- The complexity of facets (and some facets of complexity)
- The expressive power of stratified logic programs
- The expressive powers of the logic programming semantics
- The well-founded semantics for general logic programs
- Why not negation by fixpoint?
Cited in
(10)- On the semantics of abstract argumentation frameworks: a logic programming approach
- Functional queries in datalog
- On the computational complexity of assumption-based argumentation for default reasoning.
- On acceptance conditions in abstract argumentation frameworks
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).
- \(\mathcal {NPD}\)atalog: A logic language for expressing \(\mathcal {NP}\) search and optimization problems
- The expressive power of unique total stable model semantics
- Complexity of the Stable Model Semantics for Queries on Incomplete Databases
- Expressive power and complexity of partial models for disjunctive deductive databases
- The expressive power of ``possible-is-certain semantics (extended abstract)
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)
