Diego Figueira
60
Documents
Publications
- 11
- 6
- 6
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 34
- 32
- 15
- 8
- 7
- 3
- 1
- 1
- 1
- 7
- 6
- 6
- 5
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 5
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 16
- 14
- 4
- 1
- 1
- 1
|
|
Semantic Optimization of Conjunctive QueriesJournal of the ACM (JACM), 2020, 67 (6:34), ⟨10.1145/3424908⟩
Article dans une revue
hal-02927969v1
|
Playing with repetitions in data words using energy gamesLogical Methods in Computer Science, 2020, 16 (3), pp.1
Article dans une revue
hal-02888536v1
|
|
|
|
Bisimulations on Data GraphsJournal of Artificial Intelligence Research, 2018, 61, pp.171-213. ⟨10.1613/jair.5637⟩
Article dans une revue
hal-01679889v1
|
|
|
Satisfiability of XPath on data treesACM SIGLOG News, 2018, 5 (2), pp.4-16. ⟨10.1145/3212019.3212021⟩
Article dans une revue
hal-01670363v2
|
|
|
Bottom-up automata on data trees and vertical XPathLogical Methods in Computer Science, 2017, 13 (4), ⟨10.23638/LMCS-13(4:5)2017⟩
Article dans une revue
hal-01631219v1
|
|
|
Reasoning about Data Repetitions with Counter SystemsLogical Methods in Computer Science, 2016, 12 (3), ⟨10.2168/LMCS-12(3:1)2016⟩
Article dans une revue
hal-01685180v1
|
|
|
Relating timed and register automataMathematical Structures in Computer Science, 2016, 26 (06), pp.993-1021. ⟨10.1017/S0960129514000322⟩
Article dans une revue
hal-01686366v1
|
|
|
Model Theory of XPath on Data Trees. Part I: Bisimulation and CharacterizationJournal of Artificial Intelligence Research, 2015
Article dans une revue
hal-01778416v1
|
|
|
Synchronizing Relations on WordsTheory of Computing Systems, 2015, 57 (2), pp.287 - 318. ⟨10.1007/s00224-014-9584-2⟩
Article dans une revue
hal-01778459v1
|
|
|
Graph Logics with Rational RelationsLogical Methods in Computer Science, 2013, 9 (3), ⟨10.2168/LMCS-9(3:1)2013⟩
Article dans une revue
hal-01795115v1
|
|
|
Decidability of Downward XPathACM Transactions on Computational Logic, 2012, 13 (4), pp.1-40. ⟨10.1145/2362355.2362362⟩
Article dans une revue
hal-01799714v1
|
|
|
Alternating register automata on finite words and treesLogical Methods in Computer Science, 2012, 8 (1), pp.1-44. ⟨10.2168/LMCS-8(1:22)2012⟩
Article dans une revue
hal-01799710v1
|
|
|
The expressive power of Memory LogicsThe review of symbolic logic, 2011, 4 (2), pp.290-318. ⟨10.1017/S1755020310000389⟩
Article dans une revue
hal-01803447v1
|
When is Shapley Value Computation a Matter of Counting?Symposium on Principles of Database Systems (PODS), Jun 2024, Santiago (CL), Chile. pp.105, ⟨10.1145/3651606⟩
Communication dans un congrès
hal-04375905v1
|
|
PDL on Steroids: on Expressive Extensions of PDL with Intersection and ConverseAnnual Symposium on Logic in Computer Science (LICS), Jun 2023, Boston, United States
Communication dans un congrès
hal-04076661v1
|
|
Separating Automatic RelationsInternational Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2023, Bordeaux, France
Communication dans un congrès
hal-04099907v1
|
|
Conjunctive Regular Path Queries under Injective SemanticsSymposium on Principles of Database Systems (PODS), Jun 2023, Seattle, United States. ⟨10.1145/3584372.3588664⟩
Communication dans un congrès
hal-04070990v1
|
|
A Simple Algorithm for Consistent Query Answering under Primary KeysICDT 2023 - International Conference on Database Theory, Mar 2023, Ioannina, Greece
Communication dans un congrès
hal-03953588v1
|
|
|
|
Approximation and Semantic Tree-width of Conjunctive Regular Path QueriesInternational Conference on Database Theory (ICDT), Mar 2023, Ioannina, Greece. pp.15:1--15:19, ⟨10.4230/LIPIcs.ICDT.2023.15⟩
Communication dans un congrès
hal-03883042v1
|
|
|
Reasoning on Data Words over Numeric DomainsAnnual Symposium on Logic in Computer Science (LICS), Aug 2022, Haifa, Israel
Communication dans un congrès
hal-03684239v1
|
|
|
When is the Evaluation of Extended CRPQ Tractable?Symposium on Principles of Database Systems (PODS), Jun 2022, Philidelphia, United States
Communication dans un congrès
hal-03353483v2
|
|
|
Data Path Queries over Embedded Graph DatabasesSymposium on Principles of Database Systems (PODS), Jun 2022, Philadelphia, United States
Communication dans un congrès
hal-03684553v1
|
|
|
Foundations of Graph Path Query Languages (Course Notes)Reasoning Web Summer School 2021, Sep 2021, Leuven, Belgium. pp.1-21, ⟨10.1007/978-3-030-95481-9\_1⟩
Communication dans un congrès
hal-03349901v3
|
|
|
Containment of Simple Regular Path QueriesInternational Conference on Principles of Knowledge Representation and Reasoning (KR), Sep 2020, Rhodes, Greece
Communication dans un congrès
hal-02505244v1
|
|
|
Finite Controllability for Ontology-Mediated Query Answering of CRPQInternational Conference on Principles of Knowledge Representation and Reasoning (KR), Sep 2020, Rhodes, Greece
Communication dans un congrès
hal-02508782v2
|
|
|
Universality Problem for Unambiguous VASSInternational Conference on Concurrency Theory (CONCUR), Sep 2020, Vienna, Austria. pp.36:1-36:15, ⟨10.4230/LIPIcs.CONCUR.2020.36⟩
Communication dans un congrès
hal-02483495v3
|
|
|
Containment of UC2RPQ: the hard and easy casesInternational Conference on Database Theory (ICDT), Mar 2020, Copenhagen, Denmark. pp.9:1-9:18, ⟨10.4230/LIPIcs.ICDT.2020.9⟩
Communication dans un congrès
hal-02291888v2
|
|
|
The Quantifier Alternation Hierarchy of Synchronous RelationsInternational Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2019, Aachen, Germany. pp.29:1-29:14, ⟨10.4230/LIPIcs.MFCS.2019.29⟩
Communication dans un congrès
hal-02109188v3
|
|
|
Closure properties of synchronized relationsInternational Symposium on Theoretical Aspects of Computer Science (STACS), Mar 2019, Berlin, Germany. ⟨10.4230/LIPIcs.STACS.2019.22⟩
Communication dans un congrès
hal-01884574v2
|
|
|
Boundedness of Conjunctive Regular Path QueriesInternational Colloquium on Automata, Languages, and Programming (ICALP), Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.104⟩
Communication dans un congrès
hal-02056388v2
|
|
|
Resynchronizing Classes of Word RelationsInternational Colloquium on Automata, Languages, and Programming (ICALP), Jul 2018, Prague, Czech Republic. ⟨10.4230/LIPIcs.ICALP.2018.123⟩
Communication dans un congrès
hal-01721046v2
|
Playing with Repetitions in Data Words Using Energy GamesAnnual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jul 2018, Oxford, United Kingdom. ⟨10.1145/3209108.3209154⟩
Communication dans un congrès
hal-01715125v1
|
|
|
|
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension OneInternational Colloquium on Automata, Languages, and Programming (ICALP), Jul 2017, Varsovie, Poland. pp.119, ⟨10.4230/LIPIcs.ICALP.2017.119⟩
Communication dans un congrès
hal-01688742v1
|
|
|
Logics of repeating values on data trees and branching counter systemsInternational Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Apr 2017, Uppsala, Sweden
Communication dans un congrès
hal-01686713v1
|
|
|
Bisimulations on Data GraphsInternational Conference on Principles of Knowledge Representation and Reasoning (KR), Apr 2016, Cape Town, South Africa. pp.309-318
Communication dans un congrès
hal-01713325v1
|
|
|
Sensitivity of Counting QueriesInternational Colloquium on Automata, Languages, and Programming (ICALP), Jul 2016, Rome, Italy
Communication dans un congrès
hal-01713317v1
|
|
|
Semantically Acyclic Conjunctive Queries under Functional DependenciesAnnual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jul 2016, New York, United States. ⟨10.1145/2933575.2933580⟩
Communication dans un congrès
hal-01713329v2
|
|
|
Path Logics for Querying Graphs: Combining Expressiveness and EfficiencyAnnual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jul 2015, Kyoto, Japan. ⟨10.1109/LICS.2015.39⟩
Communication dans un congrès
hal-01778476v1
|
|
|
Basic Model Theory of XPath on Data Trees17th International Conference on Database Theory (ICDT), Mar 2014, Athens, Greece
Communication dans un congrès
hal-01793608v1
|
|
|
Synchronizing Relations on Words31st International Symposium on Theoretical Aspects of Computer Science (STACS), May 2014, Lyon, France
Communication dans un congrès
hal-01793633v1
|
|
|
Pattern logics and auxiliary relationsCSL-LICS'14, joint EACSL Annual Conference on Computer Science Logic (CSL) and Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jul 2014, Vienna, Austria. ⟨10.1145/2603088.2603136⟩
Communication dans un congrès
hal-01793593v1
|
|
|
On XPath with transitive axes and data testsACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), Jun 2013, New York, NY, United States. ⟨10.1145/2463664.2463675⟩
Communication dans un congrès
hal-01795148v1
|
|
|
Reasoning about Data Repetitions with Counter SystemsAnnual IEEE/ACM Symposium on Logic in Computer Science (LICS), Jun 2013, New Orleans, United States. ⟨10.1109/LICS.2013.8⟩
Communication dans un congrès
hal-01795130v1
|
|
|
Graph Logics with Rational Relations and the Generalized Intersection ProblemAnnual IEEE Symposium on Logic in Computer Science (LICS), Jun 2012, Dubrovnik, Croatia. pp.115-124, ⟨10.1109/LICS.2012.23⟩
Communication dans un congrès
hal-01799740v1
|
|
|
Decidable classes of documents for XPathIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2012, Hyderabad, India. pp.99-111
Communication dans un congrès
hal-01799733v1
|
|
|
Efficient evaluation for a temporal logic on changing XML documentsACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), Jun 2011, Athens, Greece. ⟨10.1145/1989284.1989317⟩
Communication dans un congrès
hal-01803459v1
|
|
|
Bottom-up automata on data trees and vertical XPathSymposium on Theoretical Aspects of Computer Science (STACS), Mar 2011, Dortmund, Germany. pp.93-104
Communication dans un congrès
hal-00573596v1
|
|
|
A Decidable Two-Way Logic on Data WordsAnnual IEEE Symposium on Logic in Computer Science (LICS), Jun 2011, Toronto, United States. ⟨10.1109/LICS.2011.18⟩
Communication dans un congrès
hal-01803452v1
|
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma26th Annual IEEE Symposium on Logic in Computer Science, Jun 2011, Toronto, Canada. p. 269--278, ⟨10.1109/LICS.2011.39⟩
Communication dans un congrès
hal-00609871v1
|
|
|
|
Relating timed and register automataInternational Workshop on Expressiveness in Concurrency (EXPRESS), Aug 2010, Paris, France. pp.61-75, ⟨10.4204/EPTCS.41.5⟩
Communication dans un congrès
hal-01806104v1
|
|
|
Forward-XPath and extended register automataInternational Conference on Database Theory (ICDT), Mar 2010, Lausanne, Switzerland. ⟨10.1145/1804669.1804699⟩
Communication dans un congrès
hal-01806093v1
|
Tableaux and Model Checking for Memory Logics18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods - TABLEAUX 2009, Jul 2009, Oslo, Norway. pp.47--61
Communication dans un congrès
inria-00423049v1
|
|
Which Semantics for Neighbourhood Semantics?Twenty-first International Joint Conference on Artificial Intelligence - IJCAI 09, Jul 2009, Pasadena, California, United States. pp.671--676
Communication dans un congrès
inria-00423047v1
|
|
|
|
Future-looking Logics on Data Words and TreesInternational Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2009, Novy Smokovec, Slovakia. pp.331-343
Communication dans un congrès
hal-01806188v1
|
|
|
Satisfiability of Downward XPath with Data Equality TestsSymposium on Principles of Database Systems (PODS), Jun 2009, Providence (RI), United States
Communication dans un congrès
hal-02382925v1
|
Expressive Power and Decidability for Memory Logics15th Workshop on Logic, Language, Information and Computation - WoLLIC 2008, Jul 2008, Edinburgh, United Kingdom
Communication dans un congrès
inria-00323834v1
|
Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries2023
Pré-publication, Document de travail
hal-04311290v1
|
|
|
|
Co-finiteness of VASS coverability languages2019
Pré-publication, Document de travail
hal-02193089v2
|
|
|
On XPath with Reflexive-Transitive Axes and Data Tests2018
Pré-publication, Document de travail
hal-01832177v1
|
Satisfiability for two-variable logic with two successor relations on finite linear orders2013
Pré-publication, Document de travail
hal-01799745v1
|