Mutex graphs and multicliques: reducing grounding size for planning

MaRDI QIDQ5020552zbMATH OpenFDO

Authors

Publication date 6 January 2022

Full work available at URL https://arxiv.org/abs/1909.08240, http://eptcs.web.cse.unsw.edu.au/paper.cgi?ICLP2019.20

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Long-distance mutual exclusion for planning
• Fact-alternating mutex groups for classical planning
• Multi-agent path finding with mutex propagation
• A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
• Temporal planning using subgoal partitioning and resolution in SGPlan

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 6472576 (Why is no real title available?)
• ASP-Core-2 input language format
• Algorithms for maximum independent sets
• Approximating Clique and Biclique Problems
• Domain-independent cost-optimal planning in ASP
• Fast planning through planning graph analysis
• Node-and edge-deletion NP-complete problems
• Probabilistic graphical models.
• Reducibility among combinatorial problems
• The maximum edge biclique problem is NP-complete

Describes a project that uses

Uses Software

• Graphplan

This page was built for publication: Mutex graphs and multicliques: reducing grounding size for planning

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