Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Possibilistic Decision Logic with Applications

A Possibilistic Decision Logic with Applications In this paper, we investigate a knowledge representation formalism in the context of fuzzy data tables. A possibilistic decision logic incorporating linguistic terms is proposed for representing and reasoning about knowledge in fuzzy data tables. Two applications based on the logic are described. The first is the extraction of fuzzy rules from general fuzzy data tables. In this application, the knowledge in the tables may be made explicit by the formulas of the logic or used implicitly in decision-making. The second is for the fuzzy quantization problem of precise data tables. It can be viewed as a special case of the first, however, due to some special properties of the problem, a polynomial time rule extraction process can be obtained. Finally, the relationship of the logic with some works for handling uncertain information in data tables is also discussed. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Fundamenta Informaticae IOS Press

A Possibilistic Decision Logic with Applications

Fundamenta Informaticae , Volume 46 (3) – Jan 1, 2001

Loading next page...
 
/lp/ios-press/a-possibilistic-decision-logic-with-applications-6BxsMI623J

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
IOS Press
Copyright
Copyright © 2001 by IOS Press, Inc
ISSN
0169-2968
eISSN
1875-8681
Publisher site
See Article on Publisher Site

Abstract

In this paper, we investigate a knowledge representation formalism in the context of fuzzy data tables. A possibilistic decision logic incorporating linguistic terms is proposed for representing and reasoning about knowledge in fuzzy data tables. Two applications based on the logic are described. The first is the extraction of fuzzy rules from general fuzzy data tables. In this application, the knowledge in the tables may be made explicit by the formulas of the logic or used implicitly in decision-making. The second is for the fuzzy quantization problem of precise data tables. It can be viewed as a special case of the first, however, due to some special properties of the problem, a polynomial time rule extraction process can be obtained. Finally, the relationship of the logic with some works for handling uncertain information in data tables is also discussed.

Journal

Fundamenta InformaticaeIOS Press

Published: Jan 1, 2001

There are no references for this article.