Ontological reasoning with f-logic lite and its extensions

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2010, Pages 1660-1665

  Calì, Andrea ^a,b,d   Gottlob, Georg ^a,b   Kifer, Michael ^c   Lukasiewicz, Thomas ^a   Pieris, Andreas ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c Stony Brook University   (United States)

^d BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77958578162     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Aho, A.; Sagiv, Y.; and Ullman, J. D. 1979. Equivalence of relational expressions. SIAM J. Comput. 8(2):218-246.
2. Beeri, C, and Vardi, M. Y. 1984. A proof procedure for data dependencies. J. ACM 31 (4):718-741.
3. Calì, A., and Kifer, M. 2006. Containment of conjunctive object meta-queries. In Proc. of VLDB, 942-952.
4. Calì, A.; Gottlob, G.; and Kifer, M. 2008a. Taming the infinite chase. Unpublished technical report, available from the authors or at http : //benner.dbai.tuwien.ac.at/staff/gottlob/CGK.pdf.
5. Calì, A.; Gottlob, G.; and Kifer, M. 2008b. Taming the infinite chase: Query answering under expressive relational constraints. In Proc. of KR, 70-80.
6. Calì, A.; Gottlob, G.; and Lukasiewicz, T. 2009. A general datalog-based framework for tractable query answering over ontologies. In Proc. of PODS, 77-86.
7. Calì, A.; Gottlob, G.; and Pieris, A. 2009. Tractable query answering over conceptual schemata. In Proc. of ER, 175-190.
8. Calì, A.; Lembo, D.; and Rosati, R. 2003. On the decidability and complexity of query answering over inconsistent and incomplete databases. In Proc. of PODS, 260-271.
9. Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2007. Tractable reasoning and efficient query answering in description logics: The DL-lite family. J. Au-tom. Reasoning 39(3):385-429.
10. Calvanese, D.; Giacomo, G. D.; and Lenzerini, M. 1998. On the decidability of query containment under constraints. In Proc. of PODS, 385-429.
11. Chandra, A. K., and Vardi, M. Y. 1985. The implication problem for functional and inclusion dependencies. SIAM J. Comput. 14:671-677.
12. Chen, P. P. 1976. The entity-relationship model: towards a unified view of data. ACM TODS 1(1): 124-131.
13. Courcelle, B. 1990. The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Information and Computation 85(1): 12-75.
14. Deutsch, A.; Nash, A.; and Remmel, J. B. 2008. The chase revisisted. In Proc. of PODS, 149-158.
15. Deutsch, A. 2002. XML query reformulation over mixed and redundant storage. Ph.D. Dissertation, Dept. of Computer and Information Sciences, Univ. of Pennsylvania.
16. Fagin, R.; Kolaitis, P. G.; Miller, R. J.; and Popa, L. 2005. Data exchange: Semantics and query answering. Theor. Comput. Sci. 336(1):89-124.
17. Goncalves, M. E., and Gradel, E. 2000. Decidability issues for action guarded logics. In Description Logics, 123-132.
18. Gottlob, G., and Nash, A. 2008. Efficient core computation in data exchange. J. ACM 55(2).
19. Gottlob, G.; Leone, N.; and Scarcello, F. 2002. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64(3).
20. Johnson, D. S., and Klug, A. C. 1984. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28(1): 167-189.
21. Kifer, M.; Lausen, G.; and Wu, J. 1995. Logical foundations of object-oriented and frame-based languages. J. ACM 42:741-843.
22. Maier, D.; Mendelzon, A. O.; and Sagiv, Y. 1979. Testing implications of data dependencies. ACM Trans. Database Syst. 4(4):455-469.
23. Mitchell, J. 1983. The implication problem for functional and inclusion dependencies. Information and Control 56:154-173. (Pubitemid 14564553)
24. Poggi, A.; Lembo, D.; Calvanese, D.; De Giacomo, G.; Lenzerini, M.; and Rosati, R. 2008. Linking data to ontologies. J. Data Semantics 10:133-173.