#### Filter Results:

- Full text PDF available (74)

#### Publication Year

1997

2017

- This year (2)
- Last 5 years (20)
- Last 10 years (51)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin
- J. ACM
- 2006

Motivated by reasoning tasks for XML languages, the satisfiability problem of logics on <i>data trees</i> is investigated. The nodes of a data tree have a <i>label</i> from a finite set and a <i>data value</i> from a possibly infinite set. It is shown that satisfiability for two-variable first-order logic is decidable if the tree structure can be accessed… (More)

- Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David
- 21st Annual IEEE Symposium on Logic in Computer…
- 2006

In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semistructured data, timed automata and extended temporal logics. It is shown that satisfiability for the two-variable first-order logic FO<sup>2</sup>(~,<,+1) is decidable over finite… (More)

- Alan Nash, Luc Segoufin, Victor Vianu
- ACM Trans. Database Syst.
- 2005

We investigate the question of whether a query <i>Q</i> can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines <i>Q</i> if V provides enough information to uniquely determine the answer to <i>Q.</i> Next, we look at the problem of rewriting <i>Q</i> in terms of V using a specific… (More)

- Luc Segoufin, Victor Vianu
- PODS
- 2002

This paper investigates the on-line validation of streaming XML documents with respect to a DTD, under memory constraints. We first consider validation using constant memory, formalized by a finite-state automaton (<sc>FSA</sc>). We examine two flavors of the problem, depending on whether or not the XML document is assumed to be well-formed. The main… (More)

- Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin
- ACM Trans. Comput. Log.
- 2011

In a <i>data word</i> each position carries a label from a finite alphabet and a data value from some infinite domain. This model has been already considered in the realm of semistructured data, timed automata, and extended temporal logics.
This article shows that satisfiability for the two-variable fragment FO<sup>2</sup>(∼,<,+1) of first-order… (More)

- Stéphane Grumbach, Philippe Rigaux, Luc Segoufin
- SIGMOD Conference
- 1998

This paper presents DEDALE, a spatial database system intended to overcome some limitations of current systems by providing an abstract and non-specialized data model and query language for the representation and manipulation of spatial objects. DEDALE relies on a logical model based on linear constraints, which generalizes the constraint database model of… (More)

- Alan Nash, Luc Segoufin, Victor Vianu
- ICDT
- 2007

- Martin Grohe, Thomas Schwentick, Luc Segoufin
- STOC
- 2001

The evaluation of conjunctive queries is hard both with respect to its <italic>combined complexity</italic> (NP-complete) and its <italic>parameterized complexity</italic> (W[1]-complete). It becomes tractable (PTIME for combined complexity, FPT for parameterized complexity), when the underlying graphs of the conjunctive queries have bounded… (More)

- Georg Gottlob, Christoph Koch, Reinhard Pichler, Luc Segoufin
- J. ACM
- 2005

We study the complexity of two central XML processing problems. The first is XPath 1.0 query processing, which has been shown to be in PTIME in previous work. We prove that both the data complexity and the query complexity of XPath 1.0 fall into lower (highly parallelizable) complexity classes, while the combined complexity is PTIME-hard. Subsequently, we… (More)

- Balder ten Cate, Luc Segoufin
- PODS
- 2008

We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operator, allowing one to restrict attention to a specific subtree while evaluating a subexpression. We show that the expressive power of this XPath dialect equals that of FO(MTC), first… (More)