A Logic-Based Approach for Query Refinement

Authors:
Nenad Stojanovic
Affiliations:
University of Karlsruhe, Germany
Venue:
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Year:
2004

Citing 4
Cited 0

User choices: a new yardstick for the evaluation of ranking algorithms for interactive query expansion

Information Processing and Management: an International Journal
An Approach to Integrating Query Refinement in SQL

EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Effective Reformulation of Boolean Queries with Concept Lattices

FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
Generalization and a Framework for Query Modification

Proceedings of the Sixth International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a novel approach for the refinement of relational queries that enables so-called step-by-step refinement of a user's query. The approach is based on discovering causal relationships between queries regarding the inclusion relation between the answers of these queries. We define a formal model for these query-answering pairs and use methods from inductive logic programming for the efficient calculation of a (lattice) order between them. The approach is very suitable for modelling information retrieval tasks based on the database repositories, like searching product catalogues.