资源分类
》 资源 》论文》Evaluating Epistemic Negation in Answer Set Programming (Extended Abstract)?

Evaluating Epistemic Negation in Answer Set Programming (Extended Abstract)?

2019-10-29 | |  51 |   36 |   0
Abstract Epistemic negation not along with default negation ¬ plays a key role in knowledge representation and nonmonotonic reasoning. However, the existing approaches behave not satisfactorily in that they suffer from the problems of unintended world views due to recursion through the epistemic modal operator K or M (KF and MF are shorthands for ¬not F and not ¬F, respectively). In this paper we present a general approach to epistemic negation which is free of unintended world views and thus offers a solution to the long-standing problem of epistemic specifications which were introduced by [Gelfond, 1991] over two decades ago

上一篇：Efficient Algorithms And Representations For Chance-constrained Mixed Constraint Programming

下一篇：First-Order Modular Logic Programs and their Conservative Extensions (Extended Abstract)

用户评价
全部评价

热门资源

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