Abstract
The talk introduces a framework of quotient space theory of problem solving. In the theory, a problem (or problem space) is represented as a triplet, including the universe, its structure and attributes. The worlds with different grain size are represented by a set of quotient spaces. The basic characteristics of different grain-size worlds are presented. Based on the model, the computational complexity of hierarchical problem solving is discussed.
Cite
CITATION STYLE
Zhang, L., & Zhang, B. (2003). The quotient space theory of problem solving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2639, pp. 11–15). Springer Verlag. https://doi.org/10.1007/3-540-39205-x_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
