On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning

DOI10.1016/S0004-3702(98)00087-3zbMath0909.68139MaRDI QIDQ1274559

Subbarao Kambhampati

Publication date: 12 January 1999

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

zbMATH Keywords

propagation; planning; regression; constraint satisfaction; nogood learning; explanation-based learning; dependency directed backtracking; dynamic backtracking; flaw resolution

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

Related Items

Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP, State space search nogood learning: online refinement of critical-path dead-end detectors in planning, Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan

Uses Software

• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explanation-based generalisation \(=\) partial evaluation
• A theory of conflict resolution in planning
• Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
• Failure driven dynamic search control for partial order planners: an explanation based approach
• A theoretical evaluation of selected backtracking algorithms.
• PALO: a probabilistic hill-climbing algorithm
• Some Properties of Predicate Transformers