Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Abstract. We consider the problem of specifying and computing consistent answers to queries against databases that do not satisfy given integrity constraints. This is done by simul...
Marcelo Arenas, Leopoldo E. Bertossi, Michael Kife...
Recent years have shown a surge in interest in temporal database systems, which allow users to store time-dependent intbrmation. We present a novel controlled natural language int...
In recent years a small number of web-based tools have been proposed to help students learn to write SQL query statements and also to assess students’ SQL writing skills. SQLify ...
In this paper we show how recent concepts from Dynamic Logic, and in particular from Dynamic Epistemic logic, can be used to model and interpret quantum behavior. Our main thesis ...