Pages that link to "Item:Q2317973"
From MaRDI portal
The following pages link to A multiparametric view on answer set programming (Q2317973):
Displaying 12 items.
- Paracoherent answer set computation (Q2238696) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Answer set programming with graded modality (Q2401935) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Evaluating Answer Set Programming with Non-Convex Recursive Aggregates (Q4589242) (← links)
- Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Q5019599) (← links)
- Finding similar/diverse solutions in answer set programming (Q5298797) (← links)
- Logics in Artificial Intelligence (Q5394157) (← links)
- TOAST: Applying Answer Set Programming to Superoptimisation (Q5449606) (← links)
- A paraconsistent ASP-like language with tractable model generation (Q5869696) (← links)
- Strong backdoors for default logic (Q6570091) (← links)
- Strong backdoors for default logic (Q6610193) (← links)