资源分类
》 资源 》论文》Translating First-Order Theories into Logic Programs

Translating First-Order Theories into Logic Programs

2019-11-12 | |  62 |   42 |   0
Abstract This paper focuses on computing ?rst-order theories under either stable model semantics or circumscription. A reduction from ?rst-order theories to logic programs under stable model semantics over ?nite structures is proposed, and an embedding of circumscription into stable model semantics is also given. Having such reduction and embedding, reasoning problems represented by ?rst-order theories under these two semantics can then be handled by using existing answer set solvers. The effectiveness of this approach in computing hard problems beyond NP is demonstrated by some experiments.

上一篇：On Qualitative Route Descriptions: Representation and Computational Complexity

下一篇：Transitively Relational Partial Meet Horn Contraction Zhiqiang Zhuang and Maurice Pagnucco

用户评价
全部评价

热门资源

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