ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
A computational model of tractable reasoning: taking inspiration from cognition
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Observations on cognitive judgments
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
Natural language based inference procedures applied to schubert's steamroller
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
Hi-index | 0.00 |
A procedure is given for recognizing sets of inference rules that generate polynomial time decidable inference relations. The procedure can automatically recognize the tractability of the inference rules underlying congruence closure. The recognition of tractability for that particular rule set constitutes mechanical verification of a theorem originally proved independently by Kozen and Shostak. The procedure is algorithmic, rather than heuristic, and the class of automatically recognizable tractable rule sets can be precisely characterized. A series of examples of rule sets whose tractability is non-trivial, yet machine recognizable, is also given. The technical framework developed here is viewed as a first step toward a general theory of tractable inference relations.