Compactness Properties for Stable Semantics of Logic Programs

DOI10.1007/978-3-540-72734-7_27MaRDI QIDQ5434521zbMATH OpenOpenAlexFDO

Authors Wiktor Marek, Jeffrey Remmel

Publication date 4 January 2008

Published in Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72734-7_27

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 5241979
• On the minimality of stable models
• scientific article; zbMATH DE number 1114052
• How complicated is the set of stable models of a recursive logic program?
• Contributions to the stable model semantics of logic programs with negation

Cited in

(6)

• My work with Victor Marek: a mathematician looks at answer set programming
• Logic programs as compact denotations.
• scientific article; zbMATH DE number 3926234 (Why is no real title available?)
• scientific article; zbMATH DE number 4081532 (Why is no real title available?)
• On the expressibility of stable logic programming
• scientific article; zbMATH DE number 5241979 (Why is no real title available?)

This page was built for publication: Compactness Properties for Stable Semantics of Logic Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434521)