Developing efficient parsers in Prolog: the CLF manual (v1.0)

This document describes a couple of tools that help to quickly design and develop computer (formalized) languages. The first one use Flex to perform lexical analysis and the second is an extention of Prolog DCGs to perfom syntactical analysis. Initially designed as a new component for the Centaur system, these tools are now available independently and can be used to construct efficient Prolog parsers that can be integrated in Prolog or heterogeneous systems. This is the initial version of the CLF documentation. Updated version will be available online when necessary

Experiments in Clustering Homogeneous XML Documents to Validate an Existing Typology

This paper presents some experiments in clustering homogeneous XMLdocuments to validate an existing classification or more generally anorganisational structure. Our approach integrates techniques for extracting knowledge from documents with unsupervised classification (clustering) of documents. We focus on the feature selection used for representing documents and its impact on the emerging classification. We mix the selection of structured features with fine textual selection based on syntactic characteristics.We illustrate and evaluate this approach with a collection of Inria activity reports for the year 2003. The objective is to cluster projects into larger groups (Themes), based on the keywords or different chapters of these activity reports. We then compare the results of clustering using different feature selections, with the official theme structure used by Inria.Comment: (postprint); This version corrects a couple of errors in authors' names in the bibliograph

Multi-représentation d'une ontologie : OWL, bases de données, systèmes de types et d'objets.

ISBN: 978-1-60558-842-1International audienceDue to the emergence of the semantic Web and the increasing need to formalize human knowledge, ontologie engineering is now an important activity. But is this activity very different from other ones like software engineering, for example ? In this paper, we investigate analogies between ontologies on one hand, types, objects and data bases on the other one, taking into account the notion of evolution of an ontology. We represent a unique ontology using different paradigms, and observe that the distance between these different concepts is small. We deduce from this constatation that ontologies and more specifically ontology description languages can take advantage of beeing fertilizated with some other computer science domains and inherit important characteristics as modularity, for example

A Hybrid Linear Logic for Constrained Transition Systems with Applications to Molecular Biology

Linear implication can represent state transitions, but real transition systems operate under temporal, stochastic or probabilistic constraints that are not directly representable in ordinary linear logic. We propose a general modal extension of intuitionistic linear logic where logical truth is indexed by constraints and hybrid connectives combine constraint reasoning with logical reasoning. The logic has a focused cut-free sequent calculus that can be used to internalize the rules of particular constrained transition systems; we illustrate this with an adequate encoding of the synchronous stochastic pi-calculus. We also present some preliminary experiments of direct encoding of biological systems in the logic

The drainage of non-Newtonian fluids in the quasi-steady motion of a sphere towards a plane

http://dx.doi.org/10.1007/s10404-011-0906-2In the lubrication limit, the time needed for the drainage of the liquid film between two particles or between particles and walls is of industrial importance, because it controls the dynamics and aggregation of nondilute suspensions. This problem is also of fundamental interest in the application of the dynamic surface force apparatus to nanorheology. Even if this problem has an exact solution in Newtonian fluid when the sphere moves steadily and slowly towards or away from a plane wall, this problem remains, to our knowledge, without any exact analytical solution in non-Newtonian fluids with negligible viscoelastic components. But Rodin, using the method of asymptotic expansions, gives an asymptotic solution to this problem in the lateral unbounded power-law fluid. Therefore, in this study, we give a numerical result using the dynamic mesh technique and an asymptotic analytical formula valid in the lubrication regime, for a fluidity index 0.5<n⩽1.8. The comparison between the two results confirms their mutual validity

Essential Incompleteness of Arithmetic Verified by Coq

A constructive proof of the Goedel-Rosser incompleteness theorem has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized. A development of primitive recursive functions is given, and all primitive recursive functions are proved to be representable in a weak axiom system. Formulas and proofs are encoded as natural numbers, and functions operating on these codes are proved to be primitive recursive. The weak axiom system is proved to be essentially incomplete. In particular, Peano arithmetic is proved to be consistent in Coq's type theory and therefore is incomplete.Comment: This paper is part of the proceedings of the 18th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2005). For the associated Coq source files see the TeX sources, or see <http://r6.ca/Goedel20050512.tar.gz

A simple applicative language: Mini-ML

Disponible dans les fichiers attachés à ce documen

Extraction d'entit\'es dans des collections \'evolutives

The goal of our work is to use a set of reports and extract named entities, in our case the names of Industrial or Academic partners. Starting with an initial list of entities, we use a first set of documents to identify syntactic patterns that are then validated in a supervised learning phase on a set of annotated documents. The complete collection is then explored. This approach is similar to the ones used in data extraction from semi-structured documents (wrappers) and do not need any linguistic resources neither a large set for training. As our collection of documents would evolve over years, we hope that the performance of the extraction would improve with the increased size of the training set.Comment: The bibteX file has been replaced with the correct on