Acquiring search-control knowledge via static analysis
Explanation-Based Learning (EBL) is a widely-used technique for acquiring search-control knowledge. Recently, \textit{Prieditis}, \textit{van Harmelen} and \textit{Bundy} pointed to the similarity between Partial Evaluation (PE) and EBL. However, EBL utilizes training examples whereas PE does not. It is natural to inquire, therefore, whether PE can be used to acquire search-control knowledge, and if so at what cost? The paper answers these questions by means of a case study comparing PRODIGY/EBL, a state-of-the-art EBL system, and STATIC, a PE-based analyzer of problem-space definitions. When tested in PRODIGY/EBL's benchmark problem spaces, STATIC generated search-control knowledge that was up to three times as effective as the knowledge learned by PRODIGY /EBL, and did so from twenty-six to seventy-seven times faster. The paper describes STATIC's superior performance will scale up and when it will not. The paper concludes with several lessons for the design of EBL systems, suggesting hybrid PE/EBL systems as a promising direction for future research.
- A Proof Procedure Using Connection Graphs
- Automatically generating abstractions for planning
- Controlling recursive inference
- Explanation-based generalisation \(=\) partial evaluation
- scientific article; zbMATH DE number 4174361 (Why is no real title available?)
- scientific article; zbMATH DE number 4166906 (Why is no real title available?)
- scientific article; zbMATH DE number 3735091 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Ordering conjunctive queries
- Planning for conjunctive goals
- Speeding up inferences using relevance reasoning: a formalism and algorithms
- Inductive learning of search control rules for planning
- Failure driven dynamic search control for partial order planners: an explanation based approach
- Automatic acquisition of search control knowledge from multiple proof attempts.
- Using temporal logics to express search control knowledge for planning
- Position systems in dynamic domains
- Integrating planning and learning: the PRODIGY architecture
This page was built for publication: Acquiring search-control knowledge via static analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685544)
