On the minimality of stable models

DOI10.1007/978-3-642-20832-4_5MaRDI QIDQ3001914zbMATH OpenOpenAlexFDO

Authors Paolo Ferraris, Vladimir Lifschitz

Publication date 19 May 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20832-4_5

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A topological characterization of the stable and minimal model classes of propositional logic programs
• Thirteen Definitions of a Stable Model
• scientific article; zbMATH DE number 5241979
• Minimal Logic Programs
• scientific article; zbMATH DE number 1114052

Cited in

(11)

• A topological characterization of the stable and minimal model classes of propositional logic programs
• A paraconsistent approach to actions in informationally complex environments
• New outlook on the minimal model program. II
• Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
• On the existence and unicity of stable models in normal residuated logic programs
• Minimal Logic Programs
• Stable models are generated by a stable chain
• Stability, supportedness, minimality and Kleene answer set programs
• Compactness Properties for Stable Semantics of Logic Programs
• On Minimal Models
• Signed dual tableaux for Kleene answer set programs

This page was built for publication: On the minimality of stable models

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