BACK TO INDEX

Publications of year 2011
Thesis
  1. Pierre Allard. Logical modeling of multidimensional analysis of multivalued relations - Application to geographic data exploration. PhD thesis, Thèse de l'Université de Rennes 1 - École doctorale MATISSE, 12 décembre 2011. Note: Supervised by S. Ferré and O. Ridoux.
    Abstract:
    Since the beginning of data processing, the companies have realized the importance of information management solutions. The gathered data are a powerful asset to study the trends and make choices for the future. The Business Intelligence appeared in the mid-90s (the information synthesis to assist decision-making) with OLAP (On-Line Analytical Processing, a tools set for exploration, analysis and display of multidimensional data) and S-OLAP (Spatial OLAP, OLAP with spatial support). A OLAP user, unspecialized in computer sciences, does not need to know a language to handle multidimensional data, create graphics, etc. However, we consider that the OLAP data model is too rigid, because of its permanent multidimensionnal structure and because each content must have a single aggregate value. This observation is the starting point of this thesis. We propose a new paradigm of information system, able to analyze and explore multidimensional and multivalued data. To model this paradigm, we use the logical information systems (LIS) which is an information system that has common features with OLAP, especially on the data mining aspects. Our paradigm is defined by a flexible data model, an easy navigation and modular representation. We concluded this thesis by the application of this paradigm on several topics, including the exploration of geographic data.

    @PhdThesis{Allard2011PhD,
    author = {Pierre Allard},
    title = {Logical modeling of multidimensional analysis of multivalued relations - Application to geographic data exploration},
    school = {Thèse de l'Université de Rennes 1 - École doctorale MATISSE},
    year = {2011},
    month = {12 décembre},
    note = {supervised by S. Ferré and O. Ridoux},
    abstract = {Since the beginning of data processing, the companies have realized the importance of information management solutions. The gathered data are a powerful asset to study the trends and make choices for the future. The Business Intelligence appeared in the mid-90s (the information synthesis to assist decision-making) with OLAP (On-Line Analytical Processing, a tools set for exploration, analysis and display of multidimensional data) and S-OLAP (Spatial OLAP, OLAP with spatial support). A OLAP user, unspecialized in computer sciences, does not need to know a language to handle multidimensional data, create graphics, etc. However, we consider that the OLAP data model is too rigid, because of its permanent multidimensionnal structure and because each content must have a single aggregate value. This observation is the starting point of this thesis. We propose a new paradigm of information system, able to analyze and explore multidimensional and multivalued data. To model this paradigm, we use the logical information systems (LIS) which is an information system that has common features with OLAP, especially on the data mining aspects. Our paradigm is defined by a flexible data model, an easy navigation and modular representation. We concluded this thesis by the application of this paradigm on several topics, including the exploration of geographic data.},
    
    }
    


Articles in journal or book chapters
  1. Guillaume Aucher. DEL-Sequents for progression. Journal of Applied Non-Classical Logics, 21(3-4):289-321, 2011.
    @article{Auc11d,
    Author = {Guillaume Aucher},
    Date-Added = {2016-01-20 10:46:42 +0000},
    Date-Modified = {2016-01-20 10:46:42 +0000},
    Journal = {Journal of Applied Non-Classical Logics},
    Number = {3-4},
    Pages = {289-321},
    Title = {{DEL}-Sequents for progression},
    Volume = {21},
    Year = {2011},
    Bdsk-File-1 = {YnBsaXN0MDDUAQIDBAUGJCVYJHZlcnNpb25YJG9iamVjdHNZJGFyY2hpdmVyVCR0b3ASAAGGoKgHCBMUFRYaIVUkbnVsbNMJCgsMDxJXTlMua2V5c1pOUy5vYmplY3RzViRjbGFzc6INDoACgAOiEBGABIAFgAdccmVsYXRpdmVQYXRoWWFsaWFzRGF0YV8QGi4uLy4uLy5UcmFzaC9KQU5DTDIwMTIucGRm0hcLGBlXTlMuZGF0YU8RAWoAAAAAAWoAAgAACUhEX21pY2hlbAAAAAAAAAAAAAAAAAAAAAAAAMguzJFIKwAAARAMdQ1KQU5DTDIwMTIucGRmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA5hL1ywkjogAAAAAAAAAAAAIAAgAACSAAAAAAAAAAAAAAAAAAAAAGLlRyYXNoABAACAAAyC6wcQAAABEACAAAywkVkgAAAAEADAEQDHUAD+kKAAxeHQACAC9IRF9taWNoZWw6VXNlcnM6AGdhdWNoZXI6AC5UcmFzaDoASkFOQ0wyMDEyLnBkZgAADgAcAA0ASgBBAE4AQwBMADIAMAAxADIALgBwAGQAZgAPABQACQBIAEQAXwBtAGkAYwBoAGUAbAASACJVc2Vycy9nYXVjaGVyLy5UcmFzaC9KQU5DTDIwMTIucGRmABMAAS8AABUAAgAO//8AAIAG0hscHR5aJGNsYXNzbmFtZVgkY2xhc3Nlc11OU011dGFibGVEYXRhox0fIFZOU0RhdGFYTlNPYmplY3TSGxwiI1xOU0RpY3Rpb25hcnmiIiBfEA9OU0tleWVkQXJjaGl2ZXLRJidUcm9vdIABAAgAEQAaACMALQAyADcAQABGAE0AVQBgAGcAagBsAG4AcQBzAHUAdwCEAI4AqwCwALgCJgIoAi0COAJBAk8CUwJaAmMCaAJ1AngCigKNApIAAAAAAAACAQAAAAAAAAAoAAAAAAAAAAAAAAAAAAAClA==}
    }
    


  2. Guillaume Aucher, Guido Boella, and Leendert van der Torre. A dynamic logic for privacy compliance. Journal of artificial intelligence and law, 19(2--3):187-231, 2011.
    @article{AucBoeTor11,
    Author = {Guillaume Aucher and Guido Boella and Leendert van der Torre},
    Date-Added = {2016-01-20 10:46:42 +0000},
    Date-Modified = {2016-01-20 10:46:42 +0000},
    Journal = {Journal of artificial intelligence and law},
    Number = {2--3},
    Pages = {187--231},
    Title = {A dynamic logic for privacy compliance},
    Volume = {19},
    Year = {2011},
    Bdsk-File-1 = {YnBsaXN0MDDUAQIDBAUGJCVYJHZlcnNpb25YJG9iamVjdHNZJGFyY2hpdmVyVCR0b3ASAAGGoKgHCBMUFRYaIVUkbnVsbNMJCgsMDxJXTlMua2V5c1pOUy5vYmplY3RzViRjbGFzc6INDoACgAOiEBGABIAFgAdccmVsYXRpdmVQYXRoWWFsaWFzRGF0YV8QJy4uL1BhZ2VXZWIvUHVibGlzaGVkUGFwZXJzL0pBSUwyMDExLnBkZtIXCxgZV05TLmRhdGFPEQHiAAAAAAHiAAIAAAhIRF9pc2FhYwAAAAAAAAAAAAAAAAAAAAAAAADQrGqJSCsAAAAZdUwMSkFJTDIwMTEucGRmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAB1M2Msg2wEAAAAAAAAAAAABAAMAAAkgAAAAAAAAAAAAAAAAAAAAD1B1Ymxpc2hlZFBhcGVycwAAEAAIAADQrFx5AAAAEQAIAADLIMzxAAAAAQAcABl1TAAZc9QAGXNiABlxuAAZb+wAFtOZAAxtlwACAGJIRF9pc2FhYzpVc2VyczoAZ2F1Y2hlcjoARHJvcGJveDoARG9jdW1lbnRzOgBQcm9mZXNzaW9ubmVsOgBQYWdlV2ViOgBQdWJsaXNoZWRQYXBlcnM6AEpBSUwyMDExLnBkZgAOABoADABKAEEASQBMADIAMAAxADEALgBwAGQAZgAPABIACABIAEQAXwBpAHMAYQBhAGMAEgBSVXNlcnMvZ2F1Y2hlci9Ecm9wYm94L0RvY3VtZW50cy9Qcm9mZXNzaW9ubmVsL1BhZ2VXZWIvUHVibGlzaGVkUGFwZXJzL0pBSUwyMDExLnBkZgATAAEvAAAVAAIADv//AACABtIbHB0eWiRjbGFzc25hbWVYJGNsYXNzZXNdTlNNdXRhYmxlRGF0YaMdHyBWTlNEYXRhWE5TT2JqZWN00hscIiNcTlNEaWN0aW9uYXJ5oiIgXxAPTlNLZXllZEFyY2hpdmVy0SYnVHJvb3SAAQAIABEAGgAjAC0AMgA3AEAARgBNAFUAYABnAGoAbABuAHEAcwB1AHcAhACOALgAvQDFAqsCrQKyAr0CxgLUAtgC3wLoAu0C+gL9Aw8DEgMXAAAAAAAAAgEAAAAAAAAAKAAAAAAAAAAAAAAAAAAAAxk=}
    }
    


  3. Guillaume Aucher and Andreas Herzig. Exploring the power of converse events. Dynamic Formal Epistemology, pp 51-74, 2011.
    @article{AucHer11,
    Author = {Aucher, Guillaume and Herzig, Andreas},
    Date-Added = {2016-01-20 10:46:42 +0000},
    Date-Modified = {2016-01-20 10:46:42 +0000},
    Journal = {Dynamic Formal Epistemology},
    Pages = {51--74},
    Publisher = {Springer},
    Title = {Exploring the power of converse events},
    Year = {2011}
    }
    


  4. Guillaume Aucher, Bastien Maubert, and François Schwarzentruber. Tableau Method and NEXPTIME-Completeness of DEL-Sequents. Electronic Notes in Theoretical Computer Science, 278:17-30, 2011.
    @article{AucMauSch11,
    Author = {Guillaume Aucher and Bastien Maubert and Fran\c{c}ois Schwarzentruber},
    Bibsource = {DBLP, http://dblp.uni-trier.de},
    Date-Added = {2016-01-20 10:46:42 +0000},
    Date-Modified = {2016-01-20 10:46:42 +0000},
    Ee = {http://dx.doi.org/10.1016/j.entcs.2011.10.003},
    Journal = {Electronic Notes in Theoretical Computer Science},
    Pages = {17-30},
    Title = {Tableau Method and {NEXPTIME}-Completeness of {DEL}-Sequents},
    Volume = {278},
    Year = {2011},
    Bdsk-File-1 = {YnBsaXN0MDDUAQIDBAUGJCVYJHZlcnNpb25YJG9iamVjdHNZJGFyY2hpdmVyVCR0b3ASAAGGoKgHCBMUFRYaIVUkbnVsbNMJCgsMDxJXTlMua2V5c1pOUy5vYmplY3RzViRjbGFzc6INDoACgAOiEBGABIAFgAdccmVsYXRpdmVQYXRoWWFsaWFzRGF0YV8QKC4uL1BhZ2VXZWIvUHVibGlzaGVkUGFwZXJzL0VOVENTMjAxMS5wZGbSFwsYGVdOUy5kYXRhTxEB6AAAAAAB6AACAAAISERfaXNhYWMAAAAAAAAAAAAAAAAAAAAAAAAA0KxqiUgrAAAAGXVMDUVOVENTMjAxMS5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAZ4PvLINzgAAAAAAAAAAAAAQADAAAJIAAAAAAAAAAAAAAAAAAAAA9QdWJsaXNoZWRQYXBlcnMAABAACAAA0KxceQAAABEACAAAyyDO0AAAAAEAHAAZdUwAGXPUABlzYgAZcbgAGW/sABbTmQAMbZcAAgBjSERfaXNhYWM6VXNlcnM6AGdhdWNoZXI6AERyb3Bib3g6AERvY3VtZW50czoAUHJvZmVzc2lvbm5lbDoAUGFnZVdlYjoAUHVibGlzaGVkUGFwZXJzOgBFTlRDUzIwMTEucGRmAAAOABwADQBFAE4AVABDAFMAMgAwADEAMQAuAHAAZABmAA8AEgAIAEgARABfAGkAcwBhAGEAYwASAFNVc2Vycy9nYXVjaGVyL0Ryb3Bib3gvRG9jdW1lbnRzL1Byb2Zlc3Npb25uZWwvUGFnZVdlYi9QdWJsaXNoZWRQYXBlcnMvRU5UQ1MyMDExLnBkZgAAEwABLwAAFQACAA7//wAAgAbSGxwdHlokY2xhc3NuYW1lWCRjbGFzc2VzXU5TTXV0YWJsZURhdGGjHR8gVk5TRGF0YVhOU09iamVjdNIbHCIjXE5TRGljdGlvbmFyeaIiIF8QD05TS2V5ZWRBcmNoaXZlctEmJ1Ryb290gAEACAARABoAIwAtADIANwBAAEYATQBVAGAAZwBqAGwAbgBxAHMAdQB3AIQAjgC5AL4AxgKyArQCuQLEAs0C2wLfAuYC7wL0AwEDBAMWAxkDHgAAAAAAAAIBAAAAAAAAACgAAAAAAAAAAAAAAAAAAAMg}
    }
    


Conference articles
  1. Guillaume Aucher, Steve Barker, Guido Boella, Valerio Genovese, and Leendert van der Torre. Dynamics in Delegation and Revocation Schemes: A Logical Approach. In DBSec, pages 90-105, 2011.
    @inproceedings{AucBarBoeGenTor11,
    Author = {Guillaume Aucher and Steve Barker and Guido Boella and Valerio Genovese and Leendert van der Torre},
    Bibsource = {DBLP, http://dblp.uni-trier.de},
    Booktitle = {DBSec},
    Crossref = {DBLP:conf/dbsec/2011},
    Date-Added = {2016-01-20 10:46:42 +0000},
    Date-Modified = {2016-01-20 10:46:42 +0000},
    Ee = {http://dx.doi.org/10.1007/978-3-642-22348-8_9},
    Pages = {90-105},
    Title = {Dynamics in Delegation and Revocation Schemes: A Logical Approach},
    Year = {2011}
    }
    


  2. Guillaume Aucher, Catherine Barreau-Saliou, Guido Boella, Annie Blandin-Obernesser, Sébastien Gambs, Guillaume Piolle, and Leendert Van Der Torre. The Coprelobri project : the logical approach to privacy. In 2e Atelier Protection de la Vie Privée (APVP 2011), Sorèze, France, June 2011. Note: 6 pages. [WWW] Keyword(s): Privacy policies, logic, legal computing.
    @inproceedings{AucEtAl11e,
    Address = {Sor{\`e}ze, France},
    Author = {Aucher, Guillaume and Barreau-Saliou, Catherine and Boella, Guido and Blandin-Obernesser, Annie and Gambs, S{\'e}bastien and Piolle, Guillaume and Van Der Torre, Leendert},
    Booktitle = {{2e Atelier Protection de la Vie Priv{\'e}e (APVP 2011)}},
    Date-Added = {2016-01-20 10:46:42 +0000},
    Date-Modified = {2016-01-20 10:46:42 +0000},
    Keywords = {Privacy policies ; logic ; legal computing},
    Month = Jun,
    Note = {6 pages},
    Title = {{The Coprelobri project : the logical approach to privacy}},
    Url = {http://hal.inria.fr/hal-00606014/en},
    Year = {2011},
    Bdsk-Url-1 = {http://hal.inria.fr/hal-00606014/en}
    }
    


  3. Denis Béchet, Alexandre Dikovsky, and Annie Foret. Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages. In Implementation and Application of Automata - 16th International Conference, CIAA 2011, Blois, France, volume 6807 of Lecture Notes in Computer Science, pages 42-52, 2011. Springer.
    Abstract:
    The notion of k-valued categorial grammars where a word is associated to at most k types is often used in the field of lexicalized grammars as a fruitful constraint for obtaining several properties like the existence of learning algorithms. This principle is relevant only when the classes of k-valued grammars correspond to a real hierarchy of languages. Such a property had been shown earlier for classical categorial grammars. This paper establishes the relevance of this notion when categorial grammars are enriched with iterated types.

    @inproceedings{Foret11c,
    author = {Denis Béchet and Alexandre Dikovsky and Annie Foret},
    title = {Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages},
    booktitle = {Implementation and Application of Automata - 16th International Conference, CIAA 2011, Blois, France},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    volume = {6807},
    year = {2011},
    isbn = {978-3-642-22255-9},
    pages = {42-52},
    ee = {http://dx.doi.org/10.1007/978-3-642-22256-6_5},
    keywords = {},
    Abstract={The notion of k-valued categorial grammars where a word is associated to at most k types is often used in the field of lexicalized grammars as a fruitful constraint for obtaining several properties like the existence of learning algorithms. This principle is relevant only when the classes of k-valued grammars correspond to a real hierarchy of languages. Such a property had been shown earlier for classical categorial grammars. This paper establishes the relevance of this notion when categorial grammars are enriched with iterated types.} 
    }
    


  4. Denis Béchet, Alexander Dikovsky, and Annie Foret. On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types. In Logical Aspects of Computational Linguistics - 6th International Conference, LACL 2011, Montpellier, France, volume 6736 of Lecture Notes in Computer Science, pages 80-95, 2011. Springer. Keyword(s): Grammatical inference, Categorial grammar, Dependency grammar, Incremental learning, Iterated types..
    Abstract:
    We study learnability of Categorial Dependency Grammars (CDG), a family of categorial grammars expressing all kinds of projective, discontinuous and repeatable dependencies. For these grammars, it is known that they are not learnable from dependency structures. We propose two different ways of modelling the repeatable dependencies through iterated types and the two corresponding families of CDG which cannot distinguish between the dependencies repeatable at least K times and those repeatable any number of times. For both we show that they are incrementally learnable in the limit from dependency structures.

    @inproceedings{Foret11b,
    author = {Denis Béchet and Alexander Dikovsky and Annie Foret},
    title = {On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types},
    booktitle = {Logical Aspects of Computational Linguistics - 6th International Conference, LACL 2011, Montpellier, France},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    volume = {6736},
    year = {2011},
    isbn = {978-3-642-22220-7},
    pages = {80-95},
    ee = {http://dx.doi.org/10.1007/978-3-642-22221-4_6},
    keywords={Grammatical inference, Categorial grammar, Dependency grammar, Incremental learning, Iterated types.},
    abstract={We study learnability of Categorial Dependency Grammars (CDG), a family of categorial grammars expressing all kinds of projective, discontinuous and repeatable dependencies. For these grammars, it is known that they are not learnable from dependency structures. We propose two different ways of modelling the repeatable dependencies through iterated types and the two corresponding families of CDG which cannot distinguish between the dependencies repeatable at least K times and those repeatable any number of times. For both we show that they are incrementally learnable in the limit from dependency structures.} 
    }
    


  5. Denis Béchet, Alexander Dikovsky, and Annie Foret. Sur les itérations dispersées et les choix itérés pour l'apprentissage incrémental des types dans les grammaires de dépendances. In Conférence Francophone d'Apprentissage 2011 (CAP), Chambéry, France, 2011.
    @inproceedings{Foret11a,
    author = {Denis Béchet and Alexander Dikovsky and Annie Foret},
    title ={Sur les itérations dispersées et les choix itérés pour l'apprentissage incrémental des types dans les grammaires de dépendances},
    booktitle = {Conférence Francophone d'Apprentissage 2011 (CAP), Chambéry, France},
    year={2011} 
    }
    


  6. Peggy Cellier, Mireille Ducassé, and Sébastien Ferré. Exploration de traces à l'aide de fouille de données. In Atelier IC Traces numériques, connaissances et cognition, 2011.
    @inproceedings{cellier2011exploration,
    title={Exploration de traces à l'aide de fouille de données},
    author={Cellier, Peggy and Ducassé, Mireille and Ferré, Sébastien},
    booktitle={Atelier IC ~Traces numériques, connaissances et cognition~},
    year={2011} 
    }
    


  7. Peggy Cellier, Mireille Ducassé, Sébastien Ferré, and Olivier Ridoux. Multiple Fault Localization with Data Mining. In Int. Conf. on Software Engineering & Knowledge Engineering, pages 238-243, 2011. Knowledge Systems Institute Graduate School. Keyword(s): data mining, software engineering, debugging, association rules, formal concept analysis.
    Abstract:
    We have proposed an interactive fault localization method based on two data mining techniques, formal concept analysis and association rules. A lattice formalizes the partial ordering and the dependencies between the sets of program elements (e.g., lines) that are most likely to lead to program execution failures. The paper provides an algorithm to traverse that lattice starting from the most suspect places. The main contribution is that the algorithm is able to deal with any number of faults within a single execution of a test suite. In addition, a stopping criterion independent of the number of faults is provided.

    @inproceedings{CellierDFR11seke,
    author = {Peggy Cellier and Mireille Ducassé and Sébastien Ferré and Olivier Ridoux},
    title = {Multiple Fault Localization with Data Mining},
    booktitle = {Int. Conf. on Software Engineering {\&} Knowledge Engineering},
    year = {2011},
    pages = {238-243},
    keywords = {data mining, software engineering, debugging, association rules, formal concept analysis},
    publisher = {Knowledge Systems Institute Graduate School},
    abstract = {We have proposed an interactive fault localization method based on two data mining techniques, formal concept analysis and association rules. A lattice formalizes the partial ordering and the dependencies between the sets of program elements (e.g., lines) that are most likely to lead to program execution failures. The paper provides an algorithm to traverse that lattice starting from the most suspect places. The main contribution is that the algorithm is able to deal with any number of faults within a single execution of a test suite. In addition, a stopping criterion independent of the number of faults is provided.} 
    }
    


  8. Peggy Cellier, Sébastien Ferré, Mireille Ducassé, and Thierry Charnois. Partial orders and logical concept analysis to explore patterns extracted by data mining. In Int. Conf. on Conceptual Structures for Discovering Knowledge, pages 77-90, 2011. Springer. Keyword(s): data mining, partial order, selection of patterns, logical concept analysis, formal concept analysis.
    Abstract:
    Data mining techniques are used in order to discover emerging knowledge (patterns) in databases. The problem of such techniques is that there are, in general, too many resulting patterns for a user to explore them all by hand. Some methods try to reduce the number of patterns without a priori pruning. The number of patterns remains, nevertheless, high. Other approaches, based on a total ranking, propose to show to the user the top-k patterns with respect to a measure. Those methods do not take into account the user's knowledge and the dependencies that exist between patterns. In this paper, we propose a new way for the user to explore extracted patterns. The method is based on navigation in a partial order over the set of all patterns in the Logical Concept Analysis framework. It accommodates several kinds of patterns and the dependencies between patterns are taken into account thanks to partial orders. It allows the user to use his/her background knowledge to navigate through the partial order, without a priori pruning. We illustrate how our method can be applied on two different tasks (software engineering and natural language processing) and two different kinds of patterns (association rules and sequential patterns).

    @inproceedings{cellier2011iccs,
    title = {Partial orders and logical concept analysis to explore patterns extracted by data mining},
    author = {Cellier, Peggy and Ferré, Sébastien and Ducassé, Mireille and Charnois, Thierry},
    booktitle = {Int. Conf. on Conceptual Structures for Discovering Knowledge},
    pages = {77--90},
    year = {2011},
    publisher = {Springer},
    keywords = {data mining, partial order, selection of patterns, logical concept analysis, formal concept analysis},
    abstract = { Data mining techniques are used in order to discover emerging knowledge (patterns) in databases. The problem of such techniques is that there are, in general, too many resulting patterns for a user to explore them all by hand. Some methods try to reduce the number of patterns without a priori pruning. The number of patterns remains, nevertheless, high. Other approaches, based on a total ranking, propose to show to the user the top-k patterns with respect to a measure. Those methods do not take into account the user's knowledge and the dependencies that exist between patterns. In this paper, we propose a new way for the user to explore extracted patterns. The method is based on navigation in a partial order over the set of all patterns in the Logical Concept Analysis framework. It accommodates several kinds of patterns and the dependencies between patterns are taken into account thanks to partial orders. It allows the user to use his/her background knowledge to navigate through the partial order, without a priori pruning. We illustrate how our method can be applied on two different tasks (software engineering and natural language processing) and two different kinds of patterns (association rules and sequential patterns). } 
    }
    


  9. Mireille Ducassé, Sébastien Ferré, and Peggy Cellier. Building up Shared Knowledge with Logical Information Systems. In A. Napoli and V. Vychodil, editors, Proceedings of the 8th International Conference on Concept Lattices and their Applications, pages 31-42, October 2011. INRIA. Note: ISBN 978-2-905267-78-8.
    Abstract:
    Logical Information Systems (LIS) are based on Logical Concept Analysis, an extension of Formal Concept Analysis. This paper describes an application of LIS to support group decision. A case study gathered a research team. The objective was to decide on a set of potential conferences on which to send submissions. People individually used Abilis, a LIS web server, to preselect a set of conferences. Starting from 1041 call for papers, the individual participants preselected 63 conferences. They met and collectively used Abilis to select a shared set of 42 target conferences. The team could then sketch a publication planning. The case study provides evidence that LIS cover at least three of the collaboration patterns identified by Kolfschoten, de Vreede and Briggs. Abilis helped the team to build a more complete and relevant set of information (Generate/Gathering pattern); to build a shared understanding of the relevant information (Clarify/Building Shared Understanding); and to quickly reduce the number of target conferences (Reduce/Filtering pattern).

    @InProceedings{ducasse2011,
    Author={Mireille Ducassé and Sébastien Ferré and Peggy Cellier},
    Title={Building up Shared Knowledge with Logical Information Systems},
    Pages={31-42},
    BookTitle={Proceedings of the 8th International Conference on Concept Lattices and their Applications},
    Year={2011},
    Editor={A. Napoli and V. Vychodil},
    Publisher={INRIA},
    Note={ISBN 978-2-905267-78-8},
    Month={October},
    Abstract={ Logical Information Systems (LIS) are based on Logical Concept Analysis, an extension of Formal Concept Analysis. This paper describes an application of LIS to support group decision. A case study gathered a research team. The objective was to decide on a set of potential conferences on which to send submissions. People individually used Abilis, a LIS web server, to preselect a set of conferences. Starting from 1041 call for papers, the individual participants preselected 63 conferences. They met and collectively used Abilis to select a shared set of 42 target conferences. The team could then sketch a publication planning. The case study provides evidence that LIS cover at least three of the collaboration patterns identified by Kolfschoten, de Vreede and Briggs. Abilis helped the team to build a more complete and relevant set of information (Generate/Gathering pattern); to build a shared understanding of the relevant information (Clarify/Building Shared Understanding); and to quickly reduce the number of target conferences (Reduce/Filtering pattern).} 
    }
    


  10. Sébastien Ferré and Alice Hermann. Semantic Search: Reconciling Expressive Querying and Exploratory Search. In L. Aroyo and C. Welty, editors, Int. Semantic Web Conf., LNCS 7031, pages 177-192, 2011. Springer. Keyword(s): semantic web, querying, exploratory search, expressiveness, navigation, faceted search.
    Abstract:
    Faceted search and querying are two well-known paradigms to search the Semantic Web. Querying languages, such as SPARQL, offer expressive means for searching RDF datasets, but they are difficult to use. Query assistants help users to write well-formed queries, but they do not prevent empty results. Faceted search supports exploratory search, i.e., guided navigation that returns rich feedbacks to users, and prevents them to fall in dead-ends (empty results). However, faceted search systems do not offer the same expressiveness as query languages. We introduce Query-based Faceted Search (QFS), the combination of an expressive query language and faceted search, to reconcile the two paradigms. In this paper, the LISQL query language generalizes existing semantic faceted search systems, and covers most features of SPARQL. A prototype, Sewelis (aka. Camelis 2), has been implemented, and a usability evaluation demonstrated that QFS retains the ease-of-use of faceted search, and enables users to build complex queries with little training.

    @InProceedings{FerHer2011iswc,
    author = {Sébastien Ferré and Alice Hermann},
    title = {Semantic Search: Reconciling Expressive Querying and Exploratory Search},
    booktitle = {Int. Semantic Web Conf.},
    pages = {177-192},
    year = {2011},
    editor = {L. Aroyo and C. Welty},
    series = {LNCS 7031},
    publisher = {Springer},
    keywords = {semantic web, querying, exploratory search, expressiveness, navigation, faceted search},
    abstract = {Faceted search and querying are two well-known paradigms to search the Semantic Web. Querying languages, such as SPARQL, offer expressive means for searching RDF datasets, but they are difficult to use. Query assistants help users to write well-formed queries, but they do not prevent empty results. Faceted search supports exploratory search, i.e., guided navigation that returns rich feedbacks to users, and prevents them to fall in dead-ends (empty results). However, faceted search systems do not offer the same expressiveness as query languages. We introduce Query-based Faceted Search (QFS), the combination of an expressive query language and faceted search, to reconcile the two paradigms. In this paper, the LISQL query language generalizes existing semantic faceted search systems, and covers most features of SPARQL. A prototype, Sewelis (aka. Camelis 2), has been implemented, and a usability evaluation demonstrated that QFS retains the ease-of-use of faceted search, and enables users to build complex queries with little training.},
    
    }
    


  11. S. Ferré, A. Hermann, and M. Ducassé. Combining Faceted Search and Query Languages for the Semantic Web. In C. Salinesi and O. Pastor, editors, Semantic Search over the Web (SSW) - Advanced Information Systems Engineering Workshops - CAiSE Int. Workshops, volume 83 of LNBIP 83, pages 554-563, 2011. Springer. Note: Best paper. Keyword(s): semantic web, semantic search, user interaction, faceted search, querying.
    Abstract:
    Faceted search and querying are the two main paradigms to search the Semantic Web. Querying languages, such as SPARQL, offer expressive means for searching knowledge bases, but they are difficult to use. Query assistants help users to write well-formed queries, but they do not prevent empty results. Faceted search supports exploratory search, i.e., guided navigation that returns rich feedbacks to users, and prevents them to fall in dead-ends (empty results). However, faceted search systems do not offer the same expressiveness as query languages. We introduce semantic faceted search, the combination of an expressive query language and faceted search to reconcile the two paradigms. The query language is basically SPARQL, but with a syntax that better fits in a faceted search interface. A prototype, Camelis 2, has been implemented, and a usability evaluation demonstrated that semantic faceted search retains the ease-of-use of faceted search, and enables users to build complex queries with little training.

    @inproceedings{FerHerDuc2011ssw,
    author = {S. Ferré and A. Hermann and M. Ducassé},
    title = {Combining Faceted Search and Query Languages for the Semantic Web},
    booktitle = {CAiSE Workshops},
    year = {2011},
    pages = {554-563},
    editor = {C. Salinesi and O. Pastor},
    booktitle = {Semantic Search over the Web (SSW) - Advanced Information Systems Engineering Workshops - CAiSE Int. Workshops},
    publisher = {Springer},
    series = {LNBIP 83},
    volume = {83},
    year = {2011},
    isbn = {978-3-642-22055-5},
    note = {Best paper},
    keywords = {semantic web, semantic search, user interaction, faceted search, querying},
    abstract = {Faceted search and querying are the two main paradigms to search the Semantic Web. Querying languages, such as SPARQL, offer expressive means for searching knowledge bases, but they are difficult to use. Query assistants help users to write well-formed queries, but they do not prevent empty results. Faceted search supports exploratory search, i.e., guided navigation that returns rich feedbacks to users, and prevents them to fall in dead-ends (empty results). However, faceted search systems do not offer the same expressiveness as query languages. We introduce semantic faceted search, the combination of an expressive query language and faceted search to reconcile the two paradigms. The query language is basically SPARQL, but with a syntax that better fits in a faceted search interface. A prototype, Camelis 2, has been implemented, and a usability evaluation demonstrated that semantic faceted search retains the ease-of-use of faceted search, and enables users to build complex queries with little training.},
    
    }
    


  12. Alice Hermann, Sébastien Ferré, and Mireille Ducassé. Création et mise à jour guidées d'objets dans une base RDF(S). In Rencontres Jeunes Chercheurs en Intelligence Artificielle (RJCIA), 2011. Presses de l'Université des Antilles et de la Guyane.
    Abstract:
    La mise à jour des bases de connaissances existantes est cruciale pour tenir compte des nouvelles informations, régulièrement découvertes. Toutefois, les données actuelles du Web Sémantique sont rarement mises à jour par les utilisateurs. Les utilisateurs ne sont pas suffisament aidés lors de l'ajout et de la mise à jour d'objets. Nous proposons une approche pour aider l'utilisateur à ajouter de nouveaux objets de manière incrémentale et dynamique. Notre approche est fondée sur les Systèmes d'Information Logiques pour l'interaction utilisateur. Pour le guidage, le système cherche les objets ayant des propriétés en commun avec la description de l'objet en cours de création. Les propriétés de ces objets, non présents dans la description, servent de suggestions pour compléter la description de l'objet.

    @inproceedings{Hermann:RJCIA:2011,
    author = {Alice Hermann and Sébastien Ferré and Mireille Ducassé},
    booktitle = {Rencontres Jeunes Chercheurs en Intelligence Artificielle ({RJCIA})},
    title = {Création et mise à jour guidées d'objets dans une base {RDF(S)}},
    publisher = {Presses de l'{U}niversité des {A}ntilles et de la {G}uyane},
    year = 2011,
    abstract = {La mise à jour des bases de connaissances existantes est cruciale pour tenir compte des nouvelles informations, régulièrement découvertes. Toutefois, les données actuelles du Web Sémantique sont rarement mises à jour par les utilisateurs. Les utilisateurs ne sont pas suffisament aidés lors de l'ajout et de la mise à jour d'objets. Nous proposons une approche pour aider l'utilisateur à ajouter de nouveaux objets de manière incrémentale et dynamique. Notre approche est fondée sur les Systèmes d'Information Logiques pour l'interaction utilisateur. Pour le guidage, le système cherche les objets ayant des propriétés en commun avec la description de l'objet en cours de création. Les propriétés de ces objets, non présents dans la description, servent de suggestions pour compléter la description de l'objet.},
    
    }
    


  13. Alice Hermann, Sébastien Ferré, and Mireille Ducassé. Guided creation and update of objects in RDF(S) bases. In Mark A. Musen and Óscar Corcho, editors, Int. Conf. Knowledge Capture (K-CAP 2011), pages 189-190, 2011. ACM Press.
    Abstract:
    Updating existing knowledge bases is crucial to take into account the information that are regularly discovered. However, this is quite tedious and in practice Semantic Web data are rarely updated by users. This paper presents UTILIS, an approach to help users create and update objects in RDF(S) bases. While creating a new object, $o$, UTILIS searches for similar objects, found by applying relaxation rules to the description of $o$, taken as a query. The resulting objects and their properties serve as suggestions to expand the description of $o$.

    @inproceedings{Hermann:KCAP:2011,
    author = {Alice Hermann and Sébastien Ferré and Mireille Ducassé},
    title = {Guided creation and update of objects in {RDF(S)} bases},
    booktitle = {Int. Conf. Knowledge Capture (K-CAP 2011)},
    year = {2011},
    pages = {189-190},
    editor = {Mark A. Musen and Óscar Corcho},
    publisher = {ACM Press},
    abstract = {Updating existing knowledge bases is crucial to take into account the information that are regularly discovered. However, this is quite tedious and in practice Semantic Web data are rarely updated by users. This paper presents UTILIS, an approach to help users create and update objects in RDF(S) bases. While creating a new object, $o$, UTILIS searches for similar objects, found by applying relaxation rules to the description of $o$, taken as a query. The resulting objects and their properties serve as suggestions to expand the description of $o$.},
    
    }
    


  14. D. Legallois, Peggy Cellier, and Thierry Charnois. Calcul de réseaux phrastiques pour l analyse et la navigation textuelle. In Traitement Automatique des Langues Naturelles, 2011. Keyword(s): Sentence network, Bonds between sentences, Textual analysis, Discourse analysis.
    Abstract:
    In this paper, we present an automatic process based on text reduction introduced by Hoey. The application of that kind of approaches on large texts is difficult to do by hand. In the paper, we propose an automatic process to treat large texts. We have conducted some experiments on different kinds of texts (narrative, expositive) to show the benefits of the approach.

    @inproceedings{legallois2011taln,
    title={Calcul de réseaux phrastiques pour l~analyse et la navigation textuelle},
    author={Legallois, D. and Cellier, Peggy and Charnois, Thierry},
    booktitle={Traitement Automatique des Langues Naturelles},
    year={2011},
    keywords = {Sentence network, Bonds between sentences, Textual analysis, Discourse analysis},
    abstract = { In this paper, we present an automatic process based on text reduction introduced by Hoey. The application of that kind of approaches on large texts is difficult to do by hand. In the paper, we propose an automatic process to treat large texts. We have conducted some experiments on different kinds of texts (narrative, expositive) to show the benefits of the approach. } 
    }
    


Internal reports
  1. Sébastien Ferré. SQUALL: a High-Level Language for Querying and Updating the Semantic Web. Research Report, IRISA, 2011. [WWW] Keyword(s): Semantic Web, controlled natural language, query language, update language, expressiveness, Montague grammar.
    Abstract:
    Languages play a central role in the Semantic Web. An important aspect regarding their design is syntax as it plays a crucial role in the wide acceptance of the Semantic Web approach. Like for programming languages, an evolution can be observed from low-level to high-level designs. High-level languages not only allow more people to contribute by abstracting from the details, but also makes experienced people more productive, and makes the produced documents easier to share and maintain. We introduce SQUALL, a high-level language for querying and updating semantic data. It has a strong adequacy with RDF, an expressiveness very similar to SPARQL 1.1, and a controlled natural language syntax that completely abstracts from low-level notions such as bindings and relational algebra. We first give an informal presentation of SQUALL through examples, comparing it with SPARQL. We then formally define the syntax and semantics of SQUALL as a Montague grammar, and its translation to SPARQL.

    @techreport{PI1985,
    title = {{SQUALL}: a High-Level Language for Querying and Updating the Semantic Web},
    author = {Sébastien Ferré},
    abstract = {Languages play a central role in the Semantic Web. An important aspect regarding their design is syntax as it plays a crucial role in the wide acceptance of the Semantic Web approach. Like for programming languages, an evolution can be observed from low-level to high-level designs. High-level languages not only allow more people to contribute by abstracting from the details, but also makes experienced people more productive, and makes the produced documents easier to share and maintain. We introduce SQUALL, a high-level language for querying and updating semantic data. It has a strong adequacy with RDF, an expressiveness very similar to SPARQL 1.1, and a controlled natural language syntax that completely abstracts from low-level notions such as bindings and relational algebra. We first give an informal presentation of SQUALL through examples, comparing it with SPARQL. We then formally define the syntax and semantics of SQUALL as a Montague grammar, and its translation to SPARQL.},
    keywords = {Semantic Web, controlled natural language, query language, update language, expressiveness, Montague grammar},
    language = {{A}nglais},
    institution = {IRISA},
    affiliation = {{LIS} - {IRISA} - {CNRS} - {I}nstitut {N}ational des {S}ciences {A}ppliquées de {R}ennes - {U}niversité de {R}ennes {I} },
    pages = {18},
    type = {Research Report},
    year = {2011},
    URL = {http://hal.inria.fr/docs/00/62/84/27/PDF/PI-1985.pdf},
    
    }
    


  2. Sébastien Ferré, Alice Hermann, and Mireille Ducassé. Semantic Faceted Search: Safe and Expressive Navigation in RDF Graphs. Research Report, IRISA, 2011. [WWW] Keyword(s): semantic web, faceted search, query language, exploratory search, navigation, expressiveness.
    Abstract:
    Faceted search and querying are the two main paradigms to search the Semantic Web. Querying languages, such as SPARQL, offer expressive means for searching knowledge bases, but they are difficult to use. Query assistants help users to write well-formed queries, but they do not prevent empty results. Faceted search supports exploratory search, i.e., guided navigation that returns rich feedbacks to users, and prevents them to make navigation steps that lead to empty results (dead-ends). However, faceted search systems do not offer the same expressiveness as query languages. We introduce {\em semantic faceted search}, the combination of an expressive query language and faceted search to reconcile the two paradigms. The query language is basically SPARQL, but with a syntax that extends Turtle with disjunction and negation, and that better fits in a faceted search interface: LISQL. We formalize the navigation of faceted search as a navigation graph, where nodes are queries, and navigation links are query transformations. We prove that this navigation graph is {\em safe} (no dead-end), and {\em complete} (every query that is not a dead-end can be reached by navigation). That formalization itself is a contribution to faceted search. \KILL{The expressiveness of LISQL is shown comparable to SPARQL, and they are based on the same relational algebra.} A prototype, Camelis~2, has been implemented, and a usability evaluation with graduate students demonstrated that semantic faceted search retains the ease-of-use of faceted search, and enables most users to build complex queries with little training.

    @techreport{PI1964,
    title = {Semantic Faceted Search: Safe and Expressive Navigation in {RDF} Graphs },
    author = {Sébastien Ferré and Alice Hermann and Mireille Ducassé},
    abstract = {Faceted search and querying are the two main paradigms to search the Semantic Web. Querying languages, such as SPARQL, offer expressive means for searching knowledge bases, but they are difficult to use. Query assistants help users to write well-formed queries, but they do not prevent empty results. Faceted search supports exploratory search, i.e., guided navigation that returns rich feedbacks to users, and prevents them to make navigation steps that lead to empty results (dead-ends). However, faceted search systems do not offer the same expressiveness as query languages. We introduce {\em semantic faceted search}, the combination of an expressive query language and faceted search to reconcile the two paradigms. The query language is basically SPARQL, but with a syntax that extends Turtle with disjunction and negation, and that better fits in a faceted search interface: LISQL. We formalize the navigation of faceted search as a navigation graph, where nodes are queries, and navigation links are query transformations. We prove that this navigation graph is {\em safe} (no dead-end), and {\em complete} (every query that is not a dead-end can be reached by navigation). That formalization itself is a contribution to faceted search. \KILL{The expressiveness of LISQL is shown comparable to SPARQL, and they are based on the same relational algebra.} A prototype, Camelis~2, has been implemented, and a usability evaluation with graduate students demonstrated that semantic faceted search retains the ease-of-use of faceted search, and enables most users to build complex queries with little training.},
    keywords = {semantic web, faceted search, query language, exploratory search, navigation, expressiveness},
    language = {{A}nglais},
    institution = {IRISA},
    affiliation = {{LIS} - {IRISA} - {CNRS} - {I}nstitut {N}ational des {S}ciences {A}ppliquées de {R}ennes - {U}niversité de {R}ennes {I} },
    pages = {27},
    type = {Research Report},
    year = {2011},
    URL = {http://hal.inria.fr/inria-00410959/PDF/PI-1964.pdf},
    
    }
    


Miscellaneous
  1. Sébastien Ferré and Alice Hermann. Camelis2 : explorer et éditer une base RDF(S) de façon expressive et interactive. Note: Démo acceptée à la platerforme AFIA, 2011. Keyword(s): demo.
    @Unpublished{demo:camelis2:ic2011,
    author = {Sébastien Ferré and Alice Hermann},
    title = {Camelis2 : explorer et éditer une base RDF(S) de façon expressive et interactive},
    note = {Démo acceptée à la platerforme AFIA},
    year = {2011},
    keywords = {demo},
    
    }
    


  2. Sébastien Ferré and Alice Hermann. Sewelis: Exploring and Editing an RDF Base in an Expressive and Interactive Way. Note: Demo accepted at the Int. Semantic Web Conf. (ISWC), 2011. Keyword(s): demo.
    Abstract:
    Query-based Faceted Search (QFS), introduced in a research paper at ISWC'11, reconciles the expressiveness of querying languages (e.g., SPARQL), and the benefits of exploratory search found in faceted search. Because of the interactive nature of QFS, which is difficult to fully render in a research paper, we feel it is important to complement it with a demonstration of our QFS prototype, Sewelis (aka. Camelis 2). An important addition to the research paper is the extension of QFS to the guided edition of RDF bases, where suggestions are based on existing data. This paper motivates our approach, shortly presents Sewelis, and announces the program of the demonstration. Screencasts of the demonstration, as well as material (program and data) to reproduce it, are available at { t http://www.irisa.fr/LIS/softwares/sewelis}.

    @Unpublished{demo:sewelis:iswc2011,
    author = {Sébastien Ferré and Alice Hermann},
    title = {Sewelis: Exploring and Editing an RDF Base in an Expressive and Interactive Way},
    note = {Demo accepted at the Int. Semantic Web Conf. (ISWC)},
    year = {2011},
    keywords = {demo},
    abstract = {Query-based Faceted Search (QFS), introduced in a research paper at ISWC'11, reconciles the expressiveness of querying languages (e.g., SPARQL), and the benefits of exploratory search found in faceted search. Because of the interactive nature of QFS, which is difficult to fully render in a research paper, we feel it is important to complement it with a demonstration of our QFS prototype, Sewelis (aka. Camelis 2). An important addition to the research paper is the extension of QFS to the guided edition of RDF bases, where suggestions are based on existing data. This paper motivates our approach, shortly presents Sewelis, and announces the program of the demonstration. Screencasts of the demonstration, as well as material (program and data) to reproduce it, are available at {	t http://www.irisa.fr/LIS/softwares/sewelis}.},
    
    }
    



BACK TO INDEX




Disclaimer:

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.




Last modified: Tue Feb 28 10:13:27 2017
Author: ferre.


This document was translated from BibTEX by bibtex2html