首页> 外文期刊>Theory and practice of logic programming >Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems
【24h】

Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems

机译:Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems

获取原文
获取原文并翻译 | 示例
           

摘要

Many industrial applications require finding solutions to challenging combinatorial problems.Efficient elimination of symmetric solution candidates is one of the key enablers for highperformancesolving. However, existing model-based approaches for symmetry breaking are limitedto problems for which a set of representative and easily solvable instances is available,which is often not the case in practical applications. This work extends the learning frameworkand implementation of a model-based approach for Answer Set Programming to overcomethese limitations and address challenging problems, such as the Partner Units Problem. In particular,we incorporate a new conflict analysis algorithm in the Inductive Logic Programmingsystem ILASP, redefine the learning task, and suggest a new example generation method toscale up the approach. The experiments conducted for different kinds of Partner Units Probleminstances demonstrate the applicability of our approach and the computational benefits due tothe first-order constraints learned.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号