Domain-Independent Cost-Optimal Planning in ASP

DOI10.1017/S1471068419000395zbMath1434.68548arXiv1908.00112OpenAlexW3103867486MaRDI QIDQ5108526

No author found.

Publication date: 4 May 2020

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.00112

zbMATH Keywords

answer set programmingcost-optimal planningCORE-2 ASP standard

Mathematics Subject Classification ID

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

Related Items (2)

Domain-Independent Cost-Optimal Planning in ASP ⋮ Unnamed Item

Uses Software

• plasp
• Graphplan
• GNU parallel

Cites Work

• Unnamed Item
• Planning as satisfiability: heuristics
• Fast planning through planning graph analysis
• Answer set programming and plan generation
• plasp 3: towards effective ASP planning
• Branching and pruning: An optimal temporal POCL planner based on constraint programming
• STRIPS: A new approach to the application of theorem proving to problem solving
• Planning as satisfiability with IPC simple preferences and action costs
• Optimum stable model search: algorithms and implementation
• Knowledge Representation, Reasoning and Declarative Problem Solving
• ASP-Core-2 Input Language Format
• Property Directed Reachability for Automated Planning
• Domain-Independent Cost-Optimal Planning in ASP

This page was built for publication: Domain-Independent Cost-Optimal Planning in ASP