On rules with 649 existential variables: Walking the decidability line, Artif. Intell, vol.175, issue.9, pp.1620-1654, 2011. ,
DOI : 10.1016/j.artint.2011.03.002
URL : https://doi.org/10.1016/j.artint.2011.03.002
,
, Walking the complexity lines for generalized guarded existential rules, IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial, p.655
, IJCAI/AAAI, vol.656, pp.978-979, 2011.
The implication problem for data dependencies, Automata, Languages and Programming, p.660 ,
, Lecture Notes in Computer, vol.115, 1981.
, Science, vol.662, pp.73-85, 1981.
Chase termination for guarded existential 664 rules, Proceedings of the 34th ACM Symposium on 665 Principles of Database Systems, PODS 2015, p.667, 2015. ,
DOI : 10.1145/2745754.2745773
URL : http://ceur-ws.org/Vol-1378/AMW_2015_paper_28.pdf
Datalog extensions for tractable 669 query answering over ontologies, Fausto Giunchiglia, and Letizia, p.670 ,
, Semantic Web Information Management -A Model-Based Perspective, pp.671-249, 2009.
A general datalog-based framework 674 for tractable query answering over ontologies, J. Web Sem, vol.14, pp.57-83, 2012. ,
, , p.677
Tractable reasoning and efficient query answering in description logics: The DL-678 ,
Reasoning, vol.39, pp.385-429, 2007. ,
, , pp.149-158, 2008.
A normal form for relational databases that is based on domians and keys ,
, ACM Trans. Database Syst, vol.6, issue.3, p.319592, 1981.
Data exchange: 694 semantics and query answering, Theor. Comput. Sci, vol.336, issue.1, pp.89-124, 2005. ,
DOI : 10.1007/3-540-36285-1_14
All-instances termination of chase is undecidable, p.697 ,
DOI : 10.1007/978-3-662-43951-7_25
, Thore Husfeldt, and Elias Koutsoupias, p.698
, Den-699 mark, Proceedings, Part II, vol.8573, pp.293-304, 2014.
Query rewriting and optimization for 703 ontological databases, ACM Trans. Database Syst, vol.39, issue.3, 2014. ,
DOI : 10.1145/2638546
URL : http://arxiv.org/pdf/1405.2848
Anatomy of the chase, Fundam. Inform, vol.157, issue.3, pp.221-270, 2018. ,
DOI : 10.3233/fi-2018-1627
, , p.708
Acyclicity notions for existential rules and their application 709 to query answering in ontologies, J. Artif. Intell. Res, vol.47, pp.741-808, 2013. ,
Answering queries using views: A survey, VLDB J, vol.10, issue.4, pp.270-294, 2001. ,
Computing universal models under guarded TGDs, p.714 ,
DOI : 10.1145/2274576.2274600
, 15th International Conference on Database Theory, ICDT '12, p.716, 2012.
Sound, complete 718 and minimal ucq-rewriting for existential rules, Semantic Web, vol.6, issue.5, pp.451-475, 2015. ,
A single 721 approach to decide chase termination on linear existential rules, vol.722, 2018. ,
A single 724 approach to decide chase termination on linear existential rules ,
, Proceedings of the 31st International Workshop on Description 726
, 16th International Conference on Principles of Knowledge Representation 727 and Reasoning, vol.2211, 2018.
Data integration: A theoretical perspective, Serge, vol.731 ,
, Proceedings of the Twenty-first ACM SIGACTProvidence, pp.13-22, 2009.
An introduction to ontology-based query 741 answering with existential rules ,
DOI : 10.1007/978-3-319-10587-1_6
URL : https://hal-lirmm.ccsd.cnrs.fr/lirmm-01089990/file/main.pdf
, Data Era -10th International Summer School, 2014.
, Proceedings, vol.744, pp.245-278, 2014.
SPROUT: lazy vs. eager query plans 746 for tuple-independent probabilistic databases, p.747 ,
, Proceedings of the 25th International Conference on Data Engineering, vol.748, p.749, 2009.
, Society, 2009.
The chase procedure and its applications, Canada, 2012. ,
Graph minors. II. algorithmic aspects of tree-width ,
, J. Algorithms, vol.7, issue.3, pp.90023-90027, 1986.
Querying Existential Rule Knowledge Bases: Decidability and Complexity, p.758 ,
, terrogation de Bases de Connaissances avec Règles Existentielles : Décidabilité et Complexité)
Conjunctive Query Answering Under Existential Rules -Decidability, p.762 ,
URL : https://hal.archives-ouvertes.fr/tel-00925722
, , 2013.