Converging to the Chase - A Tool for Finite Controllability

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2013, Pages 540-549

  Gogacz, Tomasz ^a   Marcinkowski, Jerzy ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

Finite Controllability; Sticky Logic; Tuple generating dependencies

Indexed keywords

CITED PAPERS; DATALOG; FINITE STRUCTURES; STICKY LOGIC; TUPLE-GENERATING DEPENDENCIES;

CONTROLLABILITY;

COMPUTATION THEORY;

EID: 84883412837     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2013.61     Document Type: Conference Paper

References (10)

1. V. Barany, G. Gottlob, and M. Otto; Querying the guarded fragment; Proceedings LICS 2010 pp. 1-10, 2010.
2. A. Cali, G. Gottlob, and T. Lukasiewicz; A general datalog-based framework for tractable query answering over ontologies; Proceedings of PODS 2009.
3. A. Cali, G. Gottlob, and A. Pieris; Advanced processing for ontological queries; Proceedings of VLDB-10, 3(1):554-565, 2010.
4. A. Cali, G. Gottlob, and A. Pieris; Query Answering under Non-guarded Rules in Datalog+/-; Web Reasoning and Rule Systems Lecture Notes in Computer Science, 2010, Volume 6333, pp 1-17;
5. T. Gogacz, J. Marcinkowski; On the BDD/FC conjecture; Proceedings PODS 2013, to appear.
6. D. S. Johnson and A. C. Klug; Testing containment of conjunctive queries under functional and inclusion dependencies; JCSS 28(1):167-189, 1984.
7. J. Marcinkowski; Undecidability of the Horn clause finite implication problem; Annual Conference on Computer Science Logic, CSL 1995, preprint;
8. J. Marcinkowski, L. Pacholski: Thue trees; Ann. Pure Appl. Logic 119(1-3): 19-59 (2003);
9. R. Rosati; On the decidability and finite controllability of query processing in databases with incomplete information; in Proc. PODS 2006, pp. 356-365.
10. S. Rudolph and M. Krötzsch and P. Hitzler; All Elephants are Bigger than All Mice; 21st Description Logic Workshop Dresden, Germany, 2008.