The expressive power of unique total stable model semantics
From MaRDI portal
Publication:4572012
DOI10.1007/3-540-63165-8_237zbMath1401.68027MaRDI QIDQ4572012
Sergio Greco, Domenico Saccà, Francesco Buccafurri
Publication date: 4 July 2018
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63165-8_237
Related Items
Cites Work
- Why not negation by fixpoint?
- Relative complexity of checking and evaluating
- Multiple total stable models are definitely needed to solve unique solution problems
- ``Possible is certain is desirable and can be expressive
- On non-determinism in machines and languages
- Structure and complexity of relational queries
- On the unique satisfiability problem
- Autoepistemic logic
- The well-founded semantics for general logic programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item