Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Amélie Gheerbrant"'
Autor:
Amélie Gheerbrant, Balder ten Cate
Publikováno v:
Logical Methods in Computer Science, Vol Volume 8, Issue 4 (2012)
We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present axiomatizations o
Externí odkaz:
https://doaj.org/article/ba92e3ffc4fb4710a5473db870ef1eec
Publikováno v:
Gheerbrant, A, Libkin, L, Rogova, A & Sirangelo, C 2022, Certain Answers of Extensions of Conjunctive Queries by Datalog and First-Order Rewriting . in M Alviano & A Pieris (eds), Proceedings of the 4th International Workshop on the Resurgence of Datalog in Academia and Industry (Datalog-2.0 2022) . CEUR Workshop Proceedings, vol. 3203, pp. 14-26, 4th International Workshop on the Resurgence of Datalog in Academia and Industry, Genova-Nervi, Italy, 5/09/22 . < http://ceur-ws.org/Vol-3203/ >
4th International Workshop on the Resurgence of Datalog in Academia and Industry
4th International Workshop on the Resurgence of Datalog in Academia and Industry, Sep 2022, Genoa, Italy
HAL
4th International Workshop on the Resurgence of Datalog in Academia and Industry
4th International Workshop on the Resurgence of Datalog in Academia and Industry, Sep 2022, Genoa, Italy
HAL
To answer database queries over incomplete data the gold standard is finding certain answers: those that are true regardless of how incomplete data is interpreted. Such answers can be found efficiently for conjunctive queries and their unions, even i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::04a96709b9891ae68bdc3877468ee144
https://hdl.handle.net/20.500.11820/deacdc3a-69c6-4bb5-9e96-5d64ae4536a3
https://hdl.handle.net/20.500.11820/deacdc3a-69c6-4bb5-9e96-5d64ae4536a3
Autor:
Cristina Sirangelo, Amélie Gheerbrant
Publikováno v:
IJCAI
HAL
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI 2019)
the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI 2019)
the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI 2019), Aug 2019, Macao, China
HAL
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI 2019)
the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI 2019)
the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI 2019), Aug 2019, Macao, China
International audience; Answering queries over incomplete data is ubiquitous in data management and in many AI applications that use query rewriting to take advantage of relational database technology. In these scenarios one lacks full information on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::333219995db6c325833b9f68663e454f
https://hal.archives-ouvertes.fr/hal-02971723
https://hal.archives-ouvertes.fr/hal-02971723
Autor:
Johan van Benthem, Amélie Gheerbrant
Publikováno v:
Fundamenta Informaticae, 100(1-4), 19-41. IOS Press
Current methods for solving games embody a form of "procedural rationality" that invites logical analysis in its own right. This paper is a brief case study of Backward Induction for extensive games, replacing earlier static logical definitions by st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e6f96184f1309ec3ccd0ec2abd47b0e3
https://hdl.handle.net/11245/1.331131
https://hdl.handle.net/11245/1.331131
Autor:
Marcin Mostowski, Amélie Gheerbrant
Publikováno v:
MLQ. 52:87-94
We consider first order modal logic C firstly defined by Carnap in “Meaning and Necessity” [1]. We prove elimination of nested modalities for this logic, which gives additionally the Skolem-Lowenheim theorem for C. We also evaluate the degree of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6b1707046fc0418f34f102d0a05619f
https://doi.org/10.1002/malq.200410057
https://doi.org/10.1002/malq.200410057
Autor:
Leonid Libkin, Amélie Gheerbrant
Publikováno v:
Gheerbrant, A & Libkin, L 2014, ' Certain Answers over Incomplete XML Documents: Extending Tractability Boundary ', Theory of Computing Systems, vol. 57, no. 4, pp. 1-35 . https://doi.org/10.1007/s00224-014-9596-y
Previous studies of incomplete XML documents have identified three main sources of incompleteness --- in structural information, data values, and labeling --- and addressed data complexity of answering analogs of unions of conjunctive queries under t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31c55b4c5b5deacbaaf0578a1d12e99c
https://www.pure.ed.ac.uk/ws/files/19964150/tocs.pdf
https://www.pure.ed.ac.uk/ws/files/19964150/tocs.pdf
Publikováno v:
Web Reasoning and Rule Systems ISBN: 9783642396656
RR
Gheerbrant, A, Libkin, L & Sirangelo, C 2013, Reasoning About Pattern-Based XML Queries . in Web Reasoning and Rule Systems : 7th International Conference, RR 2013, Mannheim, Germany, July 27-29, 2013. Proceedings . vol. 7994, pp. 4-18 . https://doi.org/10.1007/978-3-642-39666-3_2
RR-7th International Conference on Web Reasoning and Rule Systems, 2013
RR-7th International Conference on Web Reasoning and Rule Systems, 2013, Jul 2013, Mannheim, Germany
HAL
RR
Gheerbrant, A, Libkin, L & Sirangelo, C 2013, Reasoning About Pattern-Based XML Queries . in Web Reasoning and Rule Systems : 7th International Conference, RR 2013, Mannheim, Germany, July 27-29, 2013. Proceedings . vol. 7994, pp. 4-18 . https://doi.org/10.1007/978-3-642-39666-3_2
RR-7th International Conference on Web Reasoning and Rule Systems, 2013
RR-7th International Conference on Web Reasoning and Rule Systems, 2013, Jul 2013, Mannheim, Germany
HAL
International audience; We survey results about static analysis of pattern-based queries over XML documents. These queries are analogs of conjunctive queries, their unions and Boolean combinations, in which tree patterns play the role of atomic formu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed257f1293349d0853badf27e1443330
https://doi.org/10.1007/978-3-642-39666-3_2
https://doi.org/10.1007/978-3-642-39666-3_2
Publikováno v:
In Search of Elegance in the Theory and Practice of Computation ISBN: 9783642416590
In Search of Elegance in the Theory and Practice of Computation
Gheerbrant, A, Libkin, L & Reutter, J 2013, Static Analysis and Query Answering for Incomplete Data Trees with Constraints . in In Search of Elegance in the Theory and Practice of Computation-Essays Dedicated to Peter Buneman . Lecture Notes in Computer Science, vol. 8000, Springer-Verlag GmbH, pp. 273-290 . https://doi.org/10.1007/978-3-642-41660-6_15
In Search of Elegance in the Theory and Practice of Computation
Gheerbrant, A, Libkin, L & Reutter, J 2013, Static Analysis and Query Answering for Incomplete Data Trees with Constraints . in In Search of Elegance in the Theory and Practice of Computation-Essays Dedicated to Peter Buneman . Lecture Notes in Computer Science, vol. 8000, Springer-Verlag GmbH, pp. 273-290 . https://doi.org/10.1007/978-3-642-41660-6_15
Data trees serve as an abstraction of XML documents: in such trees, every node comes with a label from a finite alphabet, as well as a data value from an infinite set. Incomplete data trees model XML documents with incomplete information; they may in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a4c55ce70669d92d335f0f96ad4a60f8
https://doi.org/10.1007/978-3-642-41660-6_15
https://doi.org/10.1007/978-3-642-41660-6_15
Publikováno v:
Proceedings of International Conference on Database Theory (ICDT'13)
International Conference on Database Theory (ICDT'13)
International Conference on Database Theory (ICDT'13), 2013, Italy. pp.12
ICDT
HAL
International Conference on Database Theory (ICDT'13)
International Conference on Database Theory (ICDT'13), 2013, Italy. pp.12
ICDT
HAL
International audience; We study static analysis, in particular the containment problem, for analogs of conjunctive queries over XML documents. The problem has been studied for queries based on arbitrary patterns, not necessarily following the tree s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::617cb8410597822eda289f4b30d5519b
https://hal-upec-upem.archives-ouvertes.fr/hal-00788621/file/icdt2013.pdf
https://hal-upec-upem.archives-ouvertes.fr/hal-00788621/file/icdt2013.pdf
Autor:
Balder ten Cate, Amélie Gheerbrant
We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present axiomatizations o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a5d7c9a3290c53e30c0f57b45292c1b
http://arxiv.org/abs/1210.2620
http://arxiv.org/abs/1210.2620