Pages that link to "Item:Q1898114"
From MaRDI portal
The following pages link to The complexity of default reasoning under the stationary fixed point semantics (Q1898114):
Displaying 8 items.
- Fixed-parameter tractability of disjunction-free default reasoning (Q1400063) (← links)
- Semantics and complexity of abduction from default theories (Q1402749) (← links)
- On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857) (← links)
- Propositional default logics made easier: computational complexity of model checking. (Q1853549) (← links)
- Reasoning with power defaults (Q1882904) (← links)
- MULTIPLE-CONCLUSION LP AND DEFAULT CLASSICALITY (Q3094191) (← links)
- Implementing Prioritized Circumscription by Computing Disjunctive Stable Models (Q3534658) (← links)
- The complexity class θp2: Recent results and applications in AI and modal logic (Q5055917) (← links)