Combining Heuristics for Configuration Problems Using Answer Set Programming

DOI10.1007/978-3-319-23264-5_32MaRDI QIDQ3449221zbMATH OpenOpenAlexFDO

Authors Martin Gebser, Anna Ryabokon, Gottfried Schenner

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)

Recommendations

• scientific article; zbMATH DE number 1890620
• Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
• Optimizing answer set computation via heuristic-based decomposition
• A general method to solve complex problems by combining multiple answer set programs
• AI*IA 2005: Advances in Artificial Intelligence
• ANSWER SET PROGRAMMING AND COMBINATORIAL MULTICRITERIA DECISION MAKING
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming
• An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
• Complex optimization in answer set programming

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
• Conflict-based program rewriting for solving configuration problems
• Learning and using domain-specific heuristics in ASP solvers
• Optimization Methods for the Partner Units Problem
• Search combinators

Cited in

(12)

• The Design of the Sixth Answer Set Programming Competition
• Combining Multiple Heuristics
• \textsf{LoCo} -- a logic for configuration problems
• Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
• Conflict-based program rewriting for solving configuration problems
• scientific article; zbMATH DE number 7453100 (Why is no real title available?)
• Partial compilation of ASP programs
• Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach
• Unsatisfiable core analysis and aggregates for optimum stable model search
• The External Interface for Extending WASP
• scientific article; zbMATH DE number 1728419 (Why is no real title available?)
• Adaptive large-neighbourhood search for optimisation in answer-set programming

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

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