资源分类
》 资源 》论文》a recursive shortcut for cegar application to the modal logic k satisfiability problem

a recursive shortcut for cegar application to the modal logic k satisfiability problem

2019-10-31 | |  50 |   37 |   0
Abstract is sound and complete. Then we propose a specific implementation of the RECAR approach to solve the modal logic K satisfiability problem. We implemented both CEGAR and RECAR approaches for the modal logic K satisfiability problem within the solver MoSaiC. We compared experimentally those approaches to the state-of-the-art solvers for that problem. The RECAR approach outperforms the CEGAR one for that problem and also compares favorably against the state-of-the-art on the benchmarks considered.

上一篇：efficient label contamination attacks against black box learning models

下一篇：enhancing the unified features to locate buggy files by exploiting the sequential nature of source code

用户评价
全部评价

热门资源

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

  • Learning to learn...

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

  • A Mathematical Mo...

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