Acquiring search-control knowledge via static analysis

DOI10.1016/0004-3702(93)90080-UzbMATH Open0778.68071MaRDI QIDQ685544FDOQ685544

Authors: Oren Etzioni 

Publication date: 13 January 1994

Published in: Artificial Intelligence (Search for Journal in Brave)

Recommendations

• Failure driven dynamic search control for partial order planners: an explanation based approach
• scientific article; zbMATH DE number 4166893
• Publication:3493276
• Publication:3493287
• Automatic acquisition of search control knowledge from multiple proof attempts.

zbMATH Keywords

Explanation-Based LearningPartial Evaluation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Planning for conjunctive goals
• A Proof Procedure Using Connection Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automatically generating abstractions for planning
• Title not available (Why is that?)
• Ordering conjunctive queries
• Controlling recursive inference
• Explanation-based generalisation \(=\) partial evaluation
• Title not available (Why is that?)
• Title not available (Why is that?)

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

Uses Software

• Prodigy
• UCPOP

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)