Readings in natural language processing
Readings in natural language processing
TREAT: a new and efficient match algorithm for AI production systems
TREAT: a new and efficient match algorithm for AI production systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Subsumption in KL-ONE is undecidable
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Terminological knowledge representation systems supporting N-ary terms
Proceedings of the first international conference on Principles of knowledge representation and reasoning
An efficient context-free parsing algorithm
Communications of the ACM
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Classification in the KL-ONE knowledge representation system
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
The restricted language architecture of a hybrid representation system
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Controlling the hypothesis space in probabilistic plan recognition
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
This paper presents some complexity results for deductive recognition in the framework of languages such as KL-ONE. In particular. it focuses on classification operations that are usually performed in these languages through subsumption computations. The paper presents a simple language that encompasses and extends earlier KL-ONE-based recognition frameworks. By relying on parsing algorithms. the paper shows that a significant class of recognition problems in this language can be performed in polynomial time. This is in marked contrast to the exponentiality and undecidability results that have recently been obtained for subsumption in even some of the most restricted variants of KL-ONE.