On the Expressibility of Stable Logic Programming
From MaRDI portal
Publication:4798003
DOI10.1007/3-540-45402-0_8zbMath1007.68024OpenAlexW1774117686MaRDI QIDQ4798003
Victor W. Marek, Jeffery B. Remmel
Publication date: 18 March 2003
Published in: Logic Programming and Nonmotonic Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45402-0_8
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (4)
$\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols ⋮ Composing Normal Programs with Function Symbols ⋮ On the equivalence and range of applicability of graph-based representations of logic programs. ⋮ Reasoning with infinite stable models
This page was built for publication: On the Expressibility of Stable Logic Programming