Pages that link to "Item:Q1853549"
From MaRDI portal
The following pages link to Propositional default logics made easier: computational complexity of model checking. (Q1853549):
Displaying 6 items.
- On the complexity of extension checking in default logic (Q844157) (← links)
- The complexity of default reasoning under the stationary fixed point semantics (Q1898114) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- Seminormalizing a default theory (Q3647232) (← links)
- Strong backdoors for default logic (Q6570091) (← links)
- Strong backdoors for default logic (Q6610193) (← links)