Diego Figueira

Orcid: 0000-0003-0114-2257

Affiliations:
  • CNRS, LaBRI, Univ Bordeaux, France
  • University of Edinburgh, UK (former)


According to our database1, Diego Figueira authored at least 58 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
When is Shapley Value Computation a Matter of Counting?
Proc. ACM Manag. Data, 2024

Boundedness for Unions of Conjunctive Regular Path Queries over Simple Regular Expressions.
CoRR, 2024

Shapley Value Computation in Ontology-Mediated Query Answering.
CoRR, 2024

Relational Perspective on Graph Query Languages.
CoRR, 2024

2023
Conjunctive Regular Path Queries under Injective Semantics.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

Separating Automatic Relations.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

A Simple Algorithm for Consistent Query Answering Under Primary Keys.
Proceedings of the 26th International Conference on Database Theory, 2023

Approximation and Semantic Tree-Width of Conjunctive Regular Path Queries.
Proceedings of the 26th International Conference on Database Theory, 2023

2022
When is the Evaluation of Extended CRPQ Tractable?
Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Data Path Queries over Embedded Graph Databases.
Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Reasoning on Data Words over Numeric Domains.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021
Foundations of Graph Path Query Languages - Course Notes for the Reasoning Web Summer School 2021.
Proceedings of the Reasoning Web. Declarative Artificial Intelligence, 2021

2020
Playing with Repetitions in Data Words Using Energy Games.
Log. Methods Comput. Sci., 2020

Semantic Optimization of Conjunctive Queries.
J. ACM, 2020

Containment of Simple Regular Path Queries.
CoRR, 2020

Containment of Simple Conjunctive Regular Path Queries.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Finite Controllability for Ontology-Mediated Query Answering of CRPQ.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Containment of UC2RPQ: The Hard and Easy Cases.
Proceedings of the 23rd International Conference on Database Theory, 2020

Universality Problem for Unambiguous VASS.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Closure Properties of Synchronized Relations.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

The Quantifier Alternation Hierarchy of Synchronous Relations.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Boundedness of Conjunctive Regular Path Queries.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Satisfiability of Xpath on data trees.
ACM SIGLOG News, 2018

Bisimulations on Data Graphs.
J. Artif. Intell. Res., 2018

Playing with Repetitions in Data Words Using Energy Games.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Resynchronizing Classes of Word Relations.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Bottom-up automata on data trees and vertical XPath.
Log. Methods Comput. Sci., 2017

Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Logics of Repeating Values on Data Trees and Branching Counter Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

2016
Reasoning about Data Repetitions with Counter Systems.
Log. Methods Comput. Sci., 2016

Semantically Acyclic Conjunctive Queries under Functional Dependencies.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Sensitivity of Counting Queries.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Synchronizing Relations on Words.
Theory Comput. Syst., 2015

Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization.
J. Artif. Intell. Res., 2015

Path Logics for Querying Graphs: Combining Expressiveness and Efficiency.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
Basic Model Theory of XPath on Data Trees.
Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

Pattern logics and auxiliary relations.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Graph Logics with Rational Relations
Log. Methods Comput. Sci., 2013

On XPath with transitive axes and data tests.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

2012
Decidability of Downward XPath.
ACM Trans. Comput. Log., 2012

Satisfiability for two-variable logic with two successor relations on finite linear orders
CoRR, 2012

Alternating register automata on finite words and trees
Log. Methods Comput. Sci., 2012

Graph Logics with Rational Relations and the Generalized Intersection Problem.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Decidable classes of documents for XPath.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
The Expressive Power of Memory Logics.
Rev. Symb. Log., 2011

Efficient evaluation for a temporal logic on changing XML documents.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

A Decidable Two-Way Logic on Data Words.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010
Reasoning on words and trees with data. (Raisonnement sur mots et arbres avec données).
PhD thesis, 2010

Relating timed and register automata
Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

Ackermann and Primitive-Recursive Bounds with Dickson's Lemma
CoRR, 2010

Forward-XPath and extended register automata on data-trees.
Proceedings of the Database Theory, 2010

2009
Tableaux and Model Checking for Memory Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2009

Satisfiability of downward XPath with data equality tests.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Future-Looking Logics on Data Words and Trees.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Which Semantics for Neighbourhood Semantics?
Proceedings of the IJCAI 2009, 2009

2008
Expressive Power and Decidability for Memory Logics.
Proceedings of the Logic, 2008


  Loading...