Pages that link to "Item:Q2893324"
From MaRDI portal
The following pages link to The complexity of reasoning for fragments of default logic (Q2893324):
Displaying 12 items.
- Restricted default theories: expressive power and outlier detection tasks (Q483301) (← links)
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- On the complexity of extension checking in default logic (Q844157) (← links)
- Fixed-parameter tractability of disjunction-free default reasoning (Q1400063) (← links)
- On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857) (← links)
- On the complexity of the clone membership problem (Q2048213) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic (Q2961583) (← links)
- (Q4379673) (← links)
- (Q5020976) (← links)
- Strong backdoors for default logic (Q6570091) (← links)
- Strong backdoors for default logic (Q6610193) (← links)