The Quotient Space Theory of Problem Solving

Issue title: The 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Conputing (RSFDGrC 2003)

Article type: Research Article

Authors: Zhang, Ling | Zhang, Bo

Affiliations: Artificial Intelligence Institute, Anhui University, Hefei, Anhui, China 230039 | Department of Computer Science and Technology, Tsinghua University, Beijing, China 100084

Abstract: The paper 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 problem spaces with different grain sizes can be represented by a set of quotient spaces. Given a problem, the construction of its quotient spaces is discussed. Based on the model, the computational complexity of hierarchical problem solving and the information combination are also dealt with. The model can also be extended to the fuzzy granular world.

Keywords: quotient space, problem solving, granular computing, hierarchy

Journal: Fundamenta Informaticae, vol. 59, no. 2-3, pp. 287-298, 2004