Contact Version française

The ProVal team was stopped at the end of August 2012, and reborn into a new team Toccata
These pages do not evolve anymore, please follow the link above for up-to-date informations about our team.

Publications 1991

Back

Books / Journals / Conferences / PhD theses / Misc. / Reports

Books and book chapters

[2] Hubert Comon. Disunification: a survey. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT Press, 1991. [ bib | .dvi.Z ]
[1] Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT-Press, 1991. [ bib ]

Journals

[2] Hubert Comon, Denis Lugiez, and Philippe Schnoebelen. A rewrite-based type discipline for a subset of computer algebra. Journal of Symbolic Computation, 11, 1991. [ bib ]
[1] Evelyne Contejean and Hervé Devie. Résolution de systèmes linéaires d'équations diophantiennes. Comptes-Rendus de l'Académie des Sciences de Paris, 313:115-120, 1991. Série I. [ bib ]
Nous présentons ici un algorithme pour résoudre les systèmes linéaires homogènes d'équations diophantiennes de façon directe, à l'aide d'une interprétation géométrique.

Conferences

[7] Nachum Dershowitz, Jean-Pierre Jouannaud, and J.W. Klop. Open problems in term rewriting. In Ronald. V. Book, editor, 4th International Conference on Rewriting Techniques and Applications, volume 488 of Lecture Notes in Computer Science, pages 445-456, Como, Italy, April 1991. Springer. [ bib ]
[6] Jean-Pierre Jouannaud. Executable higher-order algebraic specifications. In C. Choffrut and M. Jantzen, editors, Proc. 8th Symp. on Theoretical Aspects of Computer Science, Hamburg, LNCS 480, pages 16-25, February 1991. [ bib ]
[5] Hubert Comon. Complete axiomatizations of some quotient term algebras. In Javier Leach Albert, Burkhard Monien, and M. Rodriguez Artalejo, editors, 18th International Colloquium on Automata, Languages and Programming, volume 510 of Lecture Notes in Computer Science, Madrid, Spain, 1991. Springer. [ bib ]
[4] Jean-Pierre Jouannaud and Mitsuhiro Okada. Satisfiability of systems of ordinal notations with the subterm property is decidable. In Javier Leach Albert, Burkhard Monien, and M. Rodriguez Artalejo, editors, 18th International Colloquium on Automata, Languages and Programming, volume 510 of Lecture Notes in Computer Science, pages 455-468, Madrid, Spain, 1991. Springer. [ bib ]
[3] Jean-Pierre Jouannaud and Mitsuhiro Okada. Executable higher-order algebraic specification languages. In Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, pages 350-361. IEEE Comp. Soc. Press, 1991. [ bib ]
[2] Delia Kesner. Pattern matching in order-sorted languages. In Proc. 16th Mathematical Foundations of Computer Science, Warsaw, LNCS 520. Springer, 1991. [ bib ]
[1] Claude Marché. On ground AC-completion. In Ronald. V. Book, editor, 4th International Conference on Rewriting Techniques and Applications, volume 488 of Lecture Notes in Computer Science, Como, Italy, April 1991. Springer. [ bib ]

PhD theses

[1] Hervé Devie. Une approche algébrique de la réécriture de preuves équationnelles et son application à la dérivation de procédures de complétion. Thèse de doctorat, Université Paris-Sud, Orsay, France, October 1991. [ bib ]

Misc.

[5] Hubert Comon. Ground normal forms and inductive proofs. part II: Conditional grammars. submitted, 1991. [ bib ]
[4] Hubert Comon. Ground normal forms and inductive proofs. part III: Specification transformations. In preparation, 1991. [ bib ]
[3] Catherine Delor. Terminaison de systèmes de réécriture, application à la transformation de formules équationnelles. Thèse de Doctorat, Université Paris VII, France, 1991. [ bib ]
[2] Jieh Hsiang and Jean-Pierre Jouannaud. Complete sets of inference rules for E-unification problems. Proc. Worshop on Unification, Val d'Ajol, 1988, Revised version in preparation, 1991. [ bib ]
[1] Judith Jakoubovitch. Priority rewrite systems. to appear, 1991. [ bib ]

Reports

[6] Hubert Comon and Maribel Fernández. Negation elimination in equational formulae. Research Report 716, Laboratoire de Recherche en Informatique, Univ. Paris-Sud, France, December 1991. [ bib ]
[5] Maribel Fernández. Equational disunification. Research Report 684, Laboratoire de Recherche en Informatique, Univ. Paris-Sud, July 1991. [ bib ]
[4] Delia Kesner. Pattern matching in order sorted languages. PRL Report 10, PRL - Digital Equipment Corporation, May 1991. [ bib ]
[3] Claude Marché. The word problem of ACD-ground theories is undecidable. Research Report 663, Laboratoire de Recherche en Informatique, Université de Paris-Sud, Orsay, France, April 1991. [ bib ]
[2] Siva Anantharaman and Nirina Andrianarivelo. A complete semi-decision procedure in Horn theories. Research report, LRI, 1991. [ bib ]
[1] Hubert Comon. Ground normal forms and inductive proofs. part I: complement problems. Research Report 698, Laboratoire de Recherche en Informatique, 1991. [ bib ]

Back

Books / Journals / Conferences / PhD theses / Misc. / Reports


This page was generated by bibtex2html.