Luc Segoufin

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 32

Top Venues

CoRR

Log. Methods Comput. Sci.

PODS

ICDT

Publications

Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo
A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join. Proc. ACM Manag. Data 2 (2) (2024)
Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo
A Simple Algorithm for Consistent Query Answering under Primary Keys. CoRR (2023)
Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo
A Simple Algorithm for Consistent Query Answering Under Primary Keys. ICDT (2023)
Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo
A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join. CoRR (2023)
Nofar Carmeli, Luc Segoufin
Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis. PODS (2023)
Nofar Carmeli, Luc Segoufin
Conjunctive queries with self-joins, towards a fine-grained complexity analysis. CoRR (2022)
Nathan Grosshans, Pierre McKenzie, Luc Segoufin
Tameness and the power of programs over monoids in DA. Log. Methods Comput. Sci. 18 (3) (2022)
Nicole Schweikardt, Luc Segoufin, Alexandre Vigny
Enumeration for FO Queries over Nowhere Dense Graphs. J. ACM 69 (3) (2022)
Arnaud Durand, Nicole Schweikardt, Luc Segoufin
Enumerating Answers to First-Order Queries over Databases of Low Degree. Log. Methods Comput. Sci. 18 (2) (2022)
Nathan Grosshans, Pierre McKenzie, Luc Segoufin
Tameness and the power of programs over monoids in DA. CoRR (2021)
Julien Grange, Luc Segoufin
Order-Invariant First-Order Logic over Hollow Trees. CSL (2020)
Arnaud Durand, Nicole Schweikardt, Luc Segoufin
Enumerating Answers to First-Order Queries over Databases of Low Degree. CoRR (2020)
Wojciech Kazana, Luc Segoufin
First-order queries on classes of structures with bounded expansion. Log. Methods Comput. Sci. 16 (1) (2020)
Luc Segoufin, Victor Vianu
Projection Views of Register Automata. PODS (2020)
Nicole Schweikardt, Luc Segoufin, Alexandre Vigny
Enumeration for FO Queries over Nowhere Dense Graphs. PODS (2018)
Wojciech Kazana, Luc Segoufin
First-order queries on classes of structures with bounded expansion. CoRR (2018)
Matthias Niewerth, Luc Segoufin
Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates. PODS (2018)
Diego Figueira, Luc Segoufin
Bottom-up automata on data trees and vertical XPath. CoRR (2017)
Luc Segoufin
A survey on guarded negation. ACM SIGLOG News 4 (3) (2017)
Diego Figueira, Luc Segoufin
Bottom-up automata on data trees and vertical XPath. Log. Methods Comput. Sci. 13 (4) (2017)
Nathan Grosshans, Pierre McKenzie, Luc Segoufin
The Power of Programs over Monoids in DA. MFCS (2017)
Luc Segoufin, Alexandre Vigny
Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion. ICDT (2017)
Luc Segoufin
M. Grohe, Descriptive Complexity, Canonisation, and Definable Graph Structure Theory, Cambridge University Press, Cambridge, 2017, x + 544 pp. Bull. Symb. Log. 23 (4) (2017)
Paul Beame, Nathan Grosshans, Pierre McKenzie, Luc Segoufin
Nondeterminism and an abstract formulation of Nečiporuk's lower bound method. CoRR (2016)
Paul Beame, Nathan Grosshans, Pierre McKenzie, Luc Segoufin
Nondeterminism and An Abstract Formulation of Nečiporuk's Lower Bound Method. ACM Trans. Comput. Theory 9 (1) (2016)
Florent Jacquemard, Luc Segoufin, Jerémie Dimino
FO2(<, +1, ~) on data trees, data tree automata and branching vector addition systems. Log. Methods Comput. Sci. 12 (2) (2016)
Thomas Place, Luc Segoufin
Decidable Characterization of FO2(<, +1) and locality of DA. CoRR (2016)
Nadime Francis, Luc Segoufin, Cristina Sirangelo
Datalog Rewritings of Regular Path Queries using Views. Log. Methods Comput. Sci. 11 (4) (2015)
Anuj Dawar, Luc Segoufin
Capturing MSO with One Quantifier. Fields of Logic and Computation II (2015)
Vince Bárány, Balder ten Cate, Luc Segoufin
Guarded Negation. J. ACM 62 (3) (2015)
Thomas Place, Luc Segoufin
Deciding definability in FO2(<h, <v) on trees. Log. Methods Comput. Sci. 11 (3) (2015)
Luc Segoufin
Constant Delay Enumeration for Conjunctive Queries. SIGMOD Rec. 44 (1) (2015)
Nadime Francis, Luc Segoufin, Cristina Sirangelo
Datalog Rewritings of Regular Path Queries using Views. ICDT (2014)
Luc Segoufin
A glimpse on constant delay enumeration (Invited Talk). STACS (2014)
Arnaud Durand, Nicole Schweikardt, Luc Segoufin
Enumerating answers to first-order queries over databases of low degree. PODS (2014)
Luc Segoufin
Enumerating with constant delay the answers to a query. ICDT (2013)
Mikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk
Verification of database-driven systems via amalgamation. PODS (2013)
Wojciech Kazana, Luc Segoufin
Enumeration of first-order queries on classes of structures with bounded expansion. PODS (2013)
Luc Segoufin, Balder ten Cate
Unary negation. Log. Methods Comput. Sci. 9 (3) (2013)
Wojciech Kazana, Luc Segoufin
Enumeration of monadic second-order queries on trees. ACM Trans. Comput. Log. 14 (4) (2013)
Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing
Piecewise testable tree languages Log. Methods Comput. Sci. 8 (3) (2012)
Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin
Locality from Circuit Lower Bounds. SIAM J. Comput. 41 (6) (2012)
Diego Figueira, Luc Segoufin
Bottom-up automata on data trees and vertical XPath. STACS (2011)
Thomas Place, Luc Segoufin
A decidable characterization of locally testable tree languages Log. Methods Comput. Sci. 7 (4) (2011)
Balder ten Cate, Luc Segoufin
Unary negation. STACS (2011)
Serge Abiteboul, Alin Deutsch, Thomas Schwentick, Luc Segoufin
Foundations of distributed data management (Dagstuhl Seminar 11421). Dagstuhl Reports 1 (10) (2011)
Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin
Two-variable logic on data words. ACM Trans. Comput. Log. 12 (4) (2011)
Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin
Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates. ICALP (2) (2011)
Wojciech Kazana, Luc Segoufin
First-order query evaluation on structures of bounded degree Log. Methods Comput. Sci. 7 (2) (2011)
Luc Segoufin, Szymon Torunczyk
Automata based verification over linearly ordered data domains. STACS (2011)
Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin
Locality from Circuit Lower Bounds. Electron. Colloquium Comput. Complex. 18 (2011)
Vince Bárány, Balder ten Cate, Luc Segoufin
Guarded Negation. ICALP (2) (2011)
Alan Nash, Luc Segoufin, Victor Vianu
Views and queries: Determinacy and rewriting. ACM Trans. Database Syst. 35 (3) (2010)
Thomas Place, Luc Segoufin
(<) (or XPath) on Trees. LICS (2010)
Mikolaj Bojanczyk, Luc Segoufin
Tree Languages Defined in First-Order Logic with One Quantifier Alternation Log. Methods Comput. Sci. 6 (4) (2010)
Balder ten Cate, Luc Segoufin
Transitive closure logic, nested tree walking automata, and XPath. J. ACM 57 (3) (2010)
Nicole Schweikardt, Luc Segoufin
Addition-Invariant FO and Regularity. LICS (2010)
Michael Benedikt, Luc Segoufin
Towards a characterization of order-invariant queries over tame graphs. J. Symb. Log. 74 (1) (2009)
Diego Figueira, Luc Segoufin
Future-Looking Logics on Data Words and Trees. MFCS (2009)
Serge Abiteboul, Luc Segoufin, Victor Vianu
Static analysis of active XML systems. ACM Trans. Database Syst. 34 (4) (2009)
Serge Abiteboul, Luc Segoufin, Victor Vianu
Modeling and Verifying Active XML Artifacts. IEEE Data Eng. Bull. 32 (3) (2009)
Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin
Two-variable logic on data trees and XML reasoning. J. ACM 56 (3) (2009)
Thomas Place, Luc Segoufin
A Decidable Characterization of Locally Testable Tree Languages. ICALP (2) (2009)
Michael Benedikt, Luc Segoufin
. ACM Trans. Comput. Log. 11 (1) (2009)
Mikolaj Bojanczyk, Luc Segoufin
Tree Languages Defined in First-Order Logic with One Quantifier Alternation. ICALP (2) (2008)
Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing
Piecewise Testable Tree Languages. LICS (2008)
Balder ten Cate, Luc Segoufin
XPath, transitive closure logic, and nested tree walking automata. PODS (2008)
Serge Abiteboul, Luc Segoufin, Victor Vianu
Static analysis of active XML systems. PODS (2008)
Luc Segoufin, Cristina Sirangelo
Constant-Memory Validation of Streaming XML Documents Against DTDs. ICDT (2007)
Alan Nash, Luc Segoufin, Victor Vianu
Determinacy and Rewriting of Conjunctive Queries Using Views: A Progress Report. ICDT (2007)
Luc Segoufin
Static analysis of XML processing with data values. SIGMOD Rec. 36 (1) (2007)
Mathias Samuelides, Luc Segoufin
Complexity of Pebble Tree-Walking Automata. FCT (2007)
Luc Segoufin
Automata and Logics for Words and Trees over an Infinite Alphabet. CSL (2006)
Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin
Expressive Power of Pebble Automata. ICALP (1) (2006)
Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David
Two-Variable Logic on Words with Data. LICS (2006)
Anca Muscholl, Mathias Samuelides, Luc Segoufin
Complementing deterministic tree-walking automata. Inf. Process. Lett. 99 (1) (2006)
Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin
Two-variable logic on data trees and XML reasoning. PODS (2006)
Anca Muscholl, Thomas Schwentick, Luc Segoufin
Active Context-Free Games. Theory Comput. Syst. 39 (1) (2006)
Serge Abiteboul, Luc Segoufin, Victor Vianu
Representing and querying XML with incomplete information. ACM Trans. Database Syst. 31 (1) (2006)
Michael Benedikt, Luc Segoufin
Towards a Characterization of Order-Invariant Queries over Tame Structures. CSL (2005)
Luc Segoufin, Victor Vianu
Views and queries: determinacy and rewriting. PODS (2005)
Georg Gottlob, Christoph Koch, Reinhard Pichler, Luc Segoufin
The complexity of XPath query evaluation and XML typing. J. ACM 52 (2) (2005)
Michael Benedikt, Luc Segoufin
Regular Tree Languages Definable in FO. STACS (2005)
Nicole Bidoit, Sandra de Amo, Luc Segoufin
Order Independent Temporal Properties. J. Log. Comput. 14 (2) (2004)
Anca Muscholl, Thomas Schwentick, Luc Segoufin
Active Context-Free Games. STACS (2004)
Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin
Reachability and connectivity queries in constraint databases. J. Comput. Syst. Sci. 66 (1) (2003)
Philippe Rigaux, Michel Scholl, Luc Segoufin, Stéphane Grumbach
Building a constraint-based spatial database system: model, languages, and implementation. Inf. Syst. 28 (6) (2003)
Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
Definable relations and first-order query languages over strings. J. ACM 50 (5) (2003)
Luc Segoufin
Typing and querying XML documents: some complexity bounds. PODS (2003)
Stéphane Grumbach, Philippe Rigaux, Luc Segoufin
Handling Interpolated Data. Comput. J. 46 (6) (2003)
Martin Grohe, Luc Segoufin
On first-order topological queries. ACM Trans. Comput. Log. 3 (3) (2002)
Luc Segoufin, Victor Vianu
Validating Streaming XML Documents. PODS (2002)
Stéphane Grumbach, Philippe Rigaux, Luc Segoufin
Spatio-Temporal Data Handling with Constraints. GeoInformatica 5 (1) (2001)
Serge Abiteboul, Luc Segoufin, Victor Vianu
Representing and Querying XML with Incomplete Information. PODS (2001)
Martin Grohe, Thomas Schwentick, Luc Segoufin
When is the evaluation of conjunctive queries tractable? STOC (2001)
Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
String Operations in Query Languages. PODS (2001)
Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
A Model-Theoretic Approach to Regular String Relations. LICS (2001)
Nicole Bidoit, Sandra de Amo, Luc Segoufin
Propriétés temporelles indépendantes de l'ordre. BDA (2001)
Stéphane Grumbach, Philippe Rigaux, Luc Segoufin
Manipulating Interpolated Data is Easier than You Thought. VLDB (2000)
Luc Segoufin, Victor Vianu
Querying Spatial Databases via Topological Invariants. J. Comput. Syst. Sci. 61 (2) (2000)

Luc Segoufin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Luc Segoufin