Safe Formulas in the General Theory of Stable Models (Preliminary Report)
From MaRDI portal
Recommendations
- Stable models of formulas with generalized quantifiers (preliminary report)
- Stable models and circumscription
- Stable formulas in intuitionistic logic
- Remarks on Stable Formulas in Intuitionistic Logic
- On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics
- scientific article; zbMATH DE number 4089541
- On equivalence of infinitary formulas under the stable model semantics
- Stable models for infinitary formulas with extensional atoms
- Stable models and difference logic
- Stable formulas in ordered structures
Cites work
Cited in
(8)- Safe inductions and their applications in knowledge representation
- Safe beliefs for propositional theories
- Domain expansion for ASP-programs with external sources
- Safety signature for first-order languages and their applications
- Synonymous theories and knowledge representations in answer set programming
- Intelligent Instantiation and Supersafe Rules
- Stable models and circumscription
- Synthesizing strongly equivalent logic programs: Beth definability for answer set programs via Craig interpolation in first-order logic
This page was built for publication: Safe Formulas in the General Theory of Stable Models (Preliminary Report)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504689)