default search action
Luc Segoufin
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j42]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): 74 (2024) - 2022
- [j41]Nicole Schweikardt, Luc Segoufin, Alexandre Vigny:
Enumeration for FO Queries over Nowhere Dense Graphs. J. ACM 69(3): 22:1-22:37 (2022) - [j40]Arnaud Durand, Nicole Schweikardt, Luc Segoufin:
Enumerating Answers to First-Order Queries over Databases of Low Degree. Log. Methods Comput. Sci. 18(2) (2022) - [j39]Nathan Grosshans, Pierre McKenzie, Luc Segoufin:
Tameness and the power of programs over monoids in DA. Log. Methods Comput. Sci. 18(3) (2022) - 2020
- [j38]Wojciech Kazana, Luc Segoufin:
First-order queries on classes of structures with bounded expansion. Log. Methods Comput. Sci. 16(1) (2020) - 2017
- [j37]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): 493-494 (2017) - [j36]Diego Figueira, Luc Segoufin:
Bottom-up automata on data trees and vertical XPath. Log. Methods Comput. Sci. 13(4) (2017) - [j35]Luc Segoufin:
A survey on guarded negation. ACM SIGLOG News 4(3): 12-26 (2017) - 2016
- [j34]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) - [j33]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): 5:1-5:34 (2016) - 2015
- [j32]Thomas Place, Luc Segoufin:
Deciding definability in FO2(<h, <v) on trees. Log. Methods Comput. Sci. 11(3) (2015) - [j31]Nadime Francis, Luc Segoufin, Cristina Sirangelo:
Datalog Rewritings of Regular Path Queries using Views. Log. Methods Comput. Sci. 11(4) (2015) - [j30]Vince Bárány, Balder ten Cate, Luc Segoufin:
Guarded Negation. J. ACM 62(3): 22:1-22:26 (2015) - [j29]Luc Segoufin:
Constant Delay Enumeration for Conjunctive Queries. SIGMOD Rec. 44(1): 10-17 (2015) - 2013
- [j28]Luc Segoufin, Balder ten Cate:
Unary negation. Log. Methods Comput. Sci. 9(3) (2013) - [j27]Wojciech Kazana, Luc Segoufin:
Enumeration of monadic second-order queries on trees. ACM Trans. Comput. Log. 14(4): 25:1-25:12 (2013) - 2012
- [j26]Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing:
Piecewise testable tree languages. Log. Methods Comput. Sci. 8(3) (2012) - [j25]Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin:
Locality from Circuit Lower Bounds. SIAM J. Comput. 41(6): 1481-1523 (2012) - 2011
- [j24]Wojciech Kazana, Luc Segoufin:
First-order query evaluation on structures of bounded degree. Log. Methods Comput. Sci. 7(2) (2011) - [j23]Thomas Place, Luc Segoufin:
A decidable characterization of locally testable tree languages. Log. Methods Comput. Sci. 7(4) (2011) - [j22]Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Two-variable logic on data words. ACM Trans. Comput. Log. 12(4): 27:1-27:26 (2011) - 2010
- [j21]Mikolaj Bojanczyk, Luc Segoufin:
Tree Languages Defined in First-Order Logic with One Quantifier Alternation. Log. Methods Comput. Sci. 6(4) (2010) - [j20]Balder ten Cate, Luc Segoufin:
Transitive closure logic, nested tree walking automata, and XPath. J. ACM 57(3): 18:1-18:41 (2010) - [j19]Alan Nash, Luc Segoufin, Victor Vianu:
Views and queries: Determinacy and rewriting. ACM Trans. Database Syst. 35(3): 21:1-21:41 (2010) - 2009
- [j18]Serge Abiteboul, Luc Segoufin, Victor Vianu:
Modeling and Verifying Active XML Artifacts. IEEE Data Eng. Bull. 32(3): 10-15 (2009) - [j17]Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Two-variable logic on data trees and XML reasoning. J. ACM 56(3): 13:1-13:48 (2009) - [j16]Michael Benedikt, Luc Segoufin:
Towards a characterization of order-invariant queries over tame graphs. J. Symb. Log. 74(1): 168-186 (2009) - [j15]Michael Benedikt, Luc Segoufin:
Regular tree languages definable in FO and in FOmod. ACM Trans. Comput. Log. 11(1): 4:1-4:32 (2009) - [j14]Serge Abiteboul, Luc Segoufin, Victor Vianu:
Static analysis of active XML systems. ACM Trans. Database Syst. 34(4): 23:1-23:44 (2009) - 2007
- [j13]Luc Segoufin:
Static analysis of XML processing with data values. SIGMOD Rec. 36(1): 31-38 (2007) - 2006
- [j12]Anca Muscholl, Mathias Samuelides, Luc Segoufin:
Complementing deterministic tree-walking automata. Inf. Process. Lett. 99(1): 33-39 (2006) - [j11]Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Active Context-Free Games. Theory Comput. Syst. 39(1): 237-276 (2006) - [j10]Serge Abiteboul, Luc Segoufin, Victor Vianu:
Representing and querying XML with incomplete information. ACM Trans. Database Syst. 31(1): 208-254 (2006) - 2005
- [j9]Georg Gottlob, Christoph Koch, Reinhard Pichler, Luc Segoufin:
The complexity of XPath query evaluation and XML typing. J. ACM 52(2): 284-335 (2005) - 2004
- [j8]Nicole Bidoit, Sandra de Amo, Luc Segoufin:
Order Independent Temporal Properties. J. Log. Comput. 14(2): 277-298 (2004) - 2003
- [j7]Stéphane Grumbach, Philippe Rigaux, Luc Segoufin:
Handling Interpolated Data. Comput. J. 46(6): 664-679 (2003) - [j6]Philippe Rigaux, Michel Scholl, Luc Segoufin, Stéphane Grumbach:
Building a constraint-based spatial database system: model, languages, and implementation. Inf. Syst. 28(6): 563-595 (2003) - [j5]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
Definable relations and first-order query languages over strings. J. ACM 50(5): 694-751 (2003) - [j4]Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin:
Reachability and connectivity queries in constraint databases. J. Comput. Syst. Sci. 66(1): 169-206 (2003) - 2002
- [j3]Martin Grohe, Luc Segoufin:
On first-order topological queries. ACM Trans. Comput. Log. 3(3): 336-358 (2002) - 2001
- [j2]Stéphane Grumbach, Philippe Rigaux, Luc Segoufin:
Spatio-Temporal Data Handling with Constraints. GeoInformatica 5(1): 95-115 (2001) - 2000
- [j1]Luc Segoufin, Victor Vianu:
Querying Spatial Databases via Topological Invariants. J. Comput. Syst. Sci. 61(2): 270-301 (2000)
Conference and Workshop Papers
- 2023
- [c57]Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo:
A Simple Algorithm for Consistent Query Answering Under Primary Keys. ICDT 2023: 24:1-24:18 - [c56]Nofar Carmeli, Luc Segoufin:
Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis. PODS 2023: 277-289 - 2020
- [c55]Julien Grange, Luc Segoufin:
Order-Invariant First-Order Logic over Hollow Trees. CSL 2020: 23:1-23:16 - [c54]Luc Segoufin, Victor Vianu:
Projection Views of Register Automata. PODS 2020: 299-313 - 2018
- [c53]Nicole Schweikardt, Luc Segoufin, Alexandre Vigny:
Enumeration for FO Queries over Nowhere Dense Graphs. PODS 2018: 151-163 - [c52]Matthias Niewerth, Luc Segoufin:
Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates. PODS 2018: 179-191 - 2017
- [c51]Luc Segoufin, Alexandre Vigny:
Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion. ICDT 2017: 20:1-20:16 - [c50]Nathan Grosshans, Pierre McKenzie, Luc Segoufin:
The Power of Programs over Monoids in DA. MFCS 2017: 2:1-2:20 - 2015
- [c49]Anuj Dawar, Luc Segoufin:
Capturing MSO with One Quantifier. Fields of Logic and Computation II 2015: 142-152 - 2014
- [c48]Nadime Francis, Luc Segoufin, Cristina Sirangelo:
Datalog Rewritings of Regular Path Queries using Views. ICDT 2014: 107-118 - [c47]Arnaud Durand, Nicole Schweikardt, Luc Segoufin:
Enumerating answers to first-order queries over databases of low degree. PODS 2014: 121-131 - [c46]Luc Segoufin:
A glimpse on constant delay enumeration (Invited Talk). STACS 2014: 13-27 - 2013
- [c45]Luc Segoufin:
Enumerating with constant delay the answers to a query. ICDT 2013: 10-20 - [c44]Mikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk:
Verification of database-driven systems via amalgamation. PODS 2013: 63-74 - [c43]Wojciech Kazana, Luc Segoufin:
Enumeration of first-order queries on classes of structures with bounded expansion. PODS 2013: 297-308 - 2011
- [c42]Vince Bárány, Balder ten Cate, Luc Segoufin:
Guarded Negation. ICALP (2) 2011: 356-367 - [c41]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: 368-379 - [c40]Luc Segoufin, Szymon Torunczyk:
Automata based verification over linearly ordered data domains. STACS 2011: 81-92 - [c39]Diego Figueira, Luc Segoufin:
Bottom-up automata on data trees and vertical XPath. STACS 2011: 93-104 - [c38]Balder ten Cate, Luc Segoufin:
Unary negation. STACS 2011: 344-355 - 2010
- [c37]Thomas Place, Luc Segoufin:
Deciding Definability in FO2(<) (or XPath) on Trees. LICS 2010: 253-262 - [c36]Nicole Schweikardt, Luc Segoufin:
Addition-Invariant FO and Regularity. LICS 2010: 273-282 - 2009
- [c35]Thomas Place, Luc Segoufin:
A Decidable Characterization of Locally Testable Tree Languages. ICALP (2) 2009: 285-296 - [c34]Diego Figueira, Luc Segoufin:
Future-Looking Logics on Data Words and Trees. MFCS 2009: 331-343 - 2008
- [c33]Mikolaj Bojanczyk, Luc Segoufin:
Tree Languages Defined in First-Order Logic with One Quantifier Alternation. ICALP (2) 2008: 233-245 - [c32]Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing:
Piecewise Testable Tree Languages. LICS 2008: 442-451 - [c31]Serge Abiteboul, Luc Segoufin, Victor Vianu:
Static analysis of active XML systems. PODS 2008: 221-230 - [c30]Balder ten Cate, Luc Segoufin:
XPath, transitive closure logic, and nested tree walking automata. PODS 2008: 251-260 - 2007
- [c29]Mathias Samuelides, Luc Segoufin:
Complexity of Pebble Tree-Walking Automata. FCT 2007: 458-469 - [c28]Alan Nash, Luc Segoufin, Victor Vianu:
Determinacy and Rewriting of Conjunctive Queries Using Views: A Progress Report. ICDT 2007: 59-73 - [c27]Luc Segoufin, Cristina Sirangelo:
Constant-Memory Validation of Streaming XML Documents Against DTDs. ICDT 2007: 299-313 - 2006
- [c26]Luc Segoufin:
Automata and Logics for Words and Trees over an Infinite Alphabet. CSL 2006: 41-57 - [c25]Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin:
Expressive Power of Pebble Automata. ICALP (1) 2006: 157-168 - [c24]Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David:
Two-Variable Logic on Words with Data. LICS 2006: 7-16 - [c23]Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Two-variable logic on data trees and XML reasoning. PODS 2006: 10-19 - 2005
- [c22]Michael Benedikt, Luc Segoufin:
Towards a Characterization of Order-Invariant Queries over Tame Structures. CSL 2005: 276-291 - [c21]Luc Segoufin, Victor Vianu:
Views and queries: determinacy and rewriting. PODS 2005: 49-60 - [c20]Michael Benedikt, Luc Segoufin:
Regular Tree Languages Definable in FO. STACS 2005: 327-339 - 2004
- [c19]Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Active Context-Free Games. STACS 2004: 452-464 - 2003
- [c18]Luc Segoufin:
Typing and querying XML documents: some complexity bounds. PODS 2003: 167-178 - 2002
- [c17]Luc Segoufin, Victor Vianu:
Validating Streaming XML Documents. PODS 2002: 53-64 - 2001
- [c16]Nicole Bidoit, Sandra de Amo, Luc Segoufin:
Propriétés temporelles indépendantes de l'ordre. BDA 2001 - [c15]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
A Model-Theoretic Approach to Regular String Relations. LICS 2001: 431-440 - [c14]Serge Abiteboul, Luc Segoufin, Victor Vianu:
Representing and Querying XML with Incomplete Information. PODS 2001 - [c13]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
String Operations in Query Languages. PODS 2001 - [c12]Martin Grohe, Thomas Schwentick, Luc Segoufin:
When is the evaluation of conjunctive queries tractable? STOC 2001: 657-666 - 2000
- [c11]Martin Grohe, Luc Segoufin:
On First-Order Topological Queries. LICS 2000: 349-360 - [c10]Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin:
Reachability and Connectivity Queries in Constraint Databases. PODS 2000: 104-115 - [c9]Stéphane Grumbach, Philippe Rigaux, Luc Segoufin:
Manipulating Interpolated Data is Easier than You Thought. VLDB 2000: 156-165 - 1999
- [c8]Stéphane Grumbach, Philippe Rigaux, Luc Segoufin:
Modeling and Querying Interpolated Spatial Data. Proc. 15èmes Journées Bases de Données Avancées, BDA 1999: 469-487 - [c7]Stéphane Grumbach, Philippe Rigaux, Luc Segoufin:
On the Orthographic Dimension of Constraint Databases. ICDT 1999: 199-216 - 1998
- [c6]Stéphane Grumbach, Luc Segoufin, Philippe Rigaux:
Efficient multi-dimensional data handling in constraint databases. BDA 1998 - [c5]Stéphane Grumbach, Philippe Rigaux, Luc Segoufin:
Spatio-Temporal Data Handling with Constraints. ACM-GIS 1998: 106-111 - [c4]Luc Segoufin, Victor Vianu:
Querying Spatial Databases via Topological Invariants. PODS 1998: 89-98 - [c3]Stéphane Grumbach, Philippe Rigaux, Luc Segoufin:
The DEDALE System for Complex Spatial Queries. SIGMOD Conference 1998: 213-224 - 1997
- [c2]Stéphane Grumbach, Philippe Rigaux, Michel Scholl, Luc Segoufin:
DEDALE, A Spatial Constraint Database. BDA 1997 - [c1]Stéphane Grumbach, Philippe Rigaux, Michel Scholl, Luc Segoufin:
DEDALE, A Spatial Constraint Database. DBPL 1997: 38-59
Parts in Books or Collections
- 2000
- [p2]Stéphane Grumbach, Zoé Lacroix, Philippe Rigaux, Luc Segoufin:
Optimization Techniques. Constraint Databases 2000: 319-334 - [p1]Stéphane Grumbach, Philippe Rigaux, Michel Scholl, Luc Segoufin:
The DEDALE Prototype. Constraint Databases 2000: 365-382
Editorship
- 2010
- [e1]Luc Segoufin:
Database Theory - ICDT 2010, 13th International Conference, Lausanne, Switzerland, March 23-25, 2010, Proceedings. ACM International Conference Proceeding Series, ACM 2010, ISBN 978-1-60558-947-3 [contents]
Informal and Other Publications
- 2023
- [i11]Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo:
A Simple Algorithm for Consistent Query Answering under Primary Keys. CoRR abs/2301.08482 (2023) - [i10]Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo:
A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join. CoRR abs/2309.12059 (2023) - 2022
- [i9]Nofar Carmeli, Luc Segoufin:
Conjunctive queries with self-joins, towards a fine-grained complexity analysis. CoRR abs/2206.04988 (2022) - 2021
- [i8]Nathan Grosshans, Pierre McKenzie, Luc Segoufin:
Tameness and the power of programs over monoids in DA. CoRR abs/2101.07495 (2021) - 2020
- [i7]Arnaud Durand, Nicole Schweikardt, Luc Segoufin:
Enumerating Answers to First-Order Queries over Databases of Low Degree. CoRR abs/2010.08382 (2020) - 2018
- [i6]Wojciech Kazana, Luc Segoufin:
First-order queries on classes of structures with bounded expansion. CoRR abs/1802.04613 (2018) - 2017
- [i5]Diego Figueira, Luc Segoufin:
Bottom-up automata on data trees and vertical XPath. CoRR abs/1710.08748 (2017) - 2016
- [i4]Thomas Place, Luc Segoufin:
Decidable Characterization of FO2(<, +1) and locality of DA. CoRR abs/1606.03217 (2016) - [i3]Paul Beame, Nathan Grosshans, Pierre McKenzie, Luc Segoufin:
Nondeterminism and an abstract formulation of Nečiporuk's lower bound method. CoRR abs/1608.01932 (2016) - 2011
- [i2]Serge Abiteboul, Alin Deutsch, Thomas Schwentick, Luc Segoufin:
Foundations of distributed data management (Dagstuhl Seminar 11421). Dagstuhl Reports 1(10): 37-57 (2011) - [i1]Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin:
Locality from Circuit Lower Bounds. Electron. Colloquium Comput. Complex. TR11 (2011)
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-07-20 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint