A Computational Model of Tractable Reasoning - Taking Inspiration from Cognition
Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence. Cognitive Modeling. Pages 202-206.
Abstract
Polynomial time complexity is the usual 'threshold' for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in the context of knowledge representation and reasoning. It is argued that doing so may be inappropriate in the context of common sense reasoning underlying language understanding. A more stringent criteria of tractability is proposed. A result about reasoning that is tractable in this stronger sense is outlined. Some unusual properties of tractable reasoning emerge when the formal specification is grounded in a neurally plausible architecture.
@inproceedings{ijcai1993p29,
title = {A Computational Model of Tractable Reasoning - Taking Inspiration from Cognition},
author = {Shastri, Lokendra},
booktitle = {Proceedings of the Thirteenth International Joint Conference on
Artificial Intelligence, {IJCAI-93}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ruzena Bajcsy},
pages = {202--206},
year = {1993},
note = {Cognitive Modeling},
url = {https://ijcai.org/proceedings/1993/29},
}
TY - CPAPER TI - A Computational Model of Tractable Reasoning - Taking Inspiration from Cognition AU - Shastri, Lokendra T2 - Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, IJCAI-93 PB - International Joint Conferences on Artificial Intelligence PY - 1993 SP - 202 EP - 206 UR - https://ijcai.org/proceedings/1993/29 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
