scientific article; zbMATH DE number 7453111

MaRDI QIDQ5020552

No author found.

Publication date: 6 January 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Logic programming (68N17)

Uses Software

• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast planning through planning graph analysis
• The maximum edge biclique problem is NP-complete
• Algorithms for maximum independent sets
• Approximating Clique and Biclique Problems
• ASP-Core-2 Input Language Format
• Reducibility among Combinatorial Problems
• Domain-Independent Cost-Optimal Planning in ASP
• Node-and edge-deletion NP-complete problems

This page was built for publication: