Encoding domain and control knowledge for propositional planning

MaRDI QIDQ2734936zbMATH OpenFDO

Authors Henry Kautz, Bart Selman

Publication date 30 August 2001

zbMATH Keywords

propositional satisfiability

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• SAS+ planning as satisfiability
• scientific article; zbMATH DE number 1884393
• Logic Programming
• Domain-dependent knowledge in answer set planning
• Using temporal logics to express search control knowledge for planning

Cited in

(11)

• Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
• Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)
• Generating effective symmetry-breaking predicates for search problems
• scientific article; zbMATH DE number 1696563 (Why is no real title available?)
• SAS+ planning as satisfiability
• Strategy of extracting domain knowledge for the STRIPS world based on derived predicates
• Exploiting macro-actions and predicting plan length in planning as satisfiability
• scientific article; zbMATH DE number 2166725 (Why is no real title available?)
• Domain-dependent knowledge in answer set planning
• Linear logic as a tool for planning under temporal uncertainty
• On the exploitation of control knowledge for enhancing automated planning

Describes a project that uses

Uses Software

• Walksat
• Smodels

This page was built for publication: Encoding domain and control knowledge for propositional planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2734936)