1. S. Ferré. Syst mes d'information logiques : un paradigme logico-contextuel pour interroger, naviguer et apprendre. PhD thesis, Université de Rennes 1, October 2002. Note: Accessible en ligne depuis l'adresse http://www.irisa.fr/LIS/ferre/. [WWW] Keyword(s): machine learning, browsing, information retrieval, logic, concept analysis, concept lattice, information system. 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,
   author = {Ferré, S.},
   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/centredoc/publis/theses/2002/irisapublication.2005-12-28.7623803309},
   note = {Accessible en ligne depuis l'adresse http://www.irisa.fr/LIS/ferre/} 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é.},
   keywords = {machine learning, browsing, information retrieval, logic, concept analysis, concept lattice, information system},
   
   }
   

1. S. Bars, S. Ferré, and O. Ridoux. Logic Functors for Types as Search Keys. In Int. Workshop on Isomorphisms of Types, 2002. Electronic proceedings at www.irit.fr/zeno/WIT2002/. [PDF] [POSTSCRIPT] Keyword(s): type isomorphism, logic functor, information retrieval.
   

   @inproceedings{BarFerRid2002,
   author = {Bars, S. and Ferré, S. and Ridoux, O.},
   title = {Logic Functors for Types as Search Keys},
   booktitle = {Int. Workshop on Isomorphisms of Types},
   year = {2002},
   publisher = {Electronic proceedings at www.irit.fr/zeno/WIT2002/},
   ps = {http://www.irisa.fr/LIS/ferre/papers/wit2002.ps.gz},
   pdf = {http://www.irisa.fr/LIS/ferre/papers/wit2002.pdf},
   keywords = {type isomorphism, logic functor, information retrieval},
   
   }
   




2. S. Ferré and O. Ridoux. A Framework for Developing Embeddable Customized Logics. In A. Pettorossi, editor, Int. Work. Logic-based Program Synthesis and Transformation, LNCS 2372, pages 191-215, 2002. Springer. [PDF] [POSTSCRIPT] Keyword(s): logic-based systems, theorem prover, composition, logic. 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. Their implementation 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 logics, one must also define composition laws, and prove their properties. We present the principles of logic functors and their compositions for constructing customized logics. An important issue is how the operations of different sublogics inter-operate. We propose a formalization of the logic functors, their semantics, implementations, and their composition.

   
   

   @inproceedings{FerRid2001b,
   author = {Ferré, S. and Ridoux, O.},
   title = {A Framework for Developing Embeddable Customized Logics},
   booktitle = {Int. Work. Logic-based Program Synthesis and Transformation},
   year = {2002},
   editor = {A. Pettorossi},
   series = {LNCS 2372},
   publisher = {Springer},
   pages = {191--215},
   ps = {http://www.irisa.fr/LIS/ferre/papers/lopstr2001.ps.gz},
   pdf = {http://www.irisa.fr/LIS/ferre/papers/lopstr2001.pdf},
   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. Their implementation 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 logics, one must also define composition laws, and prove their properties. We present the principles of logic functors and their compositions for constructing customized logics. An important issue is how the operations of different sublogics inter-operate. We propose a formalization of the logic functors, their semantics, implementations, and their composition.},
   keywords = {logic-based systems, theorem prover, composition, logic},
   
   }
   




3. S. Ferré and O. 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. [PDF] [POSTSCRIPT] Keyword(s): context, classification, learning, information system, logic, concept analysis. 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 = {Ferré, S. and Ridoux, O.},
   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},
   ps = {http://www.irisa.fr/LIS/ferre/papers/iccs2002.ps.gz},
   pdf = {http://www.irisa.fr/LIS/ferre/papers/iccs2002.pdf},
   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. },
   keywords = {context, classification, learning, information system, logic, concept analysis},
   
   }
   

1. S. Ferré. Incremental Concept Formation made More Efficient by the Use of Associative Concepts. Technical report, Inria, Institut National de Recherche en Informatique et en Automatique, October 2002. [WWW] Keyword(s): complexity, incremental algorithm, galois lattice, concept lattice, context. 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.},
   number = {},
   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 = {Ferré, S.},
   year = {2002},
   month = {oct},
   url = {http://www.inria.fr/RRRT/RR-4569.html},
   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.},
   keywords = {complexity, incremental algorithm, galois lattice, concept lattice, context},
   
   }
   




2. S. Ferré and O. Ridoux. Introduction to Logical Information Systems. Technical report, Inria, Institut National de Recherche en Informatique et en Automatique, September 2002. [WWW] Keyword(s): theorem proving, deduction, representation language, query formulation, information retrieval, information system. 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.},
   number = {},
   institution = {Inria, Institut National de Recherche en Informatique et en Automatique},
   title = {Introduction to Logical Information Systems},
   author = {Ferré, S. and Ridoux, O.},
   year = {2002},
   month = {sep},
   url = {http://www.inria.fr/RRRT/RR-4540.html},
   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.},
   keywords = {theorem proving, deduction, representation language, query formulation, information retrieval, information system},
   
   }
   




3. S. Ferré and O. Ridoux. Logic Functors : a Framework for Developing Embeddable Customized Logics. Technical report, Inria, Institut National de Recherche en Informatique et en Automatique, May 2002. [WWW] Keyword(s): software component, applied logic. 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 = {},
   institution = {Inria, Institut National de Recherche en Informatique et en Automatique},
   title = {Logic Functors : a Framework for Developing Embeddable Customized Logics},
   author = {Ferré, S. and Ridoux, O.},
   year = {2002},
   month = {may},
   url = {http://www.inria.fr/rrrt/rr-4457.html},
   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. },
   keywords = {software component, applied logic},
   
   }
   

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