A state space analysis of propose-and-revise

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-111X(199902)14:2<165::AID-INT3>3.0.CO;2-Z" /><165::AID-INT3>3.0.CO;2-Z 10.1002/(SICI)1098-111X(199902)14:2<165::AID-INT3>3.0.CO;2-ZzbMath0920.68131OpenAlexW2062846542MaRDI QIDQ4244163

Juergen Angele, R. Studer

Publication date: 24 May 1999

Full work available at URL: https://doi.org/10.1002/(sici)1098-111x(199902)14:2<165::aid-int3>3.0.co;2-z

zbMATH Keywords

reuseknowledge engineeringStanford research institute problem solver

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Uses Software

• CommonKADS

Cites Work

• Planning for conjunctive goals
• The computational complexity of propositional STRIPS planning
• Complexity, decidability and undecidability results for domain-independent planning
• Unnamed Item

This page was built for publication: A state space analysis of propose-and-revise