Computational Feasibility of Structured Matching

Authors:
A. Goel;T. Bylander
Affiliations:
-;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1989

Citing 7
Cited 1

Heuristic classification

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

AI Magazine
Planning for conjunctive goals

Artificial Intelligence
The sciences of the artificial (3rd ed.)

The sciences of the artificial (3rd ed.)
Logic-structure tables

Communications of the ACM
Artificial Intelligence Programming

Artificial Intelligence Programming
Human Problem Solving

Human Problem Solving

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

Knowledge-Based Systems

Quantified Score

Hi-index	0.14

Visualization

Abstract

Structured matching is a task-specific technique for selecting one choice out of a small number of alternatives based on a given set of parameters. In structured matching, the knowledge and control for making a decision are integrated within a hierarchical structure. Each node in the hierarchy corresponds to a different aspect of the decision and contains knowledge for directly mapping the results of its children nodes (or selected parameters) into a choice on the subdecision. The root node selects the final choice for the decision. The authors formally characterize the task and strategy of structured matching and analyze its computational complexity. They believe that structured matching captures the essence of what makes a range of decision-making problems computationally feasible to solve.