Title
Strict and tolerant antidivision queries with ordinal layered preferences
Abstract
In this paper, we are interested in taking preferences into account for a family of queries inspired by the antidivision. An antidivision query aims at retrieving the elements associated with none of the elements of a specified set of values. We suggest the introduction of preferences inside such queries with the following specificities: (i) the user gives his/her preferences in an ordinal way and (ii) the preferences apply to the divisor which is defined as a hierarchy of sets. Different uses of the hierarchy are investigated, which leads to queries conveying different semantics and the property of the result delivered is characterized. Furthermore, the case where a conjunctive stratified antidivision query returns an empty set of answers is dealt with, and an approach aimed at relaxing such queries is proposed.
Year
DOI
Venue
2011
10.1016/j.ijar.2010.04.004
Int. J. Approx. Reasoning
Keywords
Field
DocType
ordinal preferences,different semantics,conjunctive stratified antidivision query,empty set,antidivision,following specificities,quotient,tolerant antidivision query,ordinal layered preference,different use,fuzzy quantifiers,antidivision query,query relaxation,database querying
Conjunctive query,Knowledge representation and reasoning,Empty set,Ordinal number,Fuzzy logic,Artificial intelligence,Hierarchy,Answer set programming,Mathematics,Semantics,Machine learning
Journal
Volume
Issue
ISSN
52
1
International Journal of Approximate Reasoning
Citations 
PageRank 
References 
2
0.40
13
Authors
3
Name
Order
Citations
PageRank
Patrick Bosc160175.23
Olivier Pivert2891101.81
Olivier Soufflet341.12