The following pages link to Prodigy (Q32503):
Displaying 21 items.
- Acquiring search-control knowledge via static analysis (Q685544) (← links)
- Learning from planner performance (Q835821) (← links)
- Ranking relations using analogies in biological and information networks (Q993237) (← links)
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems (Q1204869) (← links)
- Automatically selecting and using primary effects in planning: Theory and experiments. (Q1399131) (← links)
- Continuous case-based reasoning (Q1402746) (← links)
- Fast planning through planning graph analysis (Q1402751) (← links)
- Agenda control for heterogeneous reasoners (Q1764797) (← links)
- Using genetic programming to learn and improve control knowledge. (Q1852856) (← links)
- A theory of transfer learning with applications to active learning (Q1945022) (← links)
- Proving theorems by reuse (Q1978233) (← links)
- Using temporal logics to express search control knowledge for planning (Q1978242) (← links)
- Knowledge-based proof planning (Q1978469) (← links)
- Computing programs for generalized planning using a classical planner (Q2321292) (← links)
- Position systems in dynamic domains (Q2341258) (← links)
- Proof planning with multiple strategies (Q2389631) (← links)
- Efficient interactive decision-making framework for robotic applications (Q2407432) (← links)
- Model-lite planning: case-based vs. model-based approaches (Q2407874) (← links)
- Learning adaptation knowledge to improve case-based reasoning (Q2457599) (← links)
- Multi-agent plan based information gathering (Q2505030) (← links)
- A Pragmatic Approach to Reuse in Tactical Theorem Proving (Q2841242) (← links)
