资源分类
》 资源 》论文》Unsatisfiable Core Shrinking for Anytime Answer Set Optimization

Unsatisfiable Core Shrinking for Anytime Answer Set Optimization

2019-10-29 | |  49 |   36 |   0
Abstract Efficient algorithms for the computation of optimum stable models are based on unsatisfiable core analysis. However, these algorithms essentially run to completion, providing few or even no suboptimal stable models. This drawback can be circumvented by shrinking unsatisfiable cores. Interestingly, the resulting anytime algorithm can solve more instances than the original algorithm

上一篇：Understanding How Feature Structure Transfers in Transfer Learning

下一篇：Using Constraint Programming to Solve a Cryptanalytic Problem

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...