Lifting symmetry breaking constraints with inductive logic programming

Efficient omission of symmetric solution candidates is essential for combinatorial problem-solving. Most of the existing approaches are instance-specific and focus on the automatic computation of Symmetry Breaking Constraints (SBCs) for each given problem instance. However, the application of such a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Machine learning Ročník 111; číslo 4; s. 1303 - 1326
Hlavní autoři: Tarzariol, Alice, Gebser, Martin, Schekotihin, Konstantin
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.04.2022
Springer Nature B.V
Témata:
Artificial Intelligence
Broken symmetry
Combinatorial analysis
Computer Science
Control
Declarative programming
Logic programming
Machine Learning
Mathematical programming
Mechatronics
Natural Language Processing (NLP)
Problem solving
Robotics
Simulation and Modeling
Solvers
Special issue on Learning and Reasoning
Symmetry
Inductive logic programming
Answer set programming
Symmetry breaking constraints
ISSN:0885-6125, 1573-0565
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Efficient omission of symmetric solution candidates is essential for combinatorial problem-solving. Most of the existing approaches are instance-specific and focus on the automatic computation of Symmetry Breaking Constraints (SBCs) for each given problem instance. However, the application of such approaches to large-scale instances or advanced problem encodings might be problematic since the computed SBCs are propositional and, therefore, can neither be meaningfully interpreted nor transferred to other instances. As a result, a time-consuming recomputation of SBCs must be done before every invocation of a solver. To overcome these limitations, we introduce a new model-oriented approach for Answer Set Programming that lifts the SBCs of small problem instances into a set of interpretable first-order constraints using the Inductive Logic Programming paradigm. Experiments demonstrate the ability of our framework to learn general constraints from instance-specific SBCs for a collection of combinatorial problems. The obtained results indicate that our approach significantly outperforms a state-of-the-art instance-specific method as well as the direct application of a solver.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0885-6125
1573-0565
DOI:10.1007/s10994-022-06146-3