Pages that link to "Item:Q490649"
From MaRDI portal
The following pages link to On the tractability of minimal model computation for some CNF theories (Q490649):
Displaying 10 items.
- Reasoning with minimal models: efficient algorithms and applications (Q1127346) (← links)
- On computing minimal models (Q1380414) (← links)
- Graph-based construction of minimal models (Q2093381) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- (Q4443550) (← links)
- (Q4799291) (← links)
- Better Paracoherent Answer Sets with Less Resources (Q5108500) (← links)
- Logic Programming (Q5191481) (← links)
- On the computability-theoretic complexity of trivial, strongly minimal models (Q5308141) (← links)
- (Q5428934) (← links)