AI Magazine
The computational complexity of abduction
Artificial Intelligence - Special issue on knowledge representation
Hard problems for simple default logics
Artificial Intelligence - Special issue on knowledge representation
Semantic Networks: An Evidential Formalization and Its Connectionist Realization
Semantic Networks: An Evidential Formalization and Its Connectionist Realization
Knowledge Retrieval as Limited Inference
Proceedings of the 6th Conference on Automated Deduction
Automatic Recognition of Tractability for Inference Relations
Automatic Recognition of Tractability for Inference Relations
A connectionist parser for Structure Unification Grammar
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Rules and variables in neural nets
Neural Computation
The tractability of path-based inheritance
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
A decidable first-order logic for knowledge representation
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
A connectionist framework for reasoning: reasoning with examples
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Hi-index | 0.00 |
The problem of finding a set of assumptions which explain a given proposition is in general NP-hard, even when the background theory is an acyclic Horn theory. In this paper it is shown that when the background theory is acyclic Horn and its pseudo-completion ...