On the expressibility of stable logic programming
From MaRDI portal
Recommendations
- On the Expressibility of Stable Logic Programming
- Expressiveness of logic programs under the general stable model semantics
- On stable-like semantics for logic programs
- On the relations between stable and well-founded semantics of logic programs
- Compactness Properties for Stable Semantics of Logic Programs
- scientific article; zbMATH DE number 5241979
- The expressive powers of the logic programming semantics
- A note on the stable model semantics for logic programs
- Expressiveness of stable model semantics for disjunctive logic programs with functions
- scientific article; zbMATH DE number 1368933
Cited in
(10)- My work with Victor Marek: a mathematician looks at answer set programming
- Stable-unstable semantics: Beyond NP with normal logic programs
- scientific article; zbMATH DE number 5241979 (Why is no real title available?)
- From here to there: Stable negation in logic programming
- Expressiveness of stable model semantics for disjunctive logic programs with functions
- Exploiting conjunctive queries in description logic programs
- Finding similar/diverse solutions in answer set programming
- On the Expressibility of Stable Logic Programming
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- Complexity results for answer set programming with bounded predicate arities and implications
This page was built for publication: On the expressibility of stable logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4815033)
