Pages that link to "Item:Q4664020"
From MaRDI portal
The following pages link to A Hybrid Abductive Inductive Proof Procedure (Q4664020):
Displaying 12 items.
- Reconsideration of circumscriptive induction with pointwise circumscription (Q833732) (← links)
- Nonmonotonic abductive inductive learning (Q833734) (← links)
- Deriving non-zeno behaviour models from goal models using ILP (Q973050) (← links)
- The complexity and generality of learning answer set programs (Q1647512) (← links)
- Integrating induction and abduction in logic programming (Q1818759) (← links)
- Inductive Learning of Answer Set Programs (Q2938503) (← links)
- Learning weak constraints in answer set programming (Q4592994) (← links)
- Using Abduction to Compute Efficient Proofs (Q5178959) (← links)
- AI*IA 2005: Advances in Artificial Intelligence (Q5475747) (← links)
- Formal Methods in Computer-Aided Design (Q5492985) (← links)
- Inductive Logic Programming (Q5897187) (← links)
- AI*IA 2003: Advances in Artificial Intelligence (Q5897322) (← links)