Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).
From MaRDI portal
Publication:1854304
DOI10.1006/inco.1999.2800zbMath1045.68514MaRDI QIDQ1854304
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1999.2800
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of facets (and some facets of complexity)
- Why not negation by fixpoint?
- Multiple total stable models are definitely needed to solve unique solution problems
- The expressive powers of stable models for bound and unbound DATALOG queries
- ``Possible is certain is desirable and can be expressive
- Structure and complexity of relational queries
- The complexity of selecting maximal solutions
- On the unique satisfiability problem
- A kripke-kleene semantics for logic programs*
- Autoepistemic logic
- The well-founded semantics for general logic programs
- Deterministic and non-deterministic stable models
- The expressive power of unique total stable model semantics
- Logic programming semantics made easy