Foundations of a functional approach to knowledge representation.
Artificial Intelligence
All I know: a study in autoepistemic logic
Artificial Intelligence
Relating autoepistemic and default logics
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Taxonomic syntax for first order inference
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Knowledge retrieval as specialized inference (artificial intelligence, sorted logic)
Knowledge retrieval as specialized inference (artificial intelligence, sorted logic)
Decidable, logic-based knowledge representation
Decidable, logic-based knowledge representation
A tractable knowledge representation service with full introspection
TARK '88 Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge
Steps towards a first-order logic of explicit and implicit belief
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
Semantical considerations on nonmonotonic logic
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
A guide to the modal logics of knowledge and belief: preliminary draft
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
A computational theory of belief introspection
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they know and do not know. An important area of research is to devise models of introspective reasoning that take into account resource limitations. Under the view that a KB is completely characterized by the set of beliefs it represents (its epistemic state), it seems natural to model KBs in terms of belief Reasoning can then be understood as the problem of computing membership in the epistemic state of a KB. The best understood models of belief are based on possible-world semantics. However, their computational properties are unacceptable. In particular, they render reasoning in firstorder KBs undecidable. In this paper, we propose a novel model of belief, which preserves many of the advantages of possible-world semantics yet, at the same time, guarantees reasoning to be decidable, where a KB may contain sentences in full first-order logic. Moreover, such KBs have perfect knowledge about their own beliefs even though their beliefs about the world are limited.