Adaptive large-neighbourhood search for optimisation in answer-set programming

DOI10.1016/J.ARTINT.2024.104230MaRDI QIDQ6665706zbMATH OpenFDO

Authors Thomas Eiter, Tobias Geibinger, Nelson Higuera Ruiz, Nysret Musliu, Johannes Oetsch, Dave Pfliegler, Daria Stepanova

Publication date 17 January 2025

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2024.104230

zbMATH Keywords

optimizationproblem solving

Mathematics Subject Classification ID

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

Recommendations

• Principles for the design of large neighborhood search
• Optimum stable model search: algorithms and implementation
• TOAST: Applying Answer Set Programming to Superoptimisation
• Multi-criteria optimization in answer set programming

Cites work

• claspfolio2: Advances in Algorithm Selection for Answer Set Programming
• \textit{clingcon}: the next generation
• A general heuristic for vehicle routing problems
• A local search framework for industrial test laboratory scheduling
• A machine learning system to improve the performance of ASP solving based on encoding selection
• Advances in WASP
• An evolutionary algorithm for polishing mixed integer programming solutions
• Answer set programming
• ASP-Core-2 input language format
• Boosting Answer Set Optimization with Weighted Comparator Networks
• Clingo goes linear constraints over reals and integers
• Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
• Combining Heuristics for Configuration Problems Using Answer Set Programming
• Complex optimization in answer set programming
• Constraint answer set solver EZCSP and why integration schemas matter
• Declarative local search for predicate logic
• Design and results of the Fifth Answer Set Programming Competition
• DINS, a MIP Improvement Heuristic
• Exploring relaxation induced neighborhoods to improve MIP solutions
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 2090539 (Why is no real title available?)
• scientific article; zbMATH DE number 7455725 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• Multi-criteria optimization in answer set programming
• Multi-shot ASP solving with clingo
• On the complexity of the partner units decision problem
• On the computational cost of disjunctive logic programming: Propositional case
• Optimization Methods for the Partner Units Problem
• Optimum stable model search: algorithms and implementation
• Principles and Practice of Constraint Programming – CP 2004
• Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
• Relating constraint answer set programming languages and algorithms
• Revisiting the self-adaptive large neighborhood search
• Shift design with answer set programming
• Solution Enumeration by Optimality in Answer Set Programming
• Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP
• The DLV system for knowledge representation and reasoning
• The External Interface for Extending WASP
• Train scheduling with hybrid ASP
• Unsatisfiability-based optimization in clasp

Cited in

(1)

• Decomposition strategies and multi-shot ASP solving for job-shop scheduling

This page was built for publication: Adaptive large-neighbourhood search for optimisation in answer-set programming

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