资源分类
》 资源 》论文》Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access

Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access

2019-11-22 | |  45 |   38 |   0
Abstract Answer Set Programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs and efficient solvers. HEX-programs extend ASP with external atoms for access to arbitrary external information. In this work, we extend the evaluation principles of external atoms to partial assignments, lift nogood learning to this setting, and introduce a variant of nogood minimization. This enables external sources to guide the search for answer sets akin to theory propagation. Our benchmark experiments demonstrate a clear improvement in efficiency over the state-of-the-art HEX-solver.

上一篇：LTLf and LDLf Synthesis under Partial Observability

下一篇：Forgetting in Multi-Agent Modal Logics

用户评价
全部评价

热门资源

  • 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...