Pages that link to "Item:Q5101437"
From MaRDI portal
The following pages link to Complexity results for abductive logic programming (Q5101437):
Displaying 7 items.
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- Semantics and complexity of abduction from default theories (Q1402749) (← links)
- Scalable algorithms for abduction via enumerative syntax-guided synthesis (Q2096443) (← links)
- The Complexity of Abduction for Equality Constraint Languages (Q2958548) (← links)
- On computing all abductive explanations from a propositional Horn theory (Q3546348) (← links)
- (Q4799253) (← links)
- Foundations of Information and Knowledge Systems (Q5898541) (← links)