资源分类
》 资源 》论文》First-Order Modular Logic Programs and their Conservative Extensions (Extended Abstract)

First-Order Modular Logic Programs and their Conservative Extensions (Extended Abstract)

2019-10-29 | |  45 |   40 |   0
Abstract This paper introduces first-order modular logic programs, which provide a way of viewing answer set programs as consisting of many independent, meaningful modules. We also present conservative extensions of such programs. This concept helps to identify strong relationships between modular programs as well as between traditional programs. For example, we illustrate how the notion of a conservative extension can be used to justify the common projection rewriting. This is a short version of a paper was presented at the 32nd International Conference on Logic Programming [Harrison and Lierler, 2016].

上一篇：Evaluating Epistemic Negation in Answer Set Programming (Extended Abstract)?

下一篇：Game Theoretic Analysis of Security and Sustainability

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

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

  • Learning to Predi...

    Much of model-based reinforcement learning invo...