Acquiring search-control knowledge via static analysis
From MaRDI portal
Publication:685544
Recommendations
Cites work
- 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?)
- A Proof Procedure Using Connection Graphs
- Automatically generating abstractions for planning
- Controlling recursive inference
- Explanation-based generalisation \(=\) partial evaluation
- Ordering conjunctive queries
- Planning for conjunctive goals
Cited in
(7)- Automatic acquisition of search control knowledge from multiple proof attempts.
- Failure driven dynamic search control for partial order planners: an explanation based approach
- Position systems in dynamic domains
- Inductive learning of search control rules for planning
- Speeding up inferences using relevance reasoning: a formalism and algorithms
- Using temporal logics to express search control knowledge for planning
- 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)