On the expressibility of stable logic programming
From MaRDI portal
Publication:4815033
DOI10.1017/S1471068403001777zbMath1079.68015OpenAlexW2141407569MaRDI QIDQ4815033
Victor W. Marek, Jeffery B. 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
Related Items (5)
Finding similar/diverse solutions in answer set programming ⋮ Complexity results for answer set programming with bounded predicate arities and implications ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ My work with Victor Marek: a mathematician looks at answer set programming ⋮ Exploiting conjunctive queries in description logic programs
Uses Software
This page was built for publication: On the expressibility of stable logic programming
