Team MOSTRARE

Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Contracts and Grants with Industry
Other Grants and Activities
Dissemination
Bibliography

Bibliography

Major publications by the team in recent years

[1]
Y. André, A.-C. Caron, D. Debarbieux, Y. Roos, S. Tison.
Path Constraints in Semi-Structured Data, in: Theoretical Computer Science, 2007, vol. 385, no 1-3, p. 11-33.
[2]
I. Boneva, J.-M. Talbot, S. Tison.
Expressiveness of a spatial logic for trees, in: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS'05), IEEE Comp. Soc. Press, 2005, p. 280 - 289.
[3]
L. Candillier, I. Tellier, F. Torre, O. Bousquet.
Cascade Evaluation of Clustering Algorithms, in: 17th European Conference on Machine Learning (ECML'2006), Lecture Notes in Artificial Intelligence, Springer Verlag, 2006, vol. 4212, p. 574–581.
[4]
J. Carme, R. Gilleron, A. Lemay, J. Niehren.
Interactive Learning of Node Selecting Tree Transducers, in: Machine Learning, 2007, vol. 66, no 1, p. 33–67
https://hal.inria.fr/inria-00087226.
[5]
E. Filiot, J. Niehren, J.-M. Talbot, S. Tison.
Polynomial Time Fragments of XPath with Variables, in: 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, ACM-Press, 2007, p. 205-214
https://hal.inria.fr/inria-00135678.
[6]
E. Filiot, J.-M. Talbot, S. Tison.
Satisfiability of a Spatial Logic with Tree Variables, in: 16th EACSL Annual Conference on Computer Science and Logic, Lecture Notes in Computer Science, Springer Verlag, 2007, vol. 4646, p. 130-145
http://hal.inria.fr/inria-00148462.
[7]
O. Gauwin, J. Niehren, Y. Roos.
Streaming Tree Automata, in: Information Processing Letters, 2008, vol. 109, p. 13-17
http://hal.inria.fr/inria-00288445/en/.
[8]
R. Gilleron, F. Jousse, M. Tommasi, I. Tellier.
Conditional Random Fields for XML Applications, RR-6738, 2008
http://hal.inria.fr/inria-00342279/en/.
[9]
R. Gilleron, P. Marty, M. Tommasi, F. Torre.
Interactive Tuples Extraction from Semi-Structured Data, in: 2006 IEEE / WIC / ACM International Conference on Web Intelligence, IEEE Comp. Soc. Press, 2006, vol. P2747, p. 997-1004.
[10]
W. Martens, J. Niehren.
On the Minimization of XML Schemas and Tree Automata for Unranked Trees, in: Journal of Computer and System Science, 2007, vol. 73, no 4, p. 550-583
https://hal.inria.fr/inria-00088406.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[11]
E. Filiot.
Logics for n-ary queries in trees., Ph. D. Thesis, Université des Sciences et Technologie de Lille - Lille I, 10 2008
http://tel.archives-ouvertes.fr/tel-00330524/en/.

Articles in International Peer-Reviewed Journal

[12]
O. Gauwin, J. Niehren, Y. Roos.
Streaming Tree Automata, in: Information Processing Letters, 2008, vol. 109, p. 13-17
http://hal.inria.fr/inria-00288445/en/.
[13]
M. Latteux, Y. Roos, A. Terlutte.
Minimal NFA and biRFSA Languages, in: RAIRO - Theoretical Informatics and Applications, 2008
http://hal.inria.fr/inria-00296658/en/.

International Peer-Reviewed Conference/Proceedings

[14]
J. Champavère, R. Gilleron, A. Lemay, J. Niehren.
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs, in: 2nd International Conference on Language and Automata Theory and Applications Language and Automata Theory and Applications Lecture Notes in Computer Science, Espagne Tarragona, C. Martin-Vide, F. Otto, H. Fernau (editors), Lecture Notes in Computer Science, Springer, 2008, vol. 5196, p. 184-195
http://hal.inria.fr/inria-00192329/en/.
[15]
J. Champavère, R. Gilleron, A. Lemay, J. Niehren.
Schema-Guided Induction of Monadic Queries, in: 9th International Colloquium on Grammatical Inference Grammatical Inference: Algorithms and Applications Lecture Notes in Artificial Intelligence, France Saint-Malo, A. Clark, F. Coste, L. Miclet (editors), Lecture Notes in Artificial Intelligence, Springer, 2008, vol. 5278, p. 15-28
http://hal.inria.fr/inria-00309408/en/.
[16]
F. Denis, E. Gilbert, A. Habrard, F. Ouardi, M. Tommasi.
Relevant Representations for the Inference of Rational Stochastic Tree Languages, in: International Colloquium on Grammatical Inference, France St Malo, F. Coste, A. Clark, L. Miclet (editors), Springer Verlag, 2008, vol. 5278, p. 57-70
http://hal.archives-ouvertes.fr/hal-00293511/en/.
[17]
E. Filiot, J.-M. Talbot, S. Tison.
Tree Automata with Global Constraints, in: 12th International Conference on Developments in Language Theory (DLT), Japon Kyoto, 2008, p. 314-326
http://hal.inria.fr/inria-00292027/en/.
[18]
E. Filiot, S. Tison.
Regular n-ary Queries in Trees and Variable Independence, in: 5th IFIP International Conference on Theoretical Computer Science, Italie Milano, 2008, p. 429-443
http://hal.inria.fr/inria-00274648/en/.
[19]
O. Gauwin, A.-C. Caron, J. Niehren, S. Tison.
Complexity of Earliest Query Answering with Streaming Tree Automata, in: ACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X), États-Unis d'Amérique San Francisco, 2008
http://hal.inria.fr/inria-00336169/en/.
[20]
M. John, C. Lhoussaine, J. Niehren, A. Uhrmacher.
The Attributed Pi Calculus, in: Computational Methods in Systems Biology, 6th International Conference CMSB, Allemagne Rostock, Lecture Notes in Bioinformatics, Springer, 2008, p. 83-102
http://hal.inria.fr/inria-00308970/en/.
[21]
M. Kuhlmann, J. Niehren.
Logics and Automata for Totally Ordered Trees, in: 19th International Conference on Rewriting Techniques and Applications Lecture Notes in Computer Science, Autriche Linz, Lecture Notes in Computer Science, Springer Verlag, 2008, vol. 5117, p. 217-231
http://hal.inria.fr/inria-00257278/en/.
[22]
M. Schmidt-Schauß, J. Niehren, J. Schwinghammer, D. Sabel.
Adequacy of compositional translations for observational semantics, in: 5th IFIP International Conference on Theoretical Computer Science IFIP, Italie Milano, IFIP, Springer Verlag, 2008, vol. 273, p. 521-535
http://hal.inria.fr/inria-00257279/en/.
[23]
S. Staworko, E. Filiot, J. Chomicki.
Querying Regular Sets of XML Documents, in: International Workshop on Logic in Databases (LiD), Italie Rome, 2008
http://hal.inria.fr/inria-00275491/en/.
[24]
I. Tellier.
How to Split Recursive Automata, in: ICGI LNAI, France St Malo, Springer Verlag, Alexander Clark, François Coste, Laurent Miclet , 2008, vol. 5278, p. 200-212
http://hal.inria.fr/inria-00341770/en/.
[25]
S. Tison, G. Godoy, S. Maneth.
Classes of Tree Homomorphisms with Decidable Preservation of Regularity, in: FOSSACS'08, Hongrie, Springer Verlag, 2008, vol. 4962, p. 127-141
http://hal.archives-ouvertes.fr/hal-00243123/en/.
[26]
M. Tommasi, R. Gilleron, P. Senellart, A. Mittal, D. Muschick.
Automatic Wrapper Induction from Hidden-Web Sources with Domain Knowledge, in: Web information and data managment, États-Unis d'Amérique Napa, ACM, 2008, p. 9-16
http://hal.inria.fr/inria-00337098/en/.

Internal Reports

[27]
R. Gilleron, F. Jousse, M. Tommasi, I. Tellier.
Conditional Random Fields for XML Applications, RR-6738, 2008
http://hal.inria.fr/inria-00342279/en/.

References in notes

[28]
V. Benzaken, G. Castagna, A. Frisch.
CDuce: an XML-centric general-purpose language, in: ACM SIGPLAN Notices, 2003, vol. 38, no 9, p. 51–63.
[29]
V. Benzaken, G. Castagna, C. Miachon.
A Full Pattern-Based Paradigm for XML Query Processing., in: PADL, Lecture Notes in Computer Science, Springer Verlag, 2005, p. 235-252.
[30]
J. Berstel, C. Reutenauer.
Recognizable formal power series on trees, in: Theorical computer science, 1982, vol. 18, p. 115–148.
[31]
G. Castagna.
Patterns and Types for Querying XML, in: 10th International Symposium on Database Programming Languages, Lecture Notes in Computer Science, Springer Verlag, 2005, vol. 3774, p. 1 - 26.
[32]
B. Chidlovskii.
Wrapping Web Information Providers by Transducer Induction, in: Proc. European Conference on Machine Learning, Lecture Notes in Artificial Intelligence, 2001, vol. 2167, p. 61 – 73.
[33]
B. Chidlovskii, J. Fuselier.
A probabilistic learning method for XML annotation of documents, in: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI'05), 2005, p. 1016-1021.
[34]
F. Denis, A. Habrard.
Learning rational stochastic tree languages, in: Algorithmic learning theory, M. Hutter, R. A. Servedio, E. Takimoto (editors), Lecture Notes in Artificial Intelligence, Springer-Verlag, 18th International Conference, ALT 2007, Octobre 2007, vol. 4754, no XI, p. 242–256.
[35]
A. Doan, A. Y. Halevy.
Semantic Integration Research in the Database Community: A Brief Survey, in: AI magazine, 2005, vol. 26, no 1, p. 83-94.
[36]
J. Eisner.
Parameter Estimation for Probabilistic Finite-State Transducers, in: Proceedings of the Annual meeting of the association for computational linguistic, 2002, p. 1–8.
[37]
J. Engelfriet.
Bottom-up and top-down tree transformations. A comparision, in: Mathematical System Theory, 1975, vol. 9, p. 198–231.
[38]
J. Engelfriet, S. Maneth.
Macro tree transducers, attribute grammars, and MSO definable tree translations, in: Information and Computation, 1999, vol. 154, no 1, p. 34–91.
[39]
V. Gapeyev, B. Pierce.
Regular Object Types, in: European Conference on Object-Oriented Programming, 2003
http://www.cis.upenn.edu/~bcpierce/papers/regobj.pdf.
[40]
J. Graehl, K. Knight.
Training tree transducers, in: NAACL-HLT, 2004, p. 105-112.
[41]
H. Hosoya, B. Pierce.
Regular expression pattern matching for XML, in: Journal of Functional Programming, 2003, vol. 6, no 13, p. 961-1004.
[42]
K. Knight, J. Graehl.
An overview of probabilistic tree transducers for natural language processing, in: Sixth International Conference on Intelligent Text Processing, 2005, p. 1-24.
[43]
C. Koch.
On the complexity of nonrecursive XQuery and functional query languages on complex values, in: 24th SIGMOD-SIGACT-SIGART Symposium on Principles of Database systems, ACM-Press, 2005, p. 84–97.
[44]
M. Y. Levin, B. Pierce.
Type-based Optimization for Regular Patterns, in: 10th International Symposium on Database Programming Languages, Lecture Notes in Computer Science, 2005, vol. 3774.
[45]
S. Maneth, A. Berlea, T. Perst, H. Seidl.
XML type checking with macro tree transducers, in: 24th ACM Symposium on Principles of Database Systems, 2005, p. 283–294.
[46]
C. Manning, H. Schütze.
Foundations of Statistical Natural Language Processing, MIT Press , Cambridge, 1999.
[47]
W. Martens, F. Neven.
Typechecking Top-Down Uniform Unranked Tree Transducers, in: 9th International Conference on Database Theory, London, UK, Lecture Notes in Computer Science, Springer Verlag, 2003, vol. 2572, p. 64–78.
[48]
H. Miyashita, M. Murata.
Composable XML transformations with tree transducers, 2005.
[49]
J. Oncina, P. Garcia, E. Vidal.
Learning Subsequential Transducers for Pattern Recognition and Interpretation Tasks, in: "IEEE Trans. Patt. Anal. and Mach. Intell. ", 1993, vol. 15, p. 448-458.
[50]
C. Sutton, A. McCallum.
An Introduction to Conditional Random Fields for Relational Learning, in: Introduction to Statistical Relational Learning, MIT Press, 2006.
[51]
B. Taskar, V. Chatalbashev, D. Koller, C. Guestrin.
Learning Structured Prediction Models: A Large Margin Approach, in: Proceedings of the Twenty Second International Conference on Machine Learning (ICML'05), 2005, p. 896 – 903.
[52]
I. Tsochantaridis, T. Joachims, T. Hofmann, Y. Altun.
Large Margin Methods for Structured and Interdependent Output Variables, in: Journal of Machine Learning Research, 2005, vol. 6, p. 1453–1484.
[53]
S. Vansummeren.
Deciding Well-Definedness of XQuery Fragments, in: Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2005, p. 37–48.

previous
next