资源分类
》 资源 》论文》Finite Model Computation via Answer Set Programming

Finite Model Computation via Answer Set Programming

2019-11-12 | |  63 |   42 |   0

Abstract

We show how Finite Model Computation (FMC) of first-order theories can efficiently and transparently be solved by taking advantage of an extension of Answer Set Programming, called incremental An-swer Set Programming (iASP). The idea is to use the incremental parameter in iASP programs to ac-count for the domain size of a model. The FMC problem is then successively addressed for increas-ing domain sizes until an answer set, representing a finite model of the original first-order theory, is found. We developed a system based on the iASP solver iClingo and demonstrate its competitiveness.


上一篇：Automatic Construction of Efficient Multiple Battery Usage Policies

下一篇：Measuring the Good and the Bad in Inconsistent Information

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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

  • Learning to Predi...

    Much of model-based reinforcement learning invo...