Pages that link to "Item:Q4593043"
From MaRDI portal
The following pages link to Stable-unstable semantics: Beyond NP with normal logic programs (Q4593043):
Displaying 7 items.
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (Q2058378) (← links)
- Knowledge representation analysis of graph mining (Q2317967) (← links)
- Solving problems in the polynomial hierarchy with ASP(Q) (Q2694590) (← links)
- Writing Declarative Specifications for Clauses (Q2835876) (← links)
- The Seventh Answer Set Programming Competition: Design and Results (Q4957192) (← links)
- Solving Advanced Argumentation Problems with Answer Set Programming (Q4957200) (← links)
- Beyond NP: Quantifying over Answer Sets (Q5108497) (← links)
