@INPROCEEDINGS { Rsds2133,
author = {Liu, Qing}, 
title = {Granular Language and Its Applications in Problem Solving}, 
booktitle = {Rough Sets and Current Trends in Computing}, 
conference = {Rough Sets and Current Trends in Computing}, 
series =  = {Lecture Notes in Artificial Intelligence}, 
volume = 3066, 
pages = {127-132}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
month = {June}, 
year = 2004, 
editor = {Tsumoto, Shusaku and Slowinski, Roman W. and Komorowski, Jan and Grzymala-Busse, Jerzy W.}, 
issn = {0302-9743}, 
isbn = {3-540-22117-4}, 
abstract = {Problem solving in AI points out that a global problem is decomposed into several locals, until into elementary sub-problems solved directly. Subsequently, the solutions of various sub-problems are amalgamated into an answer of the global problem. The solving problem in practice is represented by a logical formula, and then the formula is de-composed into several sub-formulas, until into propositions or predicates. The solutions of these sub-formulas are amalgamated into an answer of the global formula. If the formula is described as a granulation, then it will be collapsed into several sub-granules. So, the collapsing algorithm and rules of amalgamating will be defined. In order to realizing the idea in above, a granular language and its calculus will be discussed.}, 
keywords = {decompose, amalgamation, granules, problem solving, granular language, }, 
}