Complexity in classificatory reasoning

Authors:
Ashok Goel;N. Soundararajan;B. Chandrasekaran
Affiliations:
Department of Computer and Information Science, The Ohio State University, Columbus, Ohio;Department of Computer and Information Science, The Ohio State University, Columbus, Ohio;Department of Computer and Information Science, The Ohio State University, Columbus, Ohio
Venue:
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
Year:
1987

Citing 3
Cited 1

Heuristic classification

Artificial Intelligence
CRSL: A language for classificatory problem solving and uncertainty handling

AI Magazine
Some studies in machine learning using the game of checkers. II: recent progress

IBM Journal of Research and Development

Perceptually grounded self-diagnosis and self-repair of domain knowledge

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Classificatory reasoning involves the tasks of concept evaluation and classification, which may be performed with use of the strategies of concept matching and concept activation, respectively. Different implementations of the strategies of concept matching and concept activation are possible, where an implementation is characterized by the organization of knowledge and the control of information processing it uses. In this paper we define the tasks of concept evaluation and classification, and describe the strategies of concept matching and concept activation. We then derive the computational complexity of the tasks using different implementations of the task-specific strategies. We show that the complexity of performing a task is determined by the organization of knowledge used in performing it. Further, we suggest that the implementation that is computationally the most efficient for performing a task may be cognitively the most plausible as well.