Analog retrieval by constraint satisfaction
Artificial Intelligence
Inside Case-Based Reasoning
Assessing aspects of reading by a connectionist model
Neurocomputing
A connectionist model of human reading
IWANN'07 Proceedings of the 9th international work conference on Artificial neural networks
Text representation by a computational model of reading
ICONIP'06 Proceedings of the 13 international conference on Neural Information Processing - Volume Part I
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 ...