default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiego Figueira
Person information
- affiliation: CNRS, LaBRI, Univ Bordeaux, France
- affiliation (former): University of Edinburgh, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Meghyn Bienvenu
, Diego Figueira, Pierre Lafourcade:
When is Shapley Value Computation a Matter of Counting? Proc. ACM Manag. Data 2(2): 105 (2024)- [i16]Diego Figueira, Anthony W. Lin, Liat Peterfreund:
Relational Perspective on Graph Query Languages. CoRR abs/2407.06766 (2024) - [i15]Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade:
Shapley Value Computation in Ontology-Mediated Query Answering. CoRR abs/2407.20058 (2024) - [i14]Diego Figueira, S. Krishna, Om Swostik Mishra, Anantha Padmanabha:
Boundedness for Unions of Conjunctive Regular Path Queries over Simple Regular Expressions. CoRR abs/2407.20782 (2024) - 2023
- [c42]Diego Figueira, Rémi Morvan:
Approximation and Semantic Tree-Width of Conjunctive Regular Path Queries. ICDT 2023: 15:1-15:19 - [c41]Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo:
A Simple Algorithm for Consistent Query Answering Under Primary Keys. ICDT 2023: 24:1-24:18 - [c40]Diego Figueira, Santiago Figueira, Edwin Pin Baque:
PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse. LICS 2023: 1-13 - [c39]Pablo Barceló, Diego Figueira, Rémi Morvan:
Separating Automatic Relations. MFCS 2023: 17:1-17:15 - [c38]Diego Figueira, Miguel Romero:
Conjunctive Regular Path Queries under Injective Semantics. PODS 2023: 231-240 - [i13]Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo:
A Simple Algorithm for Consistent Query Answering under Primary Keys. CoRR abs/2301.08482 (2023) - [i12]Diego Figueira, Miguel Romero:
Conjunctive Regular Path Queries under Injective Semantics. CoRR abs/2304.06232 (2023) - [i11]Diego Figueira, Santiago Figueira, Edwin Pin Baque:
PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse. CoRR abs/2304.10381 (2023) - [i10]Pablo Barceló, Diego Figueira, Rémi Morvan:
Separating Automatic Relations. CoRR abs/2305.08727 (2023) - [i9]Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade:
When is Shapley Value Computation a Matter of Counting? CoRR abs/2312.14529 (2023) - 2022
- [c37]Diego Figueira, Anthony Widjaja Lin:
Reasoning on Data Words over Numeric Domains. LICS 2022: 37:1-37:13 - [c36]Diego Figueira, Artur Jez, Anthony W. Lin:
Data Path Queries over Embedded Graph Databases. PODS 2022: 189-201 - [c35]Diego Figueira, Varun Ramanathan:
When is the Evaluation of Extended CRPQ Tractable? PODS 2022: 203-212 - [i8]Diego Figueira, Rémi Morvan:
Approximation and Semantic Tree-width of Conjunctive Regular Path Queries. CoRR abs/2212.01679 (2022) - 2021
- [c34]Diego Figueira:
Foundations of Graph Path Query Languages - Course Notes for the Reasoning Web Summer School 2021. RW 2021: 1-21 - 2020
- [j13]Pablo Barceló, Diego Figueira, Georg Gottlob, Andreas Pieris:
Semantic Optimization of Conjunctive Queries. J. ACM 67(6): 34:1-34:60 (2020) - [j12]Diego Figueira, Anirban Majumdar, M. Praveen:
Playing with Repetitions in Data Words Using Energy Games. Log. Methods Comput. Sci. 16(3) (2020) - [c33]Wojciech Czerwinski, Diego Figueira, Piotr Hofman:
Universality Problem for Unambiguous VASS. CONCUR 2020: 36:1-36:15 - [c32]Diego Figueira:
Containment of UC2RPQ: The Hard and Easy Cases. ICDT 2020: 9:1-9:18 - [c31]Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, Tina Trautner:
Containment of Simple Conjunctive Regular Path Queries. KR 2020: 371-380 - [c30]Diego Figueira, Santiago Figueira, Edwin Pin Baque:
Finite Controllability for Ontology-Mediated Query Answering of CRPQ. KR 2020: 381-391 - [i7]Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, Tina Trautner:
Containment of Simple Regular Path Queries. CoRR abs/2003.04411 (2020) - [i6]Wojciech Czerwinski, Diego Figueira, Piotr Hofman:
Universality Problem for Unambiguous VASS. CoRR abs/2007.10907 (2020)
2010 – 2019
- 2019
- [c29]Pablo Barceló, Diego Figueira, Miguel Romero:
Boundedness of Conjunctive Regular Path Queries. ICALP 2019: 104:1-104:15 - [c28]Diego Figueira, Varun Ramanathan, Pascal Weil:
The Quantifier Alternation Hierarchy of Synchronous Relations. MFCS 2019: 29:1-29:14 - [c27]María Emilia Descotte, Diego Figueira, Santiago Figueira:
Closure Properties of Synchronized Relations. STACS 2019: 22:1-22:17 - [i5]Pablo Barceló, Diego Figueira, Miguel Romero:
Boundedness of Conjunctive Regular Path Queries. CoRR abs/1904.00850 (2019) - 2018
- [j11]Sergio Abriola, Pablo Barceló, Diego Figueira, Santiago Figueira:
Bisimulations on Data Graphs. J. Artif. Intell. Res. 61: 171-213 (2018) - [j10]Diego Figueira:
Satisfiability of Xpath on data trees. ACM SIGLOG News 5(2): 4-16 (2018) - [c26]María Emilia Descotte, Diego Figueira, Gabriele Puppis:
Resynchronizing Classes of Word Relations. ICALP 2018: 123:1-123:13 - [c25]Diego Figueira, M. Praveen:
Playing with Repetitions in Data Words Using Energy Games. LICS 2018: 404-413 - [i4]Diego Figueira, M. Praveen:
Playing with Repetitions in Data Words Using Energy Games. CoRR abs/1802.07435 (2018) - 2017
- [j9]Diego Figueira, Luc Segoufin:
Bottom-up automata on data trees and vertical XPath. Log. Methods Comput. Sci. 13(4) (2017) - [c24]Sergio Abriola, Diego Figueira, Santiago Figueira:
Logics of Repeating Values on Data Trees and Branching Counter Systems. FoSSaCS 2017: 196-212 - [c23]Diego Figueira, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki, Grégoire Sutre:
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One. ICALP 2017: 119:1-119:14 - [i3]Diego Figueira, Luc Segoufin:
Bottom-up automata on data trees and vertical XPath. CoRR abs/1710.08748 (2017) - 2016
- [j8]Stéphane Demri, Diego Figueira, M. Praveen:
Reasoning about Data Repetitions with Counter Systems. Log. Methods Comput. Sci. 12(3) (2016) - [j7]Diego Figueira, Piotr Hofman, Slawomir Lasota:
Relating timed and register automata. Math. Struct. Comput. Sci. 26(6): 993-1021 (2016) - [c22]Myrto Arapinis, Diego Figueira, Marco Gaboardi:
Sensitivity of Counting Queries. ICALP 2016: 120:1-120:13 - [c21]Sergio Abriola, Pablo Barceló, Diego Figueira, Santiago Figueira:
Bisimulations on Data Graphs. KR 2016: 309-318 - [c20]Diego Figueira:
Semantically Acyclic Conjunctive Queries under Functional Dependencies. LICS 2016: 847-856 - 2015
- [j6]Diego Figueira, Santiago Figueira, Carlos Areces:
Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization. J. Artif. Intell. Res. 53: 271-314 (2015) - [j5]Diego Figueira, Leonid Libkin:
Synchronizing Relations on Words. Theory Comput. Syst. 57(2): 287-318 (2015) - [c19]Diego Figueira, Leonid Libkin:
Path Logics for Querying Graphs: Combining Expressiveness and Efficiency. LICS 2015: 329-340 - 2014
- [c18]Diego Figueira, Leonid Libkin:
Pattern logics and auxiliary relations. CSL-LICS 2014: 40:1-40:10 - [c17]Diego Figueira, Santiago Figueira, Carlos Areces:
Basic Model Theory of XPath on Data Trees. ICDT 2014: 50-60 - [c16]Diego Figueira, Leonid Libkin:
Synchronizing Relations on Words. STACS 2014: 518-529 - 2013
- [j4]Pablo Barceló, Diego Figueira, Leonid Libkin:
Graph Logics with Rational Relations. Log. Methods Comput. Sci. 9(3) (2013) - [c15]Stéphane Demri, Diego Figueira, M. Praveen:
Reasoning about Data Repetitions with Counter Systems. LICS 2013: 33-42 - [c14]Diego Figueira:
On XPath with transitive axes and data tests. PODS 2013: 249-260 - 2012
- [j3]Diego Figueira:
Alternating register automata on finite words and trees. Log. Methods Comput. Sci. 8(1) (2012) - [j2]Diego Figueira:
Decidability of Downward XPath. ACM Trans. Comput. Log. 13(4): 34:1-34:40 (2012) - [c13]Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys:
Decidable classes of documents for XPath. FSTTCS 2012: 99-111 - [c12]Pablo Barceló, Diego Figueira, Leonid Libkin:
Graph Logics with Rational Relations and the Generalized Intersection Problem. LICS 2012: 115-124 - [i2]Diego Figueira:
Satisfiability for two-variable logic with two successor relations on finite linear orders. CoRR abs/1204.2495 (2012) - 2011
- [j1]Carlos Areces, Diego Figueira, Santiago Figueira, Sergio Mera:
The Expressive Power of Memory Logics. Rev. Symb. Log. 4(2): 290-318 (2011) - [c11]Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen:
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. LICS 2011: 269-278 - [c10]Diego Figueira:
A Decidable Two-Way Logic on Data Words. LICS 2011: 365-374 - [c9]Mikolaj Bojanczyk, Diego Figueira:
Efficient evaluation for a temporal logic on changing XML documents. PODS 2011: 259-270 - [c8]Diego Figueira, Luc Segoufin:
Bottom-up automata on data trees and vertical XPath. STACS 2011: 93-104 - 2010
- [b1]Diego Figueira:
Reasoning on words and trees with data. (Raisonnement sur mots et arbres avec données). École normale supérieure de Cachan, France, 2010 - [c7]Diego Figueira:
Forward-XPath and extended register automata on data-trees. ICDT 2010: 231-241 - [c6]Diego Figueira, Piotr Hofman, Slawomir Lasota:
Relating timed and register automata. EXPRESS 2010: 61-75 - [i1]Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen:
Ackermann and Primitive-Recursive Bounds with Dickson's Lemma. CoRR abs/1007.2989 (2010)
2000 – 2009
- 2009
- [c5]Carlos Areces, Diego Figueira:
Which Semantics for Neighbourhood Semantics? IJCAI 2009: 671-676 - [c4]Diego Figueira, Luc Segoufin:
Future-Looking Logics on Data Words and Trees. MFCS 2009: 331-343 - [c3]Diego Figueira:
Satisfiability of downward XPath with data equality tests. PODS 2009: 197-206 - [c2]Carlos Areces, Diego Figueira, Daniel Gorín, Sergio Mera:
Tableaux and Model Checking for Memory Logics. TABLEAUX 2009: 47-61 - 2008
- [c1]Carlos Areces, Diego Figueira, Santiago Figueira, Sergio Mera:
Expressive Power and Decidability for Memory Logics. WoLLIC 2008: 56-68
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 20:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
