Safe Formulas in the General Theory of Stable Models (Preliminary Report)

DOI10.1007/978-3-540-89982-2_55zbMath1185.68163OpenAlexW2125424848MaRDI QIDQ5504689

Joohyung Lee, Vladimir Lifschitz, Ravi Palla

Publication date: 22 January 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89982-2_55

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (4)

Synonymous theories and knowledge representations in answer set programming ⋮ Intelligent Instantiation and Supersafe Rules ⋮ Stable models and circumscription ⋮ Domain expansion for ASP-programs with external sources

Cites Work

• Circumscription - a form of non-monotonic reasoning
• The DLV system for knowledge representation and reasoning
• A Characterization of Strong Equivalence for Logic Programs with Variables
• Unnamed Item

This page was built for publication: Safe Formulas in the General Theory of Stable Models (Preliminary Report)