ABSTRACT
Bounded Derivation Depth property (BDD) and Finite Controllability (FC) are two properties of sets of datalog rules and tuple generating dependencies (known as Datalog3 programs), which recently attracted some attention. We conjecture that the first of these properties implies the second, and support this conjecture by some evidence proving, among other results, that it holds true for all theories over binary signature.
- V. Barany, G. Gottlob, and M. Otto. Querying the guarded fragment; Proc. of the 25th IEEE Symposium on Logic in Computer Science, LICS 2010, Edinburgh, UK, pp. 1--10, 2010; Google Scholar
Digital Library
- A. Cali, G. Gottlob, and T. Lukasiewicz; A general datalog-based framework for tractable queryanswering over ontologies; in Proc. of PODS, 2009; Google Scholar
Digital Library
- A. Cali, G. Gottlob, and T. Lukasiewicz; A general datalog-based framework for tractable queryanswering over ontologies; J. Web Sem. 14, 2012, 57--83 Google Scholar
Digital Library
- A. Cali, G. Gottlob, and A. Pieris; Advanced processing for ontological queries; Proc. VLDB-10,3(1):554--565, 2010 Google Scholar
Digital Library
- A. Cali, G. Gottlob, and A. Pieris; % tu jest definicja sticky-join Query Answering under Non-guarded Rules in Datalog +/- ; Web Reasoning and Rule SystemsLecture Notes in Computer Science, 2010, Volume 6333, pp 1--17; Google Scholar
Digital Library
- T. Gogacz, J. Marcinkowski; Converging to the Chase and Some Finite. Controllability Results; Proc. of the 28th IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, USA, to appear;Google Scholar
- D. S. Johnson and A. C. Klug. Testing containment of conjunctive queries under functional and inclusiondependencies; JCSS 28(1):167--189, 1984;Google Scholar
Cross Ref
- R. Rosati; On the decidability and finite controllability of query processing in databases with incomplete information; in Proc. PODS 2006, pp. 356--365; Google Scholar
Digital Library
- R. Rosati; On the decidability and finite controllability of query processing in databases with incomplete information; J. Comput. Syst. Sci. 77(3),2011, pp. 572--594 Google Scholar
Digital Library
- S. Shelah; (1969), Stable theories; Israel J. Math. 7 (3): 187--202.Google Scholar
Index Terms
On the BDD/FC conjecture
Recommendations
Converging to the Chase -- A Tool for Finite Controllability
LICS '13: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer ScienceWe solve a problem, stated in [CGP10], showing that Sticky Datalog exists, defined in the cited paper as an element of the Datalog pm project, has the finite controllability property. In order to do that, we develop a technique, which we believe can ...
On the Circuit Diameter Conjecture
From the point of view of optimization, a critical issue is relating the combinatorial diameter of a polyhedron to its number of facets f and dimension d. In the seminal paper of Klee and Walkup (Acta Math 117:53---78, 1967), the Hirsch conjecture of an ...
On the finite controllability of conjunctive query answering in databases under open-world assumption
In this paper we study queries over relational databases with integrity constraints (ICs). The main problem we analyze is OWA query answering, i.e., query answering over a database with ICs under open-world assumption. The kinds of ICs that we consider ...






Comments