资源论文A Tractable, Expressive, and Eventually Complete First-Order Logic of Limited Belief

A Tractable, Expressive, and Eventually Complete First-Order Logic of Limited Belief

2019-09-29 | |  78 |   63 |   0
Abstract In knowledge representation, obtaining a notion of belief which is tractable, expressive, and eventually complete has been a somewhat elusive goal. Expressivity here means that an agent should be able to hold arbitrary beliefs in a very expressive language like that of first-order logic, but without being required to perform full logical reasoning on those beliefs. Eventual completeness means that any logical consequence of what is believed will eventually come to be believed, given enough reasoning effort. Tractability in a first-order setting has been a research topic for many years, but in most cases limitations were needed on the form of what was believed, and eventual completeness was so far restricted to the propositional case. In this paper, we propose a novel logic of limited belief, which has all three desired properties

上一篇:Explaining Reinforcement Learning to Mere Mortals: An Empirical Study

下一篇:An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic

用户评价
全部评价

热门资源

  • A Mathematical Mo...

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

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Hierarchical Task...

    We extend hierarchical task network planning wi...

  • Shape-based Autom...

    We present an algorithm for automatic detection...