Commit a0c0529c authored by Pietro Abate's avatar Pietro Abate
Browse files

[r2006-05-04 08:39:19 by beppe] Empty log message

Original author: beppe
Date: 2006-05-04 08:39:30+00:00
parent 7e141a61
......@@ -120,7 +120,7 @@ we are aware of. </p>
<li>
<paper file="http://www-rocq.inria.fr/gemo/XAM/publications/XAMsXIMEP2005-submitted.pdf">
<title>AXML Access Modules: Towards Physical Data Independence in XML Databases</title>
<title>XML Access Modules: Towards Physical Data Independence in XML Databases</title>
<author>A. Arion</author>
<author>V. Benzaken</author>
<author>I. Manolescu</author>
......
<li>
<paper file="http://www.grappa.univ-lille3.fr/~terlutte/recherche/biRFSA.ps">
<title>BiRFSA languages and minimal NFAs</title>
<author>Michel Latteux</author>
<author>Yves Roos</author>
<author>Alain Terlutte</author>
<comment></comment>
<abstract></abstract>
</paper>
</li>
<li>
<paper file="http://www.lifl.fr/~debarbie/DOC/IndexesAndPathConstraints.pdf">
......@@ -67,6 +50,25 @@ compare the different ways of using the 1-index to index a set of data.</p></abs
</paper>
</li>
<li>
<paper file="http://www.lifl.fr/~filiot/publiprivate/Plan-X-final-version.pdf">
<title>Composing Monadic Queries in Trees</title>
<author>Emmanuel Filiot</author>
<author>Joachim Niehren</author>
<author>Jean-Marc Talbot</author>
<author>Sophie Tison</author>
<comment>PLAN-X 2006 Informal Proceedings.</comment>
<abstract></abstract>
</paper>
</li>
<li>
<paper file="http://www.lifl.fr/~debarbie/DOC/ExtractionAndImplicationOfPathConstraints.pdf">
......@@ -220,59 +222,6 @@ Wand in 1993.</p></abstract>
</paper>
</li>
<li>
<paper file="http://www.ps.uni-sb.de/Papers/abstracts/sub-journal.html">
<title>First-Order Theory of Subtyping Constraints</title>
<author>Zhendong Su</author>
<author>Alexander Aiken</author>
<author>Joachim Niehren</author>
<author>Tim Priesnitz</author>
<author>Ralf Treinen</author>
<comment>TOPLAS. Extended Version of ACM POPL 2002.</comment>
<abstract><p>We investigate the first-order theory of subtyping constraints. We show that the first-order theory of non-structural subtyping is undecidable, and we show that in the case where all constructors are either unary or nullary, the first-order theory is decidable for both structural and non-structural subtyping.
Our results hold for both simple and recursive types. The undecidability result is shown by a reduction from the Post's Correspondence Problem, and
the decidability results are shown by a reduction to a decision problem on tree automata. In addition, we introduce the notion of a constrained tree automaton to express non-structural subtype entailment.
This work is a step towards resolving long-standing open problems of the decidability of entailment for non-structural subtyping.</p></abstract>
</paper>
</li>
<li>
<paper file="https://www.ps.uni-sb.de/Papers/abstracts/lambdafut.html">
<title>A Concurrent Lambda Calculus with Futures</title>
<author>Joachim Niehren </author>
<author> Jan Schwinghammer </author>
<author> Gert Smolka</author>
<comment>5th International Workshop on Frontiers in Combining Systems.</comment>
<abstract><p>
We introduce a new concurrent lambda calculus with futures,
lambda(fut), to model the operational semantics of Alice, a
concurrent extension of ML. lambda(fut) is a minimalist
extension of the call-by-value lambda-calculus that yields
the full expressiveness to define, combine, and implement
a variety of standard concurrency constructs such as channels,
semaphores, and ports. We present a linear type system for
lambda(fut) by which the safety of such definitions
and their combinations can be proved:
Well-typed implementations cannot be corrupted in any well-typed context.
</p></abstract>
</paper>
</li>
<li>
<paper file="http://www.ps.uni-sb.de/Papers/abstracts/cut.html">
......@@ -288,16 +237,42 @@ This work is a step towards resolving long-standing open problems of the decidab
<comment>ML.</comment>
<abstract><p>We present a new learning process for Web information
extraction, that is visually interactive. Web documents are
considered as trees in which wrappers select sets of nodes.
We start from a recent algorithm that induces node selection
queries in trees by
methods of grammatical inference. We then show how to turn this
algorithm into our visually interactive learning process, using
intelligent tree pruning heuristics. Experiments on realistic Web
documents confirm excellent quality with very few user
interactions -- annotations and corrections -- during wrapper induction.
<abstract><p>
We develop new algorithms for learning monadic node selection
queries in unranked trees from annotated examples,
and apply them to visually interactive Web
information extraction.
We propose to represent monadic queries by bottom-up deterministic
Node Selecting Tree Transducers (NSTTs), a particular class of tree
automata that we introduce. We prove that deterministic NSTTs capture
the class of queries definable in monadic second order logic (MSO) in
trees, which Gottlob and Koch (2002) argue to have the right expressiveness for Web
information extraction, and prove that monadic queries defined by NSTTs
can be answered efficiently.
We present a new polynomial time algorithm in RPNI-style
that learns monadic queries defined by deterministic NSTTs from
completely annotated examples, where all selected nodes are
distinguished.
In practice, users prefer to provide partial annotations. We
resolve this by intelligent tree pruning heuristics. We introduce
pruning NSTTs - a formalism that shares many advantages of NSTTs.
This leads us to an interactive learning algorithm for monadic
queries defined by pruning NSTTs, which satisfies a new formal
active learning model in the style of Angluin (1987).
We have implemented our interactive learning algorithm
and integrated it into a visually interactive Web information
extraction system -- called Squirrel -- by plugging it into
the Mozilla Web browser. Experiments on realistic Web documents confirm
excellent quality with very few user interactions
during wrapper induction.
</p></abstract>
</paper>
</li>
......@@ -387,3 +362,139 @@ Keywords: XML, databases, information extraction, logic, automata,
</p></abstract>
</paper>
</li>
<li>
<paper file="http://www.grappa.univ-lille3.fr/~terlutte/recherche/biRFSA.ps">
<title>BiRFSA languages and minimal NFAs</title>
<author>Michel Latteux</author>
<author>Yves Roos</author>
<author>Alain Terlutte</author>
<comment></comment>
<abstract></abstract>
</paper>
</li>
<li>
<paper file="https://www.ps.uni-sb.de/Papers/abstracts/jlambda-fut.html">
<title>A Concurrent Lambda Calculus with Futures</title>
<author>Joachim Niehren</author>
<author>Jan Schwinghammer</author>
<author>Gert Smolka</author>
<comment>TCS.</comment>
<abstract><p>
We introduce a new concurrent lambda calculus with futures,
lambda(fut), to model the operational semantics of Alice, a
concurrent extension of ML. lambda(fut) is a minimalist
extension of the call-by-value lambda-calculus that yields
the full expressiveness to define, combine, and implement
a variety of standard concurrency constructs such as channels,
semaphores, and ports. We present a linear type system for
lambda(fut) by which the safety of such definitions
and their combinations can be proved:
Well-typed implementations cannot be corrupted in any well-typed context.
</p></abstract>
</paper>
</li>
<li>
<paper file="http://www.ps.uni-sb.de/Papers/abstracts/mini.html">
<title>On the Minimization of XML Schemas and Tree Automata for Unranked Trees</title>
<author>Wim Martens</author>
<author>Joachim Niehren</author>
<comment>JCSS.</comment>
<abstract><p>
Automata for unranked trees form a foundation for XML schemas,
querying and pattern languages. We study the problem of
efficiently minimizing such automata.
First, we study unranked tree automata that are standard in
database theory, assuming bottom-up determinism and that
horizontal recursion is represented by deterministic finite
automata. We show that minimal aytomata in that class are not
unique and that minimization is NP-complete.
Second, we study more recent automata classes that do
allow for polynomial time minimization. Among those, we show that
bottom-up deterministic stepwise tree automata yield the most
succinct representations.
Third, we investigate top-down deterministic models that do not only
take into account the number of siblings of a node, but also their
labeling. Although this notion of top-down determinism is much more
expressive than the standard notion, we show that it still allows
for polynomial time minimization and unique minimal models.
</p></abstract>
</paper>
</li>
<li>
<paper file="https://www.ps.uni-sb.de/Papers/abstracts/jlambda-fut.html">
<title>A Concurrent Lambda Calculus with Futures</title>
<author>Joachim Niehren </author>
<author> Jan Schwinghammer </author>
<author> Gert Smolka</author>
<comment>5th International Workshop on Frontiers in Combining Systems.</comment>
<abstract><p>
We introduce a new concurrent lambda calculus with futures,
lambda(fut), to model the operational semantics of Alice, a
concurrent extension of ML. lambda(fut) is a minimalist
extension of the call-by-value lambda-calculus that yields
the full expressiveness to define, combine, and implement
a variety of standard concurrency constructs such as channels,
semaphores, and ports. We present a linear type system for
lambda(fut) by which the safety of such definitions
and their combinations can be proved:
Well-typed implementations cannot be corrupted in any well-typed context.
</p></abstract>
</paper>
</li>
<li>
<paper file="http://www.ps.uni-sb.de/Papers/abstracts/sub-journal.html">
<title>First-Order Theory of Subtyping Constraints</title>
<author>Zhendong Su</author>
<author>Alexander Aiken</author>
<author>Joachim Niehren</author>
<author>Tim Priesnitz</author>
<author>Ralf Treinen</author>
<comment>TOPLAS. Extended Version of ACM POPL 2002.</comment>
<abstract><p>We investigate the first-order theory of subtyping constraints. We show that the first-order theory of non-structural subtyping is undecidable, and we show that in the case where all constructors are either unary or nullary, the first-order theory is decidable for both structural and non-structural subtyping.
Our results hold for both simple and recursive types. The undecidability result is shown by a reduction from the Post's Correspondence Problem, and
the decidability results are shown by a reduction to a decision problem on tree automata. In addition, we introduce the notion of a constrained tree automaton to express non-structural subtype entailment.
This work is a step towards resolving long-standing open problems of the decidability of entailment for non-structural subtyping.</p></abstract>
</paper>
</li>
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment