Pages that link to "Item:Q4835533"
From MaRDI portal
The following pages link to Paraconsistent Stable Semantics for Extended Disjunctive Programs (Q4835533):
Displayed 17 items.
- Semi-equilibrium models for paracoherent answer set programs (Q253992) (← links)
- Data repair of inconsistent nonmonotonic description logic programs (Q322065) (← links)
- Ordering default theories and nonmonotonic logic programs (Q557790) (← links)
- Equilibrium logic (Q854969) (← links)
- Quasi-classical reasoning in paraconsistent databases (Q1653451) (← links)
- Assumption-based argumentation for extended disjunctive logic programming (Q2103901) (← 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)
- Logical foundations and complexity of 4QL, a query language with unrestricted negation (Q2901212) (← links)
- Modular Paracoherent Answer Sets (Q2938513) (← links)
- On deductive bases for paraconsistent answer set semantics (Q4583312) (← 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)