Querying with vague quantifiers using probabilistic semantics

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Many realistic scenarios call for answers to questions involving vague expressions like almost all, about half, or at least about a third. We present a modular extension of classical first-order queries over relational databases, with binary, proportional, semi-fuzzy quantifiers modeling such expressions via random sampling. The extended query language has an intuitive semantics and allows one to pose natural queries with probabilistic answers. This is also demonstrated by experiments with an implementation involving the (geographical) MONDIAL data set.

Cite

CITATION STYLE

APA

Fermüller, C. G., Hofer, M., & Ortiz, M. (2017). Querying with vague quantifiers using probabilistic semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10333 LNAI, pp. 15–27). Springer Verlag. https://doi.org/10.1007/978-3-319-59692-1_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free