The following pages link to (Q4022222):
Displaying 5 items.
- Hyperequivalence of logic programs with respect to supported models (Q1028652) (← links)
- Semantics and complexity of abduction from default theories (Q1402749) (← links)
- On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- On the decidability and complexity of reasoning about only knowing (Q1978243) (← links)