BACK TO INDEX

 Publications of year 2001
 Articles in journal or book chapters
1. M. Ducassé and E. Jahier. Efficient Automated Trace Analysis: Examples with Morphine. Electronic Notes in Theoretical Computer Science, 55(2), 2001. Note: K. Havelund and G. Rosu (Eds), proceedings of the first Workshop on Runtime Verification.
@Article{ducasse01,
Author={M. Ducassé and E. Jahier},
Title={Efficient Automated Trace Analysis: Examples with Morphine},
Journal={Electronic Notes in Theoretical Computer Science},
Year={2001},
Volume={55},
Number={2},
Note={K. Havelund and G. Rosu (Eds), proceedings of the first Workshop on Runtime Verification}
}


2. O. Ridoux and Patrice Boizumault. Typed Static Analysis: Application to the Groundness Analysis of Typed Prolog. Journal of Functional and Logic Programming, 2001(4), July 2001.
@article{rb-jflp2001,
author={O. Ridoux and Patrice Boizumault},
title={Typed Static Analysis: Application to the Groundness Analysis of Typed Prolog},
journal={Journal of Functional and Logic Programming},
volume={2001},
number={4},
publisher={EAPLS},
month={July},
year={2001}
}


 Conference articles
1. Sébastien Ferré. Complete and Incomplete Knowledge in Logical Information Systems. In Salem Benferhat and Philippe Besnard, editors, Symbolic and Quantitative Approaches to Reasoning with Uncertainty, LNCS 2143, pages 782-791, 2001. Springer. Keyword(s): modal logic, All I know, complete and incomplete knowledge, information system.
Abstract:
 We present a generalization of logic All I Know by presenting it as an extension of standard modal logics. We study how this logic can be used to represent complete and incomplete knowledge in Logical Information Systems. In these information systems, a knowledge base is a collection of objects (e.g., files, bibliographical items) described in the same logic as used for expressing queries. We show that usual All I Know (transitive and euclidean accessibility relation) is convenient for representing complete knowledge, but not for incomplete knowledge. For this, we use \emph{serial} All I Know (serial accessibility relation).

@InProceedings{Fer2001,
author = {Sébastien Ferré},
title = {Complete and Incomplete Knowledge in Logical Information Systems},
booktitle = {Symbolic and Quantitative Approaches to Reasoning with Uncertainty},
pages = "782--791",
year = "2001",
editor = "Salem Benferhat and Philippe Besnard",
series = "LNCS 2143",
publisher = "Springer",
keywords = {modal logic, All I know, complete and incomplete knowledge, information system},
langue = "anglais",
abstract = "We present a generalization of logic All I Know by presenting it as an extension of standard modal logics. We study how this logic can be used to represent complete and incomplete knowledge in Logical Information Systems. In these information systems, a knowledge base is a collection of objects (e.g., files, bibliographical items) described in the same logic as used for expressing queries. We show that usual All I Know (transitive and euclidean accessibility relation) is convenient for representing complete knowledge, but not for incomplete knowledge. For this, we use \emph{serial} All I Know (serial accessibility relation).",

}


2. Sébastien Ferré and Olivier 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, 2001. Springer. [WWW] Keyword(s): logic, composition, theorem prover, logic-based systems.
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 = {Sébastien Ferré and Olivier Ridoux},
title = {A Framework for Developing Embeddable Customized Logics},
booktitle = {Int. Work. Logic-based Program Synthesis and Transformation},
year = {2001},
editor = {A. Pettorossi},
series = {LNCS 2372},
publisher = {Springer},
pages = {191--215},
langue = {anglais},
url = {ftp://ftp.irisa.fr/local/lande/sf-or-lopstr01.ps.gz},
keywords = {logic, composition, theorem prover, logic-based systems},
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.},

}


3. Sébastien Ferré and Olivier Ridoux. Searching for Objects and Properties with Logical Concept Analysis. In Harry S. Delugach and Gerd Stumme, editors, International Conference on Conceptual Structures, LNCS 2120, pages 187-201, 2001. Springer. Keyword(s): concept analysis, navigation, knowledge discovery, logical information system.
Abstract:
 Logical Concept Analysis is Formal Concept Analysis where logical formulas replace sets of attributes. We define a Logical Information System that combines navigation and querying for searching for objects. Places and queries are unified as formal concepts represented by logical formulas. Answers can be both extensional (objects belonging to a concept) and intensional (formulas refining a concept). Thus, all facets of navigation are formalized in terms of Logical Concept Analysis. We show that the definition of being a refinement of some concept is a specific case of Knowledge Discovery in a formal context. It can be generalized to recover more classical KD~operations like machine-learning through the computation of necessary or sufficient properties (modulo some confidence), or data-mining through association rules.

@InProceedings{FerRid2001,
author = {Sébastien Ferré and Olivier Ridoux},
title = {Searching for Objects and Properties with Logical Concept Analysis},
booktitle = {International Conference on Conceptual Structures},
pages = "187--201",
year = {2001},
editor = "Harry S. Delugach and Gerd Stumme",
series = "LNCS 2120",
publisher = "Springer",
keywords = {concept analysis, navigation, knowledge discovery, logical information system},
langue = "anglais",
abstract = "Logical Concept Analysis is Formal Concept Analysis where logical formulas replace sets of attributes. We define a Logical Information System that combines navigation and querying for searching for objects. Places and queries are unified as formal concepts represented by logical formulas. Answers can be both extensional (objects belonging to a concept) and intensional (formulas refining a concept). Thus, all facets of navigation are formalized in terms of Logical Concept Analysis. We show that the definition of being a refinement of some concept is a specific case of Knowledge Discovery in a formal context. It can be generalized to recover more classical KD~operations like machine-learning through the computation of necessary or sufficient properties (modulo some confidence), or data-mining through association rules.",

}


4. Annie Foret. Conjoinability and unification in Lambek categorial grammars. In New Perspectives in Logic and Formal Linguisitics, Proceedings Vth ROMA Workshop, Roma, 2001. Bulzoni Editore.
@inproceedings{For01a,
author = {Annie Foret},
title = {Conjoinability and unification in {L}ambek categorial grammars},
booktitle = {New Perspectives in Logic and Formal Linguisitics, Proceedings Vth ROMA Workshop},
publisher = { Bulzoni Editore },
year = 2001,
}


5. Annie Foret. Mixing deduction and substitution in Lambek categorial grammars, some investigations. In LACL'01, 4th International Conference on Logical Aspects of Computational Linguistics, number 2099 of Lecture Notes in Artificial Intelligence, Le Croisic, France, 2001. Springer-Verlag.
@inproceedings{For01b,
author = {Annie Foret},
title = {Mixing deduction and substitution in {L}ambek categorial grammars, some investigations},
booktitle = {LACL'01, 4th International Conference on Logical Aspects of Computational Linguistics },
series = {Lecture Notes in Artificial Intelligence},
year = 2001,
number = 2099,
publisher = { Springer-Verlag },
}


6. Annie Foret. The emptiness of intersection problem for k-valued categorial grammars (classical and Lambek) is undecidable. In FGMOL'01, the sixth conference on Formal Grammar and the seventh on the Mathematics of Language, Helsinki, Finland, 2001.
@inproceedings{For01c,
author = {Annie Foret},
title = {The emptiness of intersection problem for k-valued categorial grammars (classical and {L}ambek) is undecidable },
booktitle = {FGMOL'01, the sixth conference on Formal Grammar and the seventh on the Mathematics of Language},
year = 2001,
}


7. E. Jahier, M. Ducassé, and O. Ridoux. Specifying Prolog Trace Models with a Continuation Semantics. In K.-K. Lau, editor, Logic Based Program Synthesis and Transformation, 2001. Springer-Verlag, Lecture Notes in Computer Science 2042.
@InProceedings{jahier01b,
Author = {E. Jahier and M. Ducassé and O. Ridoux},
Title = {Specifying {Prolog} Trace Models with a Continuation Semantics},
Editor = {K.-K. Lau},
Booktitle = {Logic Based Program Synthesis and Transformation},
Publisher = {Springer-Verlag, Lecture Notes in Computer Science 2042},
Year = {2001}
}


8. L. Langevine, P. Deransart, M. Ducassé, and E. Jahier. Prototyping clp(fd) tracers: a trace model and an experimental validation environment. In T. Kusalik, editor, Proceedings of the 11th Workshop on Logic Programming Environments, 2001. Computer Research Repository, CS.PL/0111043.
@InProceedings{langevine01,
Author={L. Langevine and P. Deransart and M. Ducassé and E. Jahier},
Title={Prototyping {\bf clp(fd)} tracers: a trace model and an experimental validation environment},
BookTitle={Proceedings of the 11th Workshop on Logic Programming Environments},
Year={2001},
Editor={T. Kusalik},
Publisher={ Computer Research Repository, CS.PL/0111043}
}


9. J.-P. Pouzol and M. Ducassé. From Declarative Signatures to Misuse IDS. In W. Lee, L. Mé, and A. Wespi, editors, Recent Advances in Intrusion Detection, Proceedings of the 4th International Symposium, pages 1-21, 2001. Springer-Verlag, Lecture Notes in Computer Science 2212.
@InProceedings{pouzol01,
Author={J.-P. Pouzol and M. Ducassé},
Title={From Declarative Signatures to Misuse IDS},
Pages={1-21},
BookTitle={Recent Advances in Intrusion Detection, Proceedings of the 4th International Symposium},
Year={2001},
Editor={W. Lee and L. Mé and A. Wespi},
Publisher={Springer-Verlag, Lecture Notes in Computer Science 2212}
}


10. J. Villaneau, J.-Y. Antoine, and Olivier Ridoux. Combining Syntax and Pragmatic Knowledge for the Understanding of Spontaneous Spoken Sentences. In Ph. de Groote, G. Morill, and Ch. Retoré, editors, 4th Int. Conf. Logical Aspects of Computational Linguistics, 2001.
@inproceedings{var-lacl2001,
author = "J. Villaneau and J.-Y. Antoine and Olivier Ridoux",
title = "Combining Syntax and Pragmatic Knowledge for the Understanding of Spontaneous Spoken Sentences",
booktitle = "4th Int. Conf. Logical Aspects of Computational Linguistics",
editor = "Ph. de Groote and G. Morill and Ch. Retoré",
year = 2001
}


 Internal reports
1. M. Ducassé and L. Rozé. Revisiting the Traffic lights'' B case study. Publication Interne 1424, IRISA, November 2001.
@TechReport{ducasse01b,
Author={M. Ducassé and L. Rozé},
Title={Revisiting the Traffic lights'' B case study},
Institution={IRISA},
Year={2001},
Type={Publication Interne},
Number={1424},
Month={November}
}


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.