Automatic construction of optimal static sequential portfolios for AI planning and beyond

DOI10.1016/j.artint.2015.05.005zbMath1346.68179OpenAlexW601027804MaRDI QIDQ898741

Carlos Linares López, Daniel Borrajo, Sergio Núñez

Publication date: 18 December 2015

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2015.05.005

zbMATH Keywords

SATportfoliosautomated planning

Mathematics Subject Classification ID

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

Related Items (1)

Symbolic perimeter abstraction heuristics for cost-optimal planning

Uses Software

• MiniSat
• Paramils
• SATzilla
• SATenstein
• aspeed

Cites Work

• Algorithm runtime prediction: methods \& evaluation
• The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
• ParamILS: An Automatic Algorithm Configuration Framework
• Theory and Applications of Satisfiability Testing
• The complexity of theorem-proving procedures
• Algorithm portfolios
• Planning as heuristic search
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automatic construction of optimal static sequential portfolios for AI planning and beyond