Pages that link to "Item:Q253992"
From MaRDI portal
The following pages link to Semi-equilibrium models for paracoherent answer set programs (Q253992):
Displaying 14 items.
- Approximating operators and semantics for abstract dialectical frameworks (Q490444) (← links)
- Weakening and extending \(\mathbb{Z}\) (Q497880) (← links)
- Autoepistemic answer set programming (Q2046018) (← links)
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- Solving problems in the polynomial hierarchy with ASP(Q) (Q2694590) (← links)
- The Seventh Answer Set Programming Competition: Design and Results (Q4957192) (← links)
- Paracoherent Answer Set Semantics meets Argumentation Frameworks (Q5108496) (← links)
- Better Paracoherent Answer Sets with Less Resources (Q5108500) (← links)
- Witnesses for Answer Sets of Logic Programs (Q5886522) (← links)
- Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT (Q6063882) (← links)
- ASP and subset minimality: enumeration, cautious reasoning and MUSes (Q6103676) (← links)
- Refining the semantics of epistemic specifications (Q6647309) (← links)
