资源分类
》 资源 》论文》Symmetric Splitting in the General Theory of Stable Models

Symmetric Splitting in the General Theory of Stable Models

2019-11-15 | |  68 |   39 |   0

Abstract Splitting a logic program allows us to reduce the task of computing its stable models to similar tasks for smaller programs. This idea is extended here to the general theory of stable models that replaces traditional logic programs by arbitrary fifirstorder sentences and distinguishes between intensional and extensional predicates. We discuss two kinds of splitting: a set of intensional predicates can be split into subsets, and a formula can be split into its conjunctive terms.

上一篇：Plausible Repairs for Inconsistent Requirements

下一篇：On the Accrual of Arguments in Defeasible Logic Programming

用户评价
全部评价

热门资源

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