Encodings for equilibrium logic and logic programs with nested expressions
From MaRDI portal
Recommendations
Cited in
(23)- On deciding subsumption problems
- Nested expressions in logic programs
- Semantic forgetting in answer set programming
- Complexity results for answer set programming with bounded predicate arities and implications
- Computing equilibrium models using signed formulas
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Strongly Equivalent Temporal Logic Programs
- Thirteen Definitions of a Stable Model
- Model-based recasting in answer-set programming
- Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective
- Logics in Artificial Intelligence
- Stable models and circumscription
- From answer set logic programming to circumscription via logic of GK
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Twelve Definitions of a Stable Model
- Quantified Equilibrium Logic and Foundations for Answer Set Programs
- Logical connectives for two-state semantics
- On dynamics in structured argumentation formalisms
- Equivalence in argumentation frameworks with a claim-centric view: classical results with novel ingredients
- Linear-time temporal answer set programming
- A generalization of the Lin-Zhao theorem
- Equilibrium logic
- General default logic
This page was built for publication: Encodings for equilibrium logic and logic programs with nested expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736482)