Title :
On the complexity of epistemic reasoning
Author_Institution :
IBM Almaden Res., San Jose, CA, USA
Abstract :
A study is made of the complexity of the decision problem for epistemic logics based on R. Montague´s (1968) and R. Scott´s (1970) semantics. The interest is in finding out how assumptions about the agents´ reasoning power affect the complexity of reasoning about the agents´ knowledge. A spectrum of assumptions is studied, and it is shown that the complexity of the logic under different assumptions is always in NP or PSPACE. The mental faculty that raises the complexity of the logic from NP to PSPACE is pinpointed. It is the ability to combine distinct items of knowledge
Keywords :
artificial intelligence; computational complexity; formal logic; NP; PSPACE; assumptions; decision complexity; epistemic logics; epistemic reasoning; knowledge; logic complexity; reasoning complexity; reasoning power; Artificial intelligence; Context modeling; Logic;
Conference_Titel :
Logic in Computer Science, 1989. LICS '89, Proceedings., Fourth Annual Symposium on
Conference_Location :
Pacific Grove, CA
Print_ISBN :
0-8186-1954-6
DOI :
10.1109/LICS.1989.39179
