1. M. Ducassé, editor. Journal of Automated Software Engineering 9(1), special issue on automated debugging, janvier 2002. Kluwer.
   

   @Proceedings{ducasse02,
   Editor={M. Ducassé },
   Title={Journal of Automated Software Engineering 9(1), special issue on automated debugging},
   Publisher={Kluwer},
   Year={2002},
   Month={janvier} 
   }
   

1. Sébastien Ferré. Systèmes d'information logiques : un paradigme logico-contextuel pour interroger, naviguer et apprendre. Thèse d'université, Université de Rennes 1, October 2002. Note: Accessible en ligne à l'adresse http://www.irisa.fr/bibli/publi/theses/theses02.html.[WWW] Keyword(s): système d'information, treillis (théorie des), analyse de concepts, logique, recherche de l'information, navigateurs (logiciels), apprentissage automatique. Abstract:

   Les deux principaux paradigmes de recherche d'information, la navigation et l'interrogation, sont souvent dissociés. Les systèmes hiérarchiques offrent une structure de navigation figée qui ne convient pas à toutes les utilisations ; ce qu'ils compensent par des outils de recherche. Ceux-ci, fondés sur l'interrogation, sont plus souples mais sont plus difficiles à utiliser pour les non-initiés et rendent délicat le contrôle du volume des réponses. Il apparaît donc comme nécessaire de combiner étroitement navigation et interrogation. Pour réaliser cette combinaison, nous nous fondons sur l'Analyse de concepts (AC) qui permet de construire automatiquement, à partir d'une description des objets, une structure de navigation appelée «treillis de concepts», où les concepts jouent à la fois le rôle de répertoire et de requête. Comme dans l'AC les descriptions se limitent à des ensembles d'attributs, nous avons généralisé l'AC pour les remplacer par des formules d'une logique arbitraire. Ceci nous semble important pour traiter des applications diverses. Les Systèmes d'information logiques (SIL) se définissent donc par la combinaison navigation/interrogation, l'emploi de la logique (descriptions, requêtes et liens de navigation) et la généricité. Sur cette base, nous avons développé plusieurs mécanismes pour faciliter l'expression et la découverte de connaissances. Les connaissances d'un domaine peut être exprimées par une terminologie. Un dialogue homme-machine, fondé sur le treillis de concepts, permet de retrouver des objets (navigation) et de découvrir des régularités entre les objets (extraction de connaissances). Un mécanisme d'apprentissage offre une assistance à la classification des objets. Enfin, un prototype a été développé pour d'expérimenter ces mécanismes. Il est générique dans le sens où il ne dépend pas de la logique employée. Ces logiques peuvent être assemblés à l'aide d'un jeu de composants logique, que nous avons constitué.

   
   

   @PhdThesis{Fer2002a,
   type = {Thèse d'université},
   author = {Sébastien Ferré},
   title = {Systèmes d'information logiques~: un paradigme logico-contextuel pour interroger, naviguer et apprendre},
   school = {Université de Rennes~1},
   year = {2002},
   month = oct,
   url = {http://www.irisa.fr/bibli/publi/theses/theses02.html},
   note = {Accessible en ligne à l'adresse http://www.irisa.fr/bibli/publi/theses/theses02.html.},
   keywords = {système d'information, treillis (théorie des), analyse de concepts, logique, recherche de l'information, navigateurs (logiciels), apprentissage automatique},
   abstract = {Les deux principaux paradigmes de recherche d'information, la navigation et l'interrogation, sont souvent dissociés. Les systèmes hiérarchiques offrent une structure de navigation figée qui ne convient pas à toutes les utilisations ; ce qu'ils compensent par des outils de recherche. Ceux-ci, fondés sur l'interrogation, sont plus souples mais sont plus difficiles à utiliser pour les non-initiés et rendent délicat le contrôle du volume des réponses. Il apparaît donc comme nécessaire de combiner étroitement navigation et interrogation. Pour réaliser cette combinaison, nous nous fondons sur l'Analyse de concepts (AC) qui permet de construire automatiquement, à partir d'une description des objets, une structure de navigation appelée «treillis de concepts», où les concepts jouent à la fois le rôle de répertoire et de requête. Comme dans l'AC les descriptions se limitent à des ensembles d'attributs, nous avons généralisé l'AC pour les remplacer par des formules d'une logique arbitraire. Ceci nous semble important pour traiter des applications diverses. Les Systèmes d'information logiques (SIL) se définissent donc par la combinaison navigation/interrogation, l'emploi de la logique (descriptions, requêtes et liens de navigation) et la généricité. Sur cette base, nous avons développé plusieurs mécanismes pour faciliter l'expression et la découverte de connaissances. Les connaissances d'un domaine peut être exprimées par une terminologie. Un dialogue homme-machine, fondé sur le treillis de concepts, permet de retrouver des objets (navigation) et de découvrir des régularités entre les objets (extraction de connaissances). Un mécanisme d'apprentissage offre une assistance à la classification des objets. Enfin, un prototype a été développé pour d'expérimenter ces mécanismes. Il est générique dans le sens où il ne dépend pas de la logique employée. Ces logiques peuvent être assemblés à l'aide d'un jeu de composants logique, que nous avons constitué.},
   
   }
   

1. E. Jahier and M. Ducassé. Generic Program Monitoring by Trace Analysis. Theory and Practice of Logic Programming, 2(4-5), September 2002.
   

   @Article{jahier02,
   Author={E. Jahier and M. Ducassé},
   Title={Generic Program Monitoring by Trace Analysis},
   Pages={ },
   Journal={Theory and Practice of Logic Programming},
   Year={2002},
   Volume={2},
   Number={4-5},
   Month={September}
   }
   

1. Soazig Bars, Sébastien Ferré, and Olivier Ridoux. Logic Functors for Types as Search Keys. In Int. Workshop on Isomorphisms of Types, 2002. [WWW]
   

   @InProceedings{BarFerRid2002,
   author = {Soazig Bars and Sébastien Ferré and Olivier Ridoux},
   title = {Logic Functors for Types as Search Keys},
   booktitle = {Int. Workshop on Isomorphisms of Types},
   year = {2002},
   url = {http://www.irit.fr/zeno/WIT2002/},
   
   }
   




2. P. Deransart, L. Langevine, and M. Ducassé. A Generic Trace Model for Finite Domain Solvers. In B. O'Sullivan, editor, Proc. of the International Workshop on User-Interaction in Constraint Satisfaction, September 2002. Cornell University.
   

   @InProceedings{deransart02,
   Author={P. Deransart and L. Langevine and M. Ducassé},
   Title={A Generic Trace Model for Finite Domain Solvers},
   BookTitle={Proc. of the International Workshop on User-Interaction in Constraint Satisfaction},
   Editor={B. O'Sullivan},
   Year={2002},
   Month={September},
   Publisher={Cornell University} 
   }
   




3. M. Ducassé and L. Langevine. Analyse automatisée de traces d'exécution de programmes CLP(FD). In M. Rueher, editor, Actes des Journées Francophones de Programmation en Logique avec Contraintes, pages 119-134, Mai 2002. HERMES science publications.
   

   @InProceedings{ducasse02c,
   Author={M. Ducassé and L. Langevine},
   Title={Analyse automatisée de traces d'exécution de programmes {CLP(FD)}},
   Pages={119-134},
   BookTitle={Actes des Journées Francophones de Programmation en Logique avec Contraintes},
   Year={2002},
   Editor={M. Rueher},
   Publisher={HERMES science publications},
   Month={Mai}
   }
   




4. M. Ducassé and L. Langevine. Automated analysis of CLP(FD) program execution traces. In P. Stuckey, editor, Proceedings of the International Conference on Logic Programming, July 2002. Lecture Notes in Computer Science 2401, Springer-Verlag. Note: Poster. Extended version available at http://www.irisa.fr/LIS/ducasse/.
   

   @InProceedings{ducasse02d,
   Author={M. Ducassé and L. Langevine},
   Title={Automated analysis of {CLP(FD)} program execution traces},
   BookTitle={Proceedings of the International Conference on Logic Programming},
   Year={2002},
   Editor={P. Stuckey},
   Publisher={Lecture Notes in Computer Science 2401, Springer-Verlag},
   Month={July},
   Note={Poster. Extended version available at http://www.irisa.fr/LIS/ducasse/}
   }
   




5. Sébastien Ferré and Olivier Ridoux. The Use of Associative Concepts in the Incremental Building of a Logical Context. In G. Angelova U. Priss, D. Corbett, editor, Int. Conf. Conceptual Structures, LNCS 2393, pages 299-313, 2002. Springer. Keyword(s): concept analysis, logic, information systems, learning, classification, context. Abstract:

   A formal context associates to objects a description that combines automatically extracted properties (intrinsic) and manually assigned ones (extrinsic). The extrinsic properties are expressed by users according to intentions that are often subjective and changing, and determine the classification and retrieval of objects. So, we find it important to assist users in this task through the automatic suggestion of extrinsic properties to be assigned and even the discovery of rules to automate these assignements. The principle is to learn from the description of existing objects the extrinsic description of a new object. Because of the changing nature of users' intentions, the assistance given in the incremental building of a logical context must be interactive. We present formal principles, and an application to the classification of email messages.

   
   

   @InProceedings{FerRid2002,
   author = {Sébastien Ferré and Olivier Ridoux},
   title = {The Use of Associative Concepts in the Incremental Building of a Logical Context},
   booktitle = {Int. Conf. Conceptual Structures},
   pages = "299--313",
   year = {2002},
   editor = "U. Priss, D. Corbett, G. Angelova",
   series = "LNCS 2393",
   publisher = "Springer",
   langue = "anglais",
   keywords = {concept analysis, logic, information systems, learning, classification, context},
   abstract = "A formal context associates to objects a description that combines automatically extracted properties (intrinsic) and manually assigned ones (extrinsic). The extrinsic properties are expressed by users according to intentions that are often subjective and changing, and determine the classification and retrieval of objects. So, we find it important to assist users in this task through the automatic suggestion of extrinsic properties to be assigned and even the discovery of rules to automate these assignements. The principle is to learn from the description of existing objects the extrinsic description of a new object. Because of the changing nature of users' intentions, the assistance given in the incremental building of a logical context must be interactive. We present formal principles, and an application to the classification of email messages. ",
   
   }
   




6. Annie Foret and Yannick Le Nir. Lambek rigid grammars are not learnable from strings. In COLING'2002, 19th International Conference on Computational Linguistics, Taipei, Taiwan, 2002.
   

   @inproceedings{For02b,
   author = {Annie Foret and Yannick Le~Nir},
   title = {{L}ambek rigid grammars are not learnable from strings},
   booktitle = { COLING'2002, 19th International Conference on Computational Linguistics },
   year = 2002,
   address = {Taipei, Taiwan} 
   }
   




7. Annie Foret and Yannick Le Nir. Les grammaires de Lambek rigides ne sont pas apprenables à partir des chaines. In CAp'2002, Conférence Francophone d'Apprentissage, Orléans, France, 2002. Presses Universitaires de Grenoble.
   

   @inproceedings{For02a,
   author = {Annie Foret and Yannick Le~Nir},
   title = {Les grammaires de {L}ambek rigides ne sont pas apprenables \`a partir des chaines},
   booktitle = { CAp'2002, Conférence Francophone d'Apprentissage },
   year = 2002,
   publisher = { Presses Universitaires de Grenoble },
   address = {Orléans, France} 
   }
   




8. Annie Foret and Yannick Le Nir. On limit points for some variants of rigid Lambek Grammars. In ICGI'2002, the 6th International Colloquium on Grammatical Inference, number 2484 of Lecture Notes in Artificial Intelligence, Amsterdam, the Netherlands, 2002. Springer-Verlag.
   

   @inproceedings{For02c,
   author = {Annie Foret and Yannick Le~Nir},
   title = {On limit points for some variants of rigid {L}ambek Grammars},
   booktitle = { ICGI'2002, the 6th International Colloquium on Grammatical Inference },
   series = {Lecture Notes in Artificial Intelligence},
   year = 2002,
   number = 2484,
   publisher = { Springer-Verlag },
   address = {Amsterdam, the Netherlands} 
   }
   




9. L. Langevine, P. Deransart, M. Ducassé, and E. Jahier. Prototypage de traceurs CLP(FD). In M. Rueher, editor, Actes des Journées Francophones de Programmation en Logique avec Contraintes, pages 135-150, Mai 2002. HERMES science publications.
   

   @InProceedings{langevine02,
   Author={L. Langevine and P. Deransart and M. Ducassé and E. Jahier},
   Title={Prototypage de traceurs {CLP(FD)}},
   Pages={135-150},
   BookTitle={Actes des Journées Francophones de Programmation en Logique avec Contraintes},
   Year={2002},
   Editor={M. Rueher},
   Publisher={HERMES science publications},
   Month={Mai}
   }
   




10. B. Morin, L. Mé, H. Debar, and M. Ducassé. M2D2 : A Formal Data Model for IDS Alert Correlation. In A. Wespi et al., editor, Recent Advances in Intrusion Detection, pages 97-104, October 2002. Springer-Verlag, Lecture Notes in Computer Science 2516.
    

    @InProceedings{morin02,
    Author={B. Morin and L. Mé and H. Debar and M. Ducassé},
    Title={M2D2 : A Formal Data Model for IDS Alert Correlation},
    Pages={97-104},
    BookTitle={Recent Advances in Intrusion Detection},
    Year={2002},
    Editor={A. Wespi et al.},
    Publisher={Springer-Verlag, Lecture Notes in Computer Science 2516},
    Month={October}
    }
    




11. Jean-Philippe Pouzol and M. Ducassé. Formal specification of intrusion signatures and detection rules. In S. Schneider, editor, Proc. of 15th IEEE Computer Security Foudations Workshop, pages 64-76, 2002. IEEE Press.
    

    @InProceedings{pouzol02,
    author = {Jean-Philippe Pouzol and M. Ducassé},
    title = {Formal specification of intrusion signatures and detection rules},
    booktitle = {Proc.~of 15th IEEE Computer Security Foudations Workshop},
    year = {2002},
    pages = {64--76},
    Editor={S. Schneider},
    Publisher={IEEE Press} 
    }
    




12. J. Villaneau, J.-Y. Antoine, and Olivier Ridoux. LOGUS : un système formel de compréhension du français parlé spontané - présentation et évaluation. In TALN'02: Traitement Automatique de la Langue Naturelle, 2002.
    

    @inproceedings{var-taln2002,
    author = "J. Villaneau and J.-Y. Antoine and Olivier Ridoux",
    year = 2002,
    title = "LOGUS : un système formel de compréhension du français parlé spontané - présentation et évaluation",
    booktitle = "TALN'02: Traitement Automatique de la Langue Naturelle" 
    }
    

1. Sébastien Ferré. Incremental Concept Formation made More Efficient by the Use of Associative Concepts. Research Report RR-4569, Inria, Institut National de Recherche en Informatique et en Automatique, October 2002. [WWW] Keyword(s): context, concept lattice, Galois lattice, incremental algorithm, complexity. Abstract:

   Formal Concept Analysis (FCA) is interested in the formation of concept lattices from binary relations between objects and attributes, a.k.a. contexts. Many algorithms have been proposed to generate the set of all concepts, and also the edges of the lattice between these concepts. We develop the principle and the code of a new algorithm combining two existing ones, Godin's and Bordat's algorithms. Then, we show by both a theoretical and practical study that it is the most efficient algorithm for sparse contexts, which are usually found in real applications.

   
   

   @TechReport{Fer2002,
   pages = "13 p.",
   type = "Research Report",
   number = "RR-4569",
   institution = "Inria, Institut National de Recherche en Informatique et en Automatique",
   title = "Incremental Concept Formation made More Efficient by the Use of Associative Concepts",
   author = "Sébastien Ferré",
   year = "2002",
   month = oct,
   url = "http://www.inria.fr/rrrt/rr-4569.html",
   keywords = {context, concept lattice, Galois lattice, incremental algorithm, complexity},
   abstract = {Formal Concept Analysis (FCA) is interested in the formation of concept lattices from binary relations between objects and attributes, a.k.a. contexts. Many algorithms have been proposed to generate the set of all concepts, and also the edges of the lattice between these concepts. We develop the principle and the code of a new algorithm combining two existing ones, Godin's and Bordat's algorithms. Then, we show by both a theoretical and practical study that it is the most efficient algorithm for sparse contexts, which are usually found in real applications.},
   
   }
   




2. Sébastien Ferré and Olivier Ridoux. Introduction to Logical Information Systems. Research Report RR-4540, Inria, Institut National de Recherche en Informatique et en Automatique, September 2002. [WWW] Keyword(s): information system, information search and retrieval, query formulation, representation languages, deduction and theorem proving. Abstract:

   Logical Information Systems (LIS) use logic in a uniform way to describe their contents, to query it, to navigate through it, to analyze it, and to maintain it. They can be given an abstract specification that does not depend on the choice of a particular logic, and concrete instances can be obtained by instantiating this specification with a particular logic. In fact, a logic plays in a LIS the role of a schema in data-bases. We present the principles of logical information systems, the constraints they impose on the expression of logics, and hints for their effective implementation.

   
   

   @TechReport{FerRid2002a,
   pages = "25 p.",
   type = "Research Report",
   number = "RR-4540",
   institution = "Inria, Institut National de Recherche en Informatique et en Automatique",
   title = "Introduction to Logical Information Systems",
   author = "Sébastien Ferré and Olivier Ridoux",
   year = "2002",
   month = sep,
   url = "http://www.inria.fr/rrrt/rr-4540.html",
   keywords = {information system, information search and retrieval, query formulation, representation languages, deduction and theorem proving},
   abstract = {Logical Information Systems (LIS) use logic in a uniform way to describe their contents, to query it, to navigate through it, to analyze it, and to maintain it. They can be given an abstract specification that does not depend on the choice of a particular logic, and concrete instances can be obtained by instantiating this specification with a particular logic. In fact, a logic plays in a LIS the role of a schema in data-bases. We present the principles of logical information systems, the constraints they impose on the expression of logics, and hints for their effective implementation.},
   
   }
   




3. Sébastien Ferré and Olivier Ridoux. Logic Functors : a Framework for Developing Embeddable Customized Logics. Technical report RR-4457, Inria, Institut National de Recherche en Informatique et en Automatique, May 2002. [WWW] Keyword(s): applied logic, software component. Abstract:

   Logic-based applications often use customized logics which are composed of several logics. These customized logics are also often embedded as a black-box in an application. So, implementing them requires the specification of a well-defined interface with common operations such as a parser, a printer, and a theorem prover. In order to be able to compose these logic, one must also define composition laws, and prove their properties. We present the principles of logic functors and their compositions for constructing logics that are ad-hoc, but sound. An important issue is how the operations of different sublogics inter-operate. We propose a formalization of the logic functors, their semantics, implementations, proof-theoretic properties, and their composition.

   
   

   @TechReport{FerRid2002b,
   pages = "32 p.",
   number = "RR-4457",
   institution = "Inria, Institut National de Recherche en Informatique et en Automatique",
   title = "Logic Functors : a Framework for Developing Embeddable Customized Logics",
   author = "Sébastien Ferré and Olivier Ridoux",
   year = "2002",
   month = may,
   url = "http://www.inria.fr/rrrt/rr-4457.html",
   keywords = {applied logic, software component},
   abstract = {Logic-based applications often use customized logics which are composed of several logics. These customized logics are also often embedded as a black-box in an application. So, implementing them requires the specification of a well-defined interface with common operations such as a parser, a printer, and a theorem prover. In order to be able to compose these logic, one must also define composition laws, and prove their properties. We present the principles of logic functors and their compositions for constructing logics that are ad-hoc, but sound. An important issue is how the operations of different sublogics inter-operate. We propose a formalization of the logic functors, their semantics, implementations, proof-theoretic properties, and their composition. },
   
   }
   

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html