The expressive power of unique total stable model semantics
From MaRDI portal
(Redirected from Publication:4572012)
Recommendations
- The expressive powers of stable models for bound and unbound DATALOG queries
- Multiple total stable models are definitely needed to solve unique solution problems
- ``Possible is certain is desirable and can be expressive
- Complexity of the Stable Model Semantics for Queries on Incomplete Databases
- Functional queries in datalog
Cites work
- ``Possible is certain is desirable and can be expressive
- Autoepistemic logic
- scientific article; zbMATH DE number 3474957 (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 194907 (Why is no real title available?)
- Multiple total stable models are definitely needed to solve unique solution problems
- On non-determinism in machines and languages
- On the unique satisfiability problem
- Relative complexity of checking and evaluating
- Structure and complexity of relational queries
- The well-founded semantics for general logic programs
- Why not negation by fixpoint?
Cited in
(5)- Multiple total stable models are definitely needed to solve unique solution problems
- Extending and implementing the stable model semantics
- Complexity and expressive power of deterministic semantics for DATALOG^ .
- Functional queries in datalog
- The expressive power of ``possible-is-certain semantics (extended abstract)
This page was built for publication: The expressive power of unique total stable model semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4572012)
