S. Abiteboul, M. Bienvenu, and D. Deutch, Deduction in the presence of distribution and contradictions, WebDB Workshop, pp.31-36, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00809300

S. Abiteboul, M. Bienvenu, A. Galland, and E. Antoine, A rule-based language for web data management, Proceedings of the 30th symposium on Principles of database systems of data, PODS '11, 2011.
DOI : 10.1145/1989284.1989320
URL : https://hal.archives-ouvertes.fr/inria-00582891

S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases, 1995.

S. Abiteboul, P. C. Kanellakis, and G. Grahne, On the representation and querying of sets of possible worlds, Theor. Comput. Sci, vol.78, issue.1, 1991.

S. Abiteboul, B. Kimelfeld, Y. Sagiv, and P. Senellart, On the expressiveness of probabilistic XML models, The VLDB Journal, vol.31, issue.4, 2009.
DOI : 10.1007/s00778-009-0146-1
URL : https://hal.archives-ouvertes.fr/inria-00429498

S. Abiteboul and V. Vianu, Fixpoint extensions of first-order logic and datalog-like languages, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.71-79, 1989.
DOI : 10.1109/LICS.1989.39160

S. Abiteboul and V. Vianu, Datalog extensions for database queries and updates, Journal of Computer and System Sciences, vol.43, issue.1, pp.62-124, 1991.
DOI : 10.1016/0022-0000(91)90032-Z
URL : https://hal.archives-ouvertes.fr/inria-00075656

S. Abiteboul and V. Vianu, Non-determinism in logic-based languages, Annals of Mathematics and Artificial Intelligence, vol.28, issue.1, pp.151-186, 1991.
DOI : 10.1007/BF01530924

P. Alvaro, W. R. Marczak, N. Conway, J. M. Hellerstein, D. Maier et al., Dedalus: Datalog in Time and Space, Datalog, pp.262-281, 2011.
DOI : 10.1007/978-3-642-24206-9_16

L. Antova, C. Koch, and D. Olteanu, $${10^{(10^{6})}}$$ worlds and beyond: efficient representation and processing of incomplete information, The VLDB Journal, vol.4, issue.4, pp.1021-1040, 2009.
DOI : 10.1007/s00778-009-0149-y

M. Arenas and L. Libkin, Xml data exchange: Consistency and query answering, J. ACM, vol.55, issue.2, 2008.

M. Benedikt, E. Kharlamov, D. Olteanu, and P. Senellart, Probabilistic XML via Markov Chains, Proceedings of the VLDB Endowment, vol.3, issue.1-2, 2010.
DOI : 10.14778/1920841.1920939
URL : https://hal.archives-ouvertes.fr/hal-00537778

L. E. Bertossi, Database Repairing and Consistent Query Answering, Synthesis Lectures on Data Management, vol.3, issue.5, 2011.
DOI : 10.2200/S00379ED1V01Y201108DTM020

P. Buneman, S. Khanna, and W. C. Tan, Why and Where: A Characterization of Data Provenance, ICDT, 2001.
DOI : 10.1007/3-540-44503-X_20

A. Calì, G. Gottlob, T. Lukasiewicz, and A. Pieris, Datalog+/-: A Family of Languages for Ontology Querying, Datalog, pp.351-368, 2010.
DOI : 10.1007/978-3-642-24206-9_20

A. Calì, G. Gottlob, and A. Pieris, Towards more expressive ontology languages: The query answering problem, Artificial Intelligence, vol.193, pp.87-128, 2012.
DOI : 10.1016/j.artint.2012.08.002

A. Cali, D. Lembo, and R. Rosati, Query Answering by Rewriting in GLAV Data Integration Systems Under Constraints, IJCAI, 2003.
DOI : 10.1007/978-3-540-31839-2_13

S. Cohen and B. Kimelfeld, Querying parse trees of stochastic context-free grammars, Proceedings of the 13th International Conference on Database Theory, ICDT '10, pp.62-75, 2010.
DOI : 10.1145/1804669.1804680

N. N. Dalvi and D. Suciu, Efficient query evaluation on probabilistic databases, VLDB, pp.864-875, 2004.

N. N. Dalvi and D. Suciu, Management of probabilistic data, Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '07, 2007.
DOI : 10.1145/1265530.1265531

D. Deutch, C. Koch, and T. Milo, On probabilistic fixpoint and Markov chain query languages, Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems of data, PODS '10, 2010.
DOI : 10.1145/1807085.1807114

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa, Data exchange: semantics and query answering, Theor. Comput. Sci, vol.336, issue.1, 2005.

N. Fuhr, Probabilistic datalog:a logic for powerful retrieval methods, SIGIR, 1995.

A. Galland, S. Abiteboul, A. Marian, and P. Senellart, Corroborating information from disagreeing views, Proceedings of the third ACM international conference on Web search and data mining, WSDM '10, 2010.
DOI : 10.1145/1718487.1718504
URL : https://hal.archives-ouvertes.fr/inria-00429546

J. Gao, H. Qiu, X. Jiang, T. Wang, and D. Yang, Fast top-k simple shortest paths discovery in graphs, Proceedings of the 19th ACM international conference on Information and knowledge management, CIKM '10, 2010.
DOI : 10.1145/1871437.1871504

W. Gatterbauer and D. Suciu, Data conflict resolution using trust mappings, Proceedings of the 2010 international conference on Management of data, SIGMOD '10, 2010.
DOI : 10.1145/1807167.1807193
URL : http://arxiv.org/abs/1012.3320

M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, Proc. of ICLP, pp.1070-1080, 1988.

F. Giannotti, S. Greco, D. Sacca, and C. Zaniolo, Programming with non-determinism in deductive databases, Annals of Mathematics and Artificial Intelligence, vol.19, 1997.

F. Giannotti and D. Pedreschi, Datalog with non-deterministic choice computes NDB-PTIME, The Journal of Logic Programming, vol.35, issue.1, pp.79-101, 1998.
DOI : 10.1016/S0743-1066(97)10004-8

S. Greco, D. Saccà, and C. Zaniolo, DATALOG queries with stratified negation and choice: from P to D P, ICDT, pp.82-96, 1995.
DOI : 10.1007/3-540-58907-4_8

T. J. Green, G. Karvounarakis, and V. Tannen, Provenance semirings, Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '07, 2007.
DOI : 10.1145/1265530.1265535

T. J. Green and V. Tannen, Models for Incomplete and Probabilistic Information, IEEE D. Eng. Bull, vol.29, issue.1, 2006.
DOI : 10.1007/11896548_24

T. J. Green, G. Karvounarakis, Z. G. Ives, and V. Tannen, Update exchange with mappings and provenance, VLDB, 2007.

T. Imielinski and W. Lipski-jr, Incomplete information in relational databases, J. ACM, vol.31, issue.4, 1984.

B. Kanagal, J. Li, and A. Deshpande, Sensitivity analysis and explanations for robust query evaluation in probabilistic databases, Proceedings of the 2011 international conference on Management of data, SIGMOD '11, pp.841-852, 2011.
DOI : 10.1145/1989323.1989411

C. Koch, Approximating predicates and expressive queries on probabilistic databases, Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '08, pp.99-108, 2008.
DOI : 10.1145/1376916.1376932
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.8749

C. Koch, A compositional query algebra for second-order logic and uncertain databases, Proceedings of the 12th International Conference on Database Theory, ICDT '09, 2009.
DOI : 10.1145/1514894.1514911

L. Kot and C. Koch, Cooperative update exchange in the Youtopia system, Proceedings of the VLDB Endowment, vol.2, issue.1, 2009.
DOI : 10.14778/1687627.1687650

L. Libkin, Data exchange and incomplete information, Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '06, pp.60-69, 2006.
DOI : 10.1145/1142351.1142360

B. T. Loo, T. Condie, M. Garofalakis, D. Gay, J. M. Hellerstein et al., Declarative networking, Proceedings of the 2006 ACM SIGMOD international conference on Management of data , SIGMOD '06, 2006.
DOI : 10.1145/1142473.1142485

Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola et al., Distributed GraphLab, Proceedings of the VLDB Endowment, vol.5, issue.8, pp.716-727, 2012.
DOI : 10.14778/2212351.2212354

G. Malewicz, M. H. Austern, J. Aart, J. C. Bik, I. Dehnert et al., Pregel: A system for large-scale graph processing, SIGMOD, 2010.

A. Meliou, W. Gatterbauer, K. F. Moore, and D. Suciu, The complexity of causality and responsibility for query answers and non-answers, Proceedings of the VLDB Endowment, vol.4, issue.1, pp.34-45, 2010.
DOI : 10.14778/1880172.1880176

D. Olteanu, C. Koch, and L. Antova, World-set decompositions: Expressiveness and efficient algorithms, Theoretical Computer Science, vol.403, issue.2-3, pp.265-284, 2008.
DOI : 10.1016/j.tcs.2008.05.004

C. Ré and D. Suciu, Approximate lineage for probabilistic databases, Proc. VLDB Endow, pp.797-808, 2008.

R. Rosati, On the complexity of dealing with inconsistency in description logic ontologies, IJCAI, pp.1057-1062, 2011.

D. Saccà and C. Zaniolo, Stable models and non-determinism in logic programs with negation, Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '90, pp.205-217, 1990.
DOI : 10.1145/298514.298572

P. Senellart and S. Abiteboul, On the complexity of managing probabilistic XML data, Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '07, pp.283-292, 2007.
DOI : 10.1145/1265530.1265570
URL : https://hal.archives-ouvertes.fr/inria-00137138

B. Ten-cate, G. Fontaine, and P. G. Kolaitis, On the data complexity of consistent query answering, ICDT, pp.22-33, 2012.

J. Wijsen, Charting the tractability frontier of certain conjunctive query answering, Proceedings of the 32nd symposium on Principles of database systems, PODS '13, pp.189-200, 2013.
DOI : 10.1145/2463664.2463666