On three fuzzy connectives for flexible data retrieval and their axiomatization

Authors:
Patrick Bosc;Olivier Pivert
Affiliations:
University of Rennes, Lannion -- France;University of Rennes, Lannion -- France
Venue:
Proceedings of the 2011 ACM Symposium on Applied Computing
Year:
2011

Citing 6
Cited 0

Weighted minimum and maximun operations in fuzzy sets theory

Information Sciences: an International Journal
Flexible queries in relational databases—the example of the division operator

Selected papers from the international workshop on Uncertainty in databases and deductive systems
A fuzzy query language with a linguistic hierarchical aggregator

SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Bipolarity in Flexible Querying

FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Extending relational algebra to handle bipolarity

Proceedings of the 2010 ACM Symposium on Applied Computing
SQLf: a relational database language for fuzzy querying

IEEE Transactions on Fuzzy Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In most of query languages, conjunctive and disjunctive combinations of conditions remain the usual way for aggregation. Fuzzy query languages also offer trade-off operators, such as means in order to compensate between elementary conditions. In this paper, we would like to introduce a new type of condition basically founded on the interaction between two predicates, thus enriching the panoply of tools the user is provided with and the power of query languages.