资源分类
》 资源 》论文》Translation-Based Constraint Answer Set Solving

Translation-Based Constraint Answer Set Solving

2019-11-12 | |  75 |   45 |   0

Abstract We solve constraint satisfaction problems through translation to answer set programming (ASP). Our reformulations have the property that unitpropagation in the ASP solver achieves well de?ned local consistency properties like arc, bound and range consistency. Experiments demonstrate the computational value of this approach.

上一篇：Exploring Protein Fragment Assembly Using CLP

下一篇：Incentive Engineering for Boolean Games

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...