Combining Heuristics for Configuration Problems Using Answer Set Programming

DOI10.1007/978-3-319-23264-5_32zbMath1467.68166OpenAlexW2394499116MaRDI QIDQ3449221

Gottfried Schenner, Anna Ryabokon, Martin Gebser

Publication date: 4 November 2015

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23264-5_32

zbMATH Keywords

heuristicsanswer set programmingconfiguration problem

Mathematics Subject Classification ID

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

Related Items (6)

The Design of the Sixth Answer Set Programming Competition ⋮ Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper) ⋮ Partial Compilation of ASP Programs ⋮ Unnamed Item ⋮ The External Interface for Extending WASP ⋮ Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search

Cites Work

• Unnamed Item
• Unnamed Item
• Search combinators
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
• Conflict-Based Program Rewriting for Solving Configuration Problems
• Optimization Methods for the Partner Units Problem

This page was built for publication: Combining Heuristics for Configuration Problems Using Answer Set Programming