A First-Order Logic of Probability and Only Knowing in Unbounded Domains

Authors

  • Vaishak Belle Katholieke Universiteit Leuven
  • Gerhard Lakemeyer RWTH Aachen University
  • Hector Levesque University of Toronto

DOI:

https://doi.org/10.1609/aaai.v30i1.10108

Keywords:

reasoning about knowledge and belief, unbounded domains, probability and logic

Abstract

Only knowing captures the intuitive notion that the beliefs of an agent are precisely those that follow from its knowledge base. It has previously been shown to be useful in characterizing knowledge-based reasoners, especially in a quantified setting. While this allows us to reason about incomplete knowledge in the sense of not knowing whether a formula is true or not, there are many applications where one would like to reason about the degree of belief in a formula. In this work, we propose a new general first-order account of probability and only knowing that admits knowledge bases with incomplete and probabilistic specifications. Beliefs and non-beliefs are then shown to emerge as a direct logical consequence of the sentences of the knowledge base at a corresponding level of specificity.

Downloads

Published

2016-02-21

How to Cite

Belle, V., Lakemeyer, G., & Levesque, H. (2016). A First-Order Logic of Probability and Only Knowing in Unbounded Domains. Proceedings of the AAAI Conference on Artificial Intelligence, 30(1). https://doi.org/10.1609/aaai.v30i1.10108

Issue

Section

Technical Papers: Knowledge Representation and Reasoning