Diego Figueira
Publications
Publications
|
|
Responsibility Measures for Conjunctive Queries with NegationInternational Conference on Database Theory (ICDT), Mar 2026, Tampere, Finland. ⟨10.4230/LIPIcs.ICDT.2026.20⟩ |
|
|
Complexity of Evaluating GQL QueriesInternational Conference on Database Theory (ICDT), Mar 2026, Tampere, Finland. ⟨10.4230/LIPIcs.ICDT.2026.13⟩ |
|
|
Minimizing Conjunctive Regular Path QueriesSymposium on Principles of Database Systems (PODS), Jun 2025, Berlin, Germany |
|
|
Tractable Responsibility Measures for Ontology-Mediated Query AnsweringInternational Conference on Principles of Knowledge Representation and Reasoning (KR), Nov 2025, Melbourne, Australia |
|
|
Shapley Revisited: Tractable Responsibility Measures for Query AnswersSymposium on Principles of Database Systems (PODS), Jun 2025, Berlin, Germany |
|
|
Shapley Value Computation in Ontology-Mediated Query Answering (Extended Abstract)Thirty-Fourth International Joint Conference on Artificial Intelligence (IJCAI), Aug 2025, Montreal, Canada. pp.10875-10880, ⟨10.24963/IJCAI.2025/1208⟩ |
|
|
Boundedness for Unions of Conjunctive Regular Path Queries over Simple Regular ExpressionsInternational Conference on Principles of Knowledge Representation and Reasoning (KR), Nov 2024, Hanoi, Vietnam |
|
|
Shapley Value Computation in Ontology-Mediated Query AnsweringInternational Conference on Principles of Knowledge Representation and Reasoning (KR), Nov 2024, Hanoi, Vietnam |
|
|
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⟩ |
|
|
Conjunctive Regular Path Queries under Injective SemanticsSymposium on Principles of Database Systems (PODS), Jun 2023, Seattle, United States. ⟨10.1145/3584372.3588664⟩ |
|
|
Separating Automatic RelationsInternational Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2023, Bordeaux, France |
|
|
PDL on Steroids: on Expressive Extensions of PDL with Intersection and ConverseAnnual Symposium on Logic in Computer Science (LICS), Jun 2023, Boston, United States |
|
|
A Simple Algorithm for Consistent Query Answering under Primary KeysICDT 2023 - International Conference on Database Theory, Mar 2023, Ioannina, Greece |
|
|
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⟩ |
|
|
Data Path Queries over Embedded Graph DatabasesSymposium on Principles of Database Systems (PODS), Jun 2022, Philadelphia, United States |
|
|
When is the Evaluation of Extended CRPQ Tractable?Symposium on Principles of Database Systems (PODS), Jun 2022, Philidelphia, United States |
|
|
Reasoning on Data Words over Numeric DomainsAnnual Symposium on Logic in Computer Science (LICS), Aug 2022, Haifa, Israel |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
Finite Controllability for Ontology-Mediated Query Answering of CRPQInternational Conference on Principles of Knowledge Representation and Reasoning (KR), Sep 2020, Rhodes, Greece |
|
|
Containment of Simple Regular Path QueriesInternational Conference on Principles of Knowledge Representation and Reasoning (KR), Sep 2020, Rhodes, Greece |
|
|
Closure properties of synchronized relationsInternational Symposium on Theoretical Aspects of Computer Science (STACS), Mar 2019, Berlin, Germany. ⟨10.4230/LIPIcs.STACS.2019.22⟩ |
|
|
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⟩ |
|
|
Boundedness of Conjunctive Regular Path QueriesInternational Colloquium on Automata, Languages, and Programming (ICALP), Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.104⟩ |
|
|
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⟩ |
|
|
Resynchronizing Classes of Word RelationsInternational Colloquium on Automata, Languages, and Programming (ICALP), Jul 2018, Prague, Czech Republic. ⟨10.4230/LIPIcs.ICALP.2018.123⟩ |
|
|
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 |
|
|
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⟩ |
|
|
Bisimulations on Data GraphsInternational Conference on Principles of Knowledge Representation and Reasoning (KR), Apr 2016, Cape Town, South Africa. pp.309-318 |
|
|
Sensitivity of Counting QueriesInternational Colloquium on Automata, Languages, and Programming (ICALP), Jul 2016, Rome, Italy |
|
|
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⟩ |
|
|
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⟩ |
|
|
Basic Model Theory of XPath on Data Trees17th International Conference on Database Theory (ICDT), Mar 2014, Athens, Greece |
|
|
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⟩ |
|
|
Synchronizing Relations on Words31st International Symposium on Theoretical Aspects of Computer Science (STACS), May 2014, Lyon, France |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
Decidable classes of documents for XPathIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2012, Hyderabad, India. pp.99-111 |
|
|
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⟩ |
|
|
Bottom-up automata on data trees and vertical XPathSymposium on Theoretical Aspects of Computer Science (STACS), Mar 2011, Dortmund, Germany. pp.93-104 |
|
|
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⟩ |
|
|
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⟩ |
|
|
Relating timed and register automataInternational Workshop on Expressiveness in Concurrency (EXPRESS), Aug 2010, Paris, France. pp.61-75, ⟨10.4204/EPTCS.41.5⟩ |
|
|
Forward-XPath and extended register automataInternational Conference on Database Theory (ICDT), Mar 2010, Lausanne, Switzerland. ⟨10.1145/1804669.1804699⟩ |
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 |
|
Which Semantics for Neighbourhood Semantics?Twenty-first International Joint Conference on Artificial Intelligence - IJCAI 09, Jul 2009, Pasadena, California, United States. pp.671--676 |
|
|
|
Satisfiability of Downward XPath with Data Equality TestsSymposium on Principles of Database Systems (PODS), Jun 2009, Providence (RI), United States |
|
|
Future-looking Logics on Data Words and TreesInternational Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2009, Novy Smokovec, Slovakia. pp.331-343 |
Expressive Power and Decidability for Memory Logics15th Workshop on Logic, Language, Information and Computation - WoLLIC 2008, Jul 2008, Edinburgh, United Kingdom |
|
|
A Common Ancestor of PDL, Conjunctive Queries, and Unary Negation First-order2025 |
|
|
Co-finiteness of VASS coverability languages2019 |
|
|
On XPath with Reflexive-Transitive Axes and Data Tests2018 |
|
|
Satisfiability for two-variable logic with two successor relations on finite linear orders2013 |