We stand with Ukraine

We stand with Ukraine

Diego Figueira

Orcid: 0000-0003-0114-2257

Affiliations:

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

According to our database¹, Diego Figueira authored at least 55 papers between 2008 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

2023

When is Shapley Value Computation a Matter of Counting?

[BibT_eX]

[DOI]

Meghyn Bienvenu

,

,

Pierre Lafourcade

CoRR, 2023

Conjunctive Regular Path Queries under Injective Semantics.

[BibT_eX]

[DOI]

,

Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

Separating Automatic Relations.

[BibT_eX]

[DOI]

,

,

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.

[BibT_eX]

[DOI]

,

Santiago Figueira

,

Edwin Pin Baque

LICS, 2023

A Simple Algorithm for Consistent Query Answering Under Primary Keys.

[BibT_eX]

[DOI]

,

Anantha Padmanabha

,

,

Cristina Sirangelo

Proceedings of the 26th International Conference on Database Theory, 2023

Approximation and Semantic Tree-Width of Conjunctive Regular Path Queries.

[BibT_eX]

[DOI]

,

Proceedings of the 26th International Conference on Database Theory, 2023

2022

When is the Evaluation of Extended CRPQ Tractable?

[BibT_eX]

[DOI]

,

Varun Ramanathan

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Data Path Queries over Embedded Graph Databases.

[BibT_eX]

[DOI]

,

,

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Reasoning on Data Words over Numeric Domains.

[BibT_eX]

[DOI]

,

Anthony Widjaja Lin

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.

[BibT_eX]

[DOI]

Proceedings of the Reasoning Web. Declarative Artificial Intelligence, 2021

2020

Playing with Repetitions in Data Words Using Energy Games.

[BibT_eX]

[DOI]

,

Anirban Majumdar

,

Log. Methods Comput. Sci., 2020

Semantic Optimization of Conjunctive Queries.

[BibT_eX]

[DOI]

,

,

,

J. ACM, 2020

Containment of Simple Regular Path Queries.

[BibT_eX]

[DOI]

,

,

,

,

Matthias Niewerth

,

CoRR, 2020

Containment of Simple Conjunctive Regular Path Queries.

[BibT_eX]

[DOI]

,

,

,

,

Matthias Niewerth

,

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Finite Controllability for Ontology-Mediated Query Answering of CRPQ.

[BibT_eX]

[DOI]

,

Santiago Figueira

,

Edwin Pin Baque

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Containment of UC2RPQ: The Hard and Easy Cases.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Database Theory, 2020

Universality Problem for Unambiguous VASS.

[BibT_eX]

[DOI]

Wojciech Czerwinski

,

,

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Closure Properties of Synchronized Relations.

[BibT_eX]

[DOI]

María Emilia Descotte

,

,

Santiago Figueira

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

The Quantifier Alternation Hierarchy of Synchronous Relations.

[BibT_eX]

[DOI]

,

Varun Ramanathan

,

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Boundedness of Conjunctive Regular Path Queries.

[BibT_eX]

[DOI]

,

,

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Satisfiability of Xpath on data trees.

[BibT_eX]

[DOI]

ACM SIGLOG News, 2018

Bisimulations on Data Graphs.

[BibT_eX]

[DOI]

,

,

,

Santiago Figueira

J. Artif. Intell. Res., 2018

Playing with Repetitions in Data Words Using Energy Games.

[BibT_eX]

[DOI]

,

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Resynchronizing Classes of Word Relations.

[BibT_eX]

[DOI]

María Emilia Descotte

,

,

Gabriele Puppis

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Bottom-up automata on data trees and vertical XPath.

[BibT_eX]

[DOI]

,

Log. Methods Comput. Sci., 2017

Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One.

[BibT_eX]

[DOI]

,

,

Jérôme Leroux

,

Filip Mazowiecki

,

Grégoire Sutre

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Logics of Repeating Values on Data Trees and Branching Counter Systems.

[BibT_eX]

[DOI]

,

,

Santiago Figueira

Proceedings of the Foundations of Software Science and Computation Structures, 2017

2016

Relating timed and register automata.

[BibT_eX]

[DOI]

,

,

Slawomir Lasota

Math. Struct. Comput. Sci., 2016

Reasoning about Data Repetitions with Counter Systems.

[BibT_eX]

[DOI]

Stéphane Demri

,

,

Log. Methods Comput. Sci., 2016

Semantically Acyclic Conjunctive Queries under Functional Dependencies.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Sensitivity of Counting Queries.

[BibT_eX]

[DOI]

,

,

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Synchronizing Relations on Words.

[BibT_eX]

[DOI]

,

Theory Comput. Syst., 2015

Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization.

[BibT_eX]

[DOI]

,

Santiago Figueira

,

J. Artif. Intell. Res., 2015

Path Logics for Querying Graphs: Combining Expressiveness and Efficiency.

[BibT_eX]

[DOI]

,

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014

Basic Model Theory of XPath on Data Trees.

[BibT_eX]

[DOI]

,

Santiago Figueira

,

Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

Pattern logics and auxiliary relations.

[BibT_eX]

[DOI]

,

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

[BibT_eX]

[DOI]

,

,

Log. Methods Comput. Sci., 2013

On XPath with transitive axes and data tests.

[BibT_eX]

[DOI]

Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

2012

Decidability of Downward XPath.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2012

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

[BibT_eX]

[DOI]

CoRR, 2012

Alternating register automata on finite words and trees

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

Graph Logics with Rational Relations and the Generalized Intersection Problem.

[BibT_eX]

[DOI]

,

,

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Decidable classes of documents for XPath.

[BibT_eX]

[DOI]

,

Mikolaj Bojanczyk

,

,

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011

The Expressive Power of Memory Logics.

[BibT_eX]

[DOI]

,

,

Santiago Figueira

,

Rev. Symb. Log., 2011

Efficient evaluation for a temporal logic on changing XML documents.

[BibT_eX]

[DOI]

Mikolaj Bojanczyk

,

Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma.

[BibT_eX]

[DOI]

,

Santiago Figueira

,

Sylvain Schmitz

,

Philippe Schnoebelen

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

A Decidable Two-Way Logic on Data Words.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

PhD thesis, 2010

Ackermann and Primitive-Recursive Bounds with Dickson's Lemma

[BibT_eX]

[DOI]

,

Santiago Figueira

,

Sylvain Schmitz

,

Philippe Schnoebelen

CoRR, 2010

Forward-XPath and extended register automata on data-trees.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2010

2009

Tableaux and Model Checking for Memory Logics.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2009

Satisfiability of downward XPath with data equality tests.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Future-Looking Logics on Data Words and Trees.

[BibT_eX]

[DOI]

,

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Which Semantics for Neighbourhood Semantics?

[BibT_eX]

[DOI]

,

Proceedings of the IJCAI 2009, 2009

2008

Expressive Power and Decidability for Memory Logics.

[BibT_eX]

[DOI]

,

,

Santiago Figueira

,

Proceedings of the Logic, 2008

Loading...