Computational complexity of terminological reasoning in BACK
Artificial Intelligence
Taxonomic syntax for first order inference
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Handbook of theoretical computer science (vol. B)
Automatic Recognition of Tractability for Inference Relations
Automatic Recognition of Tractability for Inference Relations
Semantical consideration on floyo-hoare logic
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Inductive policy selection for first-order MDPs
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Hi-index | 0.00 |
It is obvious to anyone familiar with the rules of the game of chess that a king on an empty board can reach every square. It is true, but not obvious, that a knight can reach every square. Why is the first fact obvious but the second fact not? This paper presents an analytic theory of a class of obviousness judgments of this type. Whether or not the specifics of this analysis are correct, it seems that the study of obviousness judgments can be used to construct integrated theories of linguistics, knowledge representation, and inference.