Pages that link to "Item:Q2884255"
From MaRDI portal
The following pages link to Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs (Q2884255):
Displaying 10 items.
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- A multiparametric view on answer set programming (Q2317973) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Dual-normal logic programs – the forgotten class (Q4592993) (← links)
- Inconsistency Proofs for ASP: The ASP - DRUPE Format (Q5108508) (← links)
- Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705928) (← links)
- IASCAR: incremental answer set counting by anytime refinement (Q6656460) (← links)
