Deterministic and non-deterministic stable models
From MaRDI portal
Publication:4365319
DOI10.1093/logcom/7.5.555zbMath0883.68031OpenAlexW1882786502MaRDI QIDQ4365319
Publication date: 4 November 1997
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f1f2af25fc7b9288e44beec498ce81494d73b4e2
Related Items (5)
A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness ⋮ Approximating operators and semantics for abstract dialectical frameworks ⋮ Expressive power and complexity of partial models for disjunctive deductive databases ⋮ Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). ⋮ Functional queries in datalog
This page was built for publication: Deterministic and non-deterministic stable models