Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems

DOI10.1017/S1471068422000151MaRDI QIDQ5038464

Mark M. Law, Konstantin Schekotihin, Alice Tarzariol, Martin Gebser

Publication date: 30 September 2022

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.07129

zbMATH Keywords

inductive logic programminganswer set programmingsymmetry breaking constraints

Mathematics Subject Classification ID

Logic programming (68N17)

Uses Software

• claspfolio 2
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tractability frontiers of the partner units configuration problem
• Symmetry definitions for constraint satisfaction problems
• Conflict-driven answer set solving: from theory to practice
• Learning programs by learning from failures
• Lifting symmetry breaking constraints with inductive logic programming
• Symmetric ILP: Coloring and small integers
• claspfolio2: Advances in Algorithm Selection for Answer Set Programming
• Inductive Learning of Answer Set Programs
• Optimization Methods for the Partner Units Problem
• Automatic Detection of Variable and Value Symmetries
• On local domain symmetry for model expansion
• Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
• Symmetry and Satisfiability: An Update
• Answer Set Programming
• A Novel Approach For Detecting Symmetries in CSP Models

This page was built for publication: Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems