Aggregating constraint satisfaction degrees expressed by possibilistic truth values

Authors:
G. De Tre;B. De Baets
Affiliations:
Dept. of Telecommun. & Inf. Process., Gent Univ., Belgium;-
Venue:
IEEE Transactions on Fuzzy Systems
Year:
2003

Citing 0
Cited 6

Null values in fuzzy databases

Journal of Intelligent Information Systems
Flexible querying in a relational framework supported by possibilistic logic

Fuzzy Sets and Systems
Weighted Conjunctive and Disjunctive Aggregation of Possibilistic Truth Values

IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
A Hierarchical Approach to Object Comparison

IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
Impact of weights on conjunctive and disjunctive aggregation of extended possibilistic truth values

Fuzzy Sets and Systems
Access to ethnic music: Advances and perspectives in content-based music information retrieval

Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In information systems, one often has to deal with constraints in order to compel the semantics and integrity of the stored information or to express some querying criteria. Hereby, different constraints can be of different importance. A method to aggregate the information about the satisfaction of a finite number of constraints for a given data instance is presented. Central to the proposed method is the use of extended possibilistic truth values (to express the degree of satisfaction of a constraint) and the use of residual implicators and residual coimplicators (to model the impact and relevance of a constraint). The proposed method can be applied to any constraint-based system. A database application is discussed and illustrated.