A Computationally Grounded Logic of Knowledge, Belief and Certainty

Su, K., Sattar, A., Governatori, G. and Chen, Q. (2005). A Computationally Grounded Logic of Knowledge, Belief and Certainty. In: S. Kraus, M. P. Singh, S. Koening, M. Wooldridge, F. Dignum and V. Dignum, Proceedings of the 4th International Joint Conference of Autonomous Agents and Multiagent Systems. 4th International Conference on Autonomous Agents and Multiagent Systems, Utrecht, The Netherlands, (149-156). 25-29 July, 2005.

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
p409-su.pdf p409-su.pdf Click to show the corresponding preview/stream application/pdf 193.79KB 1248
Author Su, K.
Sattar, A.
Governatori, G.
Chen, Q.
Title of paper A Computationally Grounded Logic of Knowledge, Belief and Certainty
Conference name 4th International Conference on Autonomous Agents and Multiagent Systems
Conference location Utrecht, The Netherlands
Conference dates 25-29 July, 2005
Proceedings title Proceedings of the 4th International Joint Conference of Autonomous Agents and Multiagent Systems
Place of Publication New York, USA
Publisher ACM Press
Publication Year 2005
Sub-type Fully published paper
ISBN 1-59593-093-0
Editor S. Kraus
M. P. Singh
S. Koening
M. Wooldridge
F. Dignum
V. Dignum
Volume 1
Start page 149
End page 156
Total pages 8
Collection year 2005
Language eng
Abstract/Summary This paper presents a logic of knowledge, belief and certainty, which allows us to explicitly express the knowledge, belief and certainty of an agent. A computationally grounded model, called interpreted KBC systems, is given for interpreting this logic. The relationships between knowledge, belief and certainty are explored. In particular, certainty entails belief; and to the agent what it is certain of appears to be the knowledge. To formalize those agents that are able to introspect their own belief and certainty, we identify a subclass of interpreted KBC systems, called introspective KBC systems. We provide sound and complete axiomatizations for the logics. We show that the validity problem for the interpreted KBC systems is PSPACE-complete, and the same problem for introspective KBC systems is co-NP complete, thus no harder than that of the propositional logic.
Subjects 280403 Logics and Meanings of Programs
280200 Artificial Intelligence and Signal and Image Processing
E1
700100 Computer Software and Services
Keyword multi modal logics
agents
interpreted systems
belief
certainty
knowledge
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status UQ
Additional Notes Copyright (c) 2005 ACM. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.

 
Versions
Version Filter Type
Citation counts: Google Scholar Search Google Scholar
Access Statistics: 330 Abstract Views, 1251 File Downloads  -  Detailed Statistics
Created: Mon, 23 May 2005, 10:00:00 EST by Guido Governatori on behalf of School of Information Technol and Elec Engineering