Références

Livres et monographies

1

C. Kirchner (réd.), Special Issue on RTA-93, Theoretical Computer Science, Elsevier Science Publishers B. V. (North-Holland), 1995.

Documents d'habilitation à diriger des recherches

2

D. Lugiez, Résolution de contraintes symboliques, habilitation à diriger des recherches, Université Henri Poincaré - Nancy 1, janvier 1995.

Thèses

3

R. Curien, Outils pour la preuve par analogie, Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1, janvier 1995.

4

C. Hintermeier, Déduction avec sortes ordonnées et égalités, Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1, octobre 1995.

5

J.-L. Moysset, Compléments associatifs-commutatifs et leurs applications, Thèse de Doctorat d'Université, Université Henri Poincaré - Nancy 1, juin 1995.

Articles et chapitres de livre

6

A. Bouhoula, E. Kounalis, M. Rusinowitch, ``Automated Mathematical Induction'', Journal of Logic and Computation 5, 5, 1995, p. 631--668.

7

A. Bouhoula, M. Rusinowitch, ``Implicit induction in conditional theories'', Journal of Automated Reasoning 14, 2, 1995, p. 189--235.

8

C. Kirchner, H. Kirchner, M. Vittek, ``Designing Constraint Logic Programming Languages using Computational Systems'', in: Principles and Practice of Constraint Programming. The Newport Papers., P. Van Hentenryck et V. Saraswat (réd.), MIT press, 1995, p. 131--158.

9

H. Kirchner, ``On the Use of Constraints in Automated Deduction'', in: Constraint Programming: Basics and Trends, A. Podelski (réd.), Lecture Notes in Computer Science, 910, Springer-Verlag, 1995, p. 128--146.

10

H. Kirchner, ``Some Extensions of Rewriting'', in: Term Rewriting, H. Comon et J.-P. Jouannaud (réd.), Lecture Notes in Computer Science, 909, Springer-Verlag, 1995, p. 54--73.

11

E. Kounalis, M. Rusinowitch, ``Reasoning with conditional axioms'', Annals of Mathematics and Artificial Intelligence 15, 2, 1995.

12

G. Kucherov, M. Rusinowitch, ``Undecidability of Ground Reducibility for Word Rewriting Systems with Variables'', Information Processing Letters 53, 1995, p. 209--215.

13

D. Lugiez, ``Positive and Negative Results for Higher-order Disunification'', Journal of Symbolic Computation, 1995, To appear.

14

M. Rusinowitch, L. Vigneron, ``Automated Deduction with Associative-Commutative Operators'', Applicable Algebra in Engineering, Communication and Computation 6, 1, janvier 1995, p. 23--56.

Communications à des congrès, colloques, etc.

15

F. Ajili, E. Contejean, ``Complete Solving of Linear Diophantine Equations and Inequations without Adding Variables'', in: Proceedings 1st International Conference on Principles and Practice of Constraint Programming, Cassis (France), U. Montanari, F. Rossi (réd.), Lecture Notes in Computer Science, 976, Springer-Verlag, p. 1--17, septembre 1995.

16

F. Ajili, C. Kirchner, ``Combining symbolic and interpreted constraints'', in: SOL'95 Workshop, Porto (Portugal), novembre 1995.

17

I. Alouini, ``Concurrent Garbage Collection for Concurrent Rewriting'', in: Proceedings 6th Conference on Rewriting Techniques and Applications, Kaiserslautern (Germany), J. Hsiang (réd.), Lecture Notes in Computer Science, 914, Springer-Verlag, p. 132--146, 1995.

18

N. Berregeb, A. Bouhoula, M. Rusinowitch, ``Extending SPIKE to associative and commutative theories'', in: Seminar on Automation of proof by induction, Dagstuhl seminar, Germany, juillet 1995.

19

P. Borovanský, ``Implementation of higher-order unification based on calculus of explicit substitutions'', in: Proceedings of SOFSEM'95, Lecture Notes in Computer Science, Springer-Verlag, 1995.

20

A. Bouhoula, M. Rusinowitch, ``SPIKE: a system for automatic inductive proofs'', in: Proceedings of the fourth International Conference on Algebraic Methodology and Software Technology Montreal (Canada), V. Alagar, M. Nivat (réd.), Lecture Notes in Computer Science, 936, Springer-Verlag, p. 576--577, July 1995.

21

E. Domenjoud, A. P. Tomás, ``From Elliott-MacMahon to an Algorithm for General Linear Constraints on Naturals'', in: Proceedings 1st International Conference on Principles and Practice of Constraint Programming, Cassis (France), U. Montanari, F. Rossi (réd.), Lecture Notes in Computer Science, 976, Springer-Verlag, p. 18--35, septembre 1995.

22

E. Domenjoud, ``Non redundant solutions of linear constraints on naturals'', in: SOL'95 Workshop, Porto (Portugal), novembre 1995.

23

G. Dowek, T. Hardin, C. Kirchner, ``Higher-order unification via explicit substitutions, Extended abstract'', in: Proceedings of LICS'95, D. Kozen (réd.), p. 366--374, San Diego, juin 1995.

24

C. Hintermeier, C. Kirchner, H. Kirchner, ``Sort Inheritance for Order-Sorted Equational Presentations'', in: Recent Trends in Data Types Specification, Lecture Notes in Computer Science, 906, Springer-Verlag, p. 319--335, 1995.

25

C. Hintermeier, H. Kirchner, P. D. Mosses, ``Combining Algebraic and Set-Theoretic Specifications'', in: Workshop on Abstract Data Types and COMPASS meeting, Soria Moria, Oslo, Norway, 1995. Submitted for publication in the proceedings.

26

C. Hintermeier, H. Kirchner, P. D. Mosses, ``- and -logics'', in: Second International Workshop on Higher-Order Algebra, Logic and Term Rewriting, Paderborn (Germany), septembre 1995.

27

C. Hintermeier, ``A Transformation of Canonical Conditional TRS's into Equivalent Canonical TRS's'', in: Proceedings 4th International Workshop on Conditional and Typed Term Rewriting Systems, Lecture Notes in Computer Science, 968, Springer-Verlag, p. 186--205, Jerusalem (Israel), 1995.

28

C. Kirchner, C. Lynch, C. Scharff, ``A Fine-grained Concurrent Completion Procedure'', in: CCL'95 Workshop, Rottach-Egern, septembre 1995.

29

H. Kirchner, P.-E. Moreau, ``Prototyping completion with constraints using computational systems'', in: Proceedings 6th Conference on Rewriting Techniques and Applications, Kaiserslautern (Germany), J. Hsiang (réd.), Lecture Notes in Computer Science, 914, Springer-Verlag, p. 438--443, 1995.

30

G. Kucherov, M. Rusinowitch, ``Complexity of testing ground reducibility for linear word rewriting systems with variables'', in: Proceedings 4th International Workshop on Conditional and Typed Term Rewriting Systems, Lecture Notes in Computer Science, 968, Springer-Verlag, p. 262--275, Jerusalem (Israel), 1995.

31

G. Kucherov, M. Rusinowitch, ``Matching a Set of Strings with Variable Length Don't Cares'', in: Proceedings of the 6th Symposium on Combinatorial Pattern Matching, E. Ukkonen (réd.), Lecture Notes in Computer Science, 937, Springer-Verlag, p. 230--247, Helsinki (Finland), juillet 1995.

32

D. Lugiez, ``Completeness and Compilation of Functional Definitions with Polymorphic Higher-Order Patterns'', in: Second International Workshop on Higher-Order Algebra, Logic and Term Rewriting, Paderborn (Germany), septembre 1995.

33

C. Lynch, ``Goal Directed Completion using SOUR Graphs'', in: CCL'95 Workshop, Rottach-Egern, septembre 1995.

34

C. Lynch, ``Paramodulation without Duplication'', in: Proceedings of LICS'95, D. Kozen (réd.), San Diego, juin 1995.

35

C. Ringeissen, ``Cooperation of decision procedures for the union of non-disjoint theories'', in: CCL'95 Workshop, Rottach-Egern, septembre 1995.

36

P. Strogova, ``Finding a Finite Group Presentation Using Rewriting'', in: Proceedings of the Workshop on symbolic rewriting techniques, M. Bronstein (réd.), p. 35-40, mai 1995.

37

L. Vigneron, ``Efficient Strategies for Automated Reasoning'', in: 2nd Workshop on Automated Reasoning: Bridging the Gap between Theory and Practice. AISB-95, Sheffield (England), A. Ireland (réd.), avril 1995.

38

L. Vigneron, ``Positive Deduction modulo Regular Theories'', in: Annual Conference of the European Association for Computer Science Logic, Paderborn (Germany), septembre 1995. Submitted for publication in the proceedings (18 pages).

39

A. Wasilewska, L. Vigneron, ``Rough Equality Algebras'', in: Joint Conference on Information Sciences. Workshop on Rough Set Theory (invited session), Wrightsville Beach (North Carolina), septembre 1995.

Rapports de recherche et publications internes

40

A. Bouhoula, M. Rusinowitch, SPIKE user manual, 1995.

41

A. Bouhoula, ``Fundamental Results on Automated Theorem Proving by Test Set Induction'', rapport de recherche n°2478, Institut National de Recherche en Informatique et Automatique, 1995.

42

R. Curien, Z. Qian, ``Efficiency for Second-Order Matching: Syntactical and AC case'', rapport de recherche n°95-R-101, Centre de Recherche en Informatique de Nancy, 1995.

43

G. Dowek, T. Hardin, C. Kirchner, ``Higher-order unification via explicit substitutions'', rapport de recherche n°2709, Institut National de Recherche en Informatique et Automatique, novembre 1995.

44

T. Genet, I. Gnaedig, ``Solving GPO ordering constraints with shared term data structure'', rapport de recherche, Centre de Recherche en Informatique de Nancy, 1995.

45

C. Kirchner, H. Kirchner, M. Vittek, ELAN user manual, 1995.

46

C. Lynch, P. Strogova, ``SOUR Graphs for Efficient Completion'', rapport de recherche n°95-R-343, Centre de Recherche en Informatique de Nancy, 1995.

47

E. Monfroy, M. Rusinowitch, R. Schott, ``Implementing Non-Linear Constraints with Cooperative Solvers'', rapport de recherche n°2747, Institut National de Recherche en Informatique et Automatique, novembre 1995, To appear in Proceedings of SAC'96.

48

C. Ringeissen, ``Cooperation of Decision Procedures for the Satisfiability problem'', rapport de recherche n°2753, Institut National de Recherche en Informatique et Automatique, novembre 1995.

Divers

49

I. Alouini, ``La réécriture conditionnelle concurrente: de l'étude à l'implantation'', Journées du GDR Programmation, novembre 1995.

50

N. Berregeb, ``Preuves par induction implicite dans les théories associatives et commutatives'', Journées du GDR Programmation, novembre 1995.

51

V. Bravo, ``Génération de schémas d'induction et de lemmes'', Rapport de DEA, septembre 1995, Université Henri Poincaré - Nancy 1.

52

C. Ringeissen, ``Satisfaisabilité de contraintes par combinaison de solveurs'', Journées du GDR Programmation, novembre 1995.

53

C. Scharff, ``Completion sans duplication concurrente'', Rapport de DEA, septembre 1995, Université Henri Poincaré - Nancy 1.

54

I. Yahmadi, ``SPIKELight: des stratégies de génération des schémas d'induction pour le démonstrateur SPIKE'', Rapport de Stage de Fin d'Etudes, 1995, Centre de Recherche en Informatique de Nancy.