Relaxation paradigm in a flexible querying context

Authors:
Patrick Bosc;Allel HadjAli;Olivier Pivert
Affiliations:
IRISA/ENSSAT, Université de Rennes 1, Lannion, France;IRISA/ENSSAT, Université de Rennes 1, Lannion, France;IRISA/ENSSAT, Université de Rennes 1, Lannion, France
Venue:
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Year:
2006

Citing 3
Cited 2

SEAVE: a mechanism for verifying user presuppositions in query systems

ACM Transactions on Information Systems (TOIS)
Towards a tolerance-based technique for cooperative answering of fuzzy queries against regular databases

OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Qualitative reasoning based on fuzzy relative orders of magnitude

IEEE Transactions on Fuzzy Systems

Empty versus overabundant answers to flexible relational queries

Fuzzy Sets and Systems
Incremental controlled relaxation of failing flexible queries

Journal of Intelligent Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we discuss an approach for relaxing a failing query in the context of flexible querying. The approach relies on the notion of proximity which is defined in a relative way. We show how such proximity allows for transforming a given predicate into an enlarged one. The resulting predicate is semantically not far from the original one and it is obtained by a simple fuzzy arithmetic operation. We show also how the search for a non-failing relaxed query over the lattice of relaxed queries can be improved by exploiting the notions of MFSs (Minimal Failing Sub-queries) and MGQs (Maximally Generalized failing Queries) of the original query.