Planning in answer set programming using ordered task decomposition

MaRDI QIDQ3007257zbMATH OpenFDO

Authors J. Dix, Ugur Kuter, Dana Nau

Publication date 21 June 2011

zbMATH Keywords

logic programmingnonmonotonic logic programsanswer set programming (ASP)ASP semanticsDLVhierarchical task-network (HTN) planning problemsSHOP planning systemSmodels

Mathematics Subject Classification ID

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

Recommendations

• Planning in answer set programming using ordered task decomposition
• Answer set programming and plan generation
• On hierarchical task networks
• Complexity results for HTN planning
• plasp 3: towards effective ASP planning

Cited in

(12)

• plasp 3: towards effective ASP planning
• Domain-dependent knowledge in answer set planning
• Planning in answer set programming using ordered task decomposition
• Lilotane: a lifted SAT-based approach to hierarchical planning
• Model checking multi-agent systems with logic based Petri nets
• Planning with Incomplete Information in Quantified Answer Set Programming
• Answer set planning: a survey
• scientific article; zbMATH DE number 2000818 (Why is no real title available?)
• Programming hierarchical task networks in the situation calculus
• plasp 3: towards effective ASP planning
• Language classification of hierarchical planning problems
• Logic Programming

Describes a project that uses

Uses Software

• XSB

This page was built for publication: Planning in answer set programming using ordered task decomposition

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