On the Expressibility of Stable Logic Programming

DOI10.1007/3-540-45402-0_8MaRDI QIDQ4798003zbMATH OpenOpenAlexFDO

Authors Wiktor Marek, Jeffrey 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Logic in artificial intelligence (68T27)

Recommendations

• On the expressibility of stable logic programming
• scientific article; zbMATH DE number 1368933
• Extremal problems in logic programming and stable model computation
• The Stable Models of a Predicate Logic Program
• Polynomial-time computable stable models

Cited in

(9)

• On the equivalence and range of applicability of graph-based representations of logic programs.
• Reasoning with infinite stable models
• Stable-unstable semantics: Beyond NP with normal logic programs
• On the expressibility of stable logic programming
• scientific article; zbMATH DE number 5241979 (Why is no real title available?)
• From here to there: Stable negation in logic programming
• Composing Normal Programs with Function Symbols
• Expressiveness of stable model semantics for disjunctive logic programs with functions
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols

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 Q4798003)