Reformulating Queries: Theory and Practice

@inproceedings{Benedikt2017ReformulatingQT,
  title={Reformulating Queries: Theory and Practice},
  author={Michael Benedikt and Egor V. Kostylev and Fabio Mogavero and Efthymia Tsamoura},
  booktitle={IJCAI},
  year={2017}
}
We consider a setting where a user wants to pose a query against a dataset where some background knowledge, expressed as logical sentences, is available, but only a subset of the information can be used to answer the query. We thus want to reformulate the user query against the subvocabulary, arriving at a query that is equivalent to the user’s query assuming the background theory, but using only the restricted vocabulary. We consider two variations of the problem, one where we want any such… 

Figures and Tables from this paper

Logic-based Perspectives on Query Reformulationover Restricted Interfaces
TLDR
An approach to the problem via reduction to query containment with constraints, where the reduction makes use of interpolation algorithms from logic, is overviewed.
How Can Reasoners Simplify Database Querying (And Why Haven't They Done It Yet)?
TLDR
A review of some of the results and reasoning algorithms that have been developed with a motivation from query evaluation, and a look at open problems in the area as well as a critique of prior work from the point of view of practice.
SPARQLIt: Interactive SPARQL Query Refinement
TLDR
This demonstration will use the Yago Ontology to exemplify the ease of constructing queries with SPARQLIt without prior knowledge of its contents, and allow participants to specify queries of their choice and walk them through the interactive process of query refinement.
Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of First-Order Logic
TLDR
PIE is a Prolog-embedded environment for automated reasoning on the basis of first-order logic that supports a workflow based on documents that intersperse macro definitions, invocations of reasoners, and LaTeX-formatted natural language text.
Interpolants and Explicit Definitions in Extensions of the Description Logic EL
TLDR
It is shown that the vast majority of extensions of the description logic EL do not enjoy the Craig interpolation nor the projective Beth definability property, but nevertheless the existence of interpolants and explicit definitions can be decided in polynomial time for standard tractable extensions of EL and in ExpTime for ELI and various extensions.
Declarative Programming and Knowledge Management: Conference on Declarative Programming, DECLARE 2019, Unifying INAP, WLP, and WFLP, Cottbus, Germany, September 9–12, 2019, Revised Selected Papers
TLDR
This paper describes a new approach for solving Answer Set Programming that exploits the parallelism provided by GPUs.
Craig Interpolation and Access Interpolation with Clausal First-Order Tableaux
We show methods to extract Craig-Lyndon interpolants and access interpolants from clausal first-order tableaux as produced by automated first-order theorem provers based on model elimination, the
Craig Interpolation with Clausal First-Order Tableaux
We develop foundations for computing Craig-Lyndon interpolants of two given formulas with first-order theorem provers that construct clausal tableaux. Provers that can be understood in this way
PIE - Proving, Interpolating and Eliminating on the Basis of First-Order Logic
PIE is a Prolog-embedded environment for automated reasoning on the basis of first-order logic. It includes a versatile formula macro system and supports the creation of documents that intersperse

References

SHOWING 1-10 OF 41 REFERENCES
The backchase revisited
  • M. Meier
  • Computer Science
    The VLDB Journal
  • 2013
TLDR
The implementation of this paper's approach, the Pegasussystem, outperforms existing C&B systems an average by two orders of magnitude and is due to a combination of novel methods that lower the complexity in practical situations significantly.
On Enumerating Query Plans Using Analytic Tableau
TLDR
This work presents a two-phase adaptation of a tableau calculus that ensures all plans logically equivalent to the query with respect to the schema, that correctly implement the user query, are indeed found.
Data exchange: semantics and query answering
TLDR
This paper gives an algebraic specification that selects, among all solutions to the data exchange problem, a special class of solutions that is called universal and shows that a universal solution has no more and no less data than required for data exchange and that it represents the entire space of possible solutions.
Disjunctive datalog
TLDR
It is demonstrated that problems relevant in practice such as computing the optimal tour value in the Traveling Salesman Problem and eigenvector computations can be handled in disjunctive Datalog, but not Datalogs with negation (unless the Polynomial Hierarchy collapses).
The chase revisited
TLDR
The standard chase procedure is revisited, and the extended core chase is introduced, i.e. finds an F-universal model set when it exists, and a key advantage of the new chase is that the same algorithm can be applied for all mapping classes F of interest, simply by modifying the set of constraints given as input.
The DLV system for knowledge representation and reasoning
TLDR
The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration, and the main international projects investigating the potential of the system for industrial exploitation are described.
Fundamentals of Physical Design and Query Compilation
TLDR
This book is an introduction to the fundamental methods underlying database technology that solves the problem of query compilation in terms of first-order logic which serves as the vehicle for specifying physical design, expressing user requests and query plans, and understanding how query plans implement user requests.
Small Is Beautiful: Computing Minimal Equivalent EL Concepts
TLDR
An algorithm and a tool for computing minimal, equivalent EL concepts wrt.
The complexity of Boolean formula minimization
TLDR
The complexity of the original, unbounded depth Minimum Equivalent Expression problem, by showing that the depth-k version is @S"2^P-complete under Turing reductions for all k>=3, is settled.
...
...