Search Results for author:
Found 3 papers, 1 papers with code
A Model-Oriented Approach for Lifting Symmetries in Answer Set Programming
When solving combinatorial problems, pruning symmetric solution candidates from the search space is essential.
Efficient lifting of symmetry breaking constraints for complex combinatorial problems
Many industrial applications require finding solutions to challenging combinatorial problems.
Lifting Symmetry Breaking Constraints with Inductive Logic Programming
Efficient omission of symmetric solution candidates is essential for combinatorial problem-solving.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
