Multiple total stable models are definitely needed to solve unique solution problems
From MaRDI portal
(Redirected from Publication:1349967)
Recommendations
- Deterministic and non-deterministic stable models
- The expressive power of unique total stable model semantics
- Complexity and expressive power of deterministic semantics for DATALOG^ .
- The expressive powers of stable models for bound and unbound DATALOG queries
- ``Possible is certain is desirable and can be expressive
Cites work
- Autoepistemic logic
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3872640 (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 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 1142327 (Why is no real title available?)
- Languages that Capture Complexity Classes
- On the unique satisfiability problem
- Structure and complexity of relational queries
- The complexity of facets (and some facets of complexity)
- Why not negation by fixpoint?
Cited in
(5)- Circumscribing DATALOG: expressive power and complexity
- The expressive powers of stable models for bound and unbound DATALOG queries
- Complexity and expressive power of deterministic semantics for DATALOG^ .
- The expressive power of unique total stable model semantics
- Totality, determinism and functionality problems in (incomplete) abstract argumentation frameworks
This page was built for publication: Multiple total stable models are definitely needed to solve unique solution problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349967)