On the expressibility of stable logic programming
From MaRDI portal
Publication:4815033
DOI10.1017/S1471068403001777zbMATH Open1079.68015OpenAlexW2141407569MaRDI QIDQ4815033FDOQ4815033
Authors: Wiktor Marek, Jeffrey Remmel 
Publication date: 19 August 2004
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068403001777
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
- Title not available (Why is that?)
- 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
Uses Software
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)
