JEAN-LOUIS LASSEZ

classez@gilanet.com
 
 

ADDRESS: P.O. Box 407, Magdalena, New Mexico 87825-0407
PHONE: 505 854 2253 (home), 505 835 5396 (work)


PERSONAL:

    Date of birth: December 24th, 1944
    Place of birth: Bordeaux, France
    Nationality: US citizen
    Marital status: Married, Catherine Marcoussis, 12/2/68
    Children: One daughter, Sarah Suzanne


EDUCATION:

    Ph.D., Computer Science, 1973, Purdue University.
    D.E.A., Computer Science 1969, Université de Paris, France.
    M.Sc., Mathematics, 1968, Université de Paris, France.


PRESENT POSITION: 1996-


PREVIOUS POSITIONS:

        Researcher,
        Manager,
        Senior Manager, New Language Paradigms,
        Software Technology Department, I.B.M., T.J.Watson Research Center, 1985- 1996
        Also Adjunct Professor, New York University, 1993-1996         Lecturer,
        Senior Lecturer,
        Reader, Department of Computer Science, University of Melbourne, Victoria, Australia 1976-1985
        Professeur Adjoint, Département de Mathématique et Informatique, Université de Moncton, Canada 1974-1976
        Research Fellow and Assistant Professor, Department of Computer Science, Purdue University, West Lafayette, Indiana, 1972-1973
        Lecturer, Département de Mathématiques, Université de Sherbrooke, Canada 1970-1972
        Lecturer, Académie Commerciale Internationale, Paris, 1968-1970


PROFESSIONAL ACTIVITIES:

Editor in Chief:
 


Area Editor:
 


Associate Editor:
 


Advisory Editor:
 


CONFERENCE ORGANIZATION:

Chair:
 


Program committee member:
 


ADDITIONAL ACTIVITIES:
 


MAIN INVITED PRESENTATIONS:

International Meetings:
 


Intensive short courses at international meetings:
 


Due to time constraints, a number of invitations as banquet speaker had to be declined, however the following was accepted:
 


PUBLICATIONS:

The research reflected in the following list of publications has been
supported by the National Science Foundation (USA), the U.S. Office of Naval Research, the National Research Council (Canada), the Canadian Mathematical Congress, the National Research Council (Italy), the Australian Computer Research Grants Scheme, the Australian Ministry for Science and Technology,
various Universities and the IBM Corporation.

Edited volumes:

      1. Joskowicz, L., Lassez, J-L., and Hoffman, F., Editors, Artificial

      2. Intelligence III: Annals of Mathematics and Artificial Intelligence,
        Baltzer Publishers, Basel, 1994.
      3. Kirchner, H., Lassez, J-L., Editors, Theorem Proving and Logic

      4. Programming: Annals of Mathematics and Artificial Intelligence, Baltzer Publishers, Basel, 1993.
      5. Lassez, J-L., Plotkin, G., Editors, Computational Logic: Essays in

      6. Honor of Alan Robinson, MIT Press, 1991.
      7. Chen, T. Y., Foo, N., and Lassez, J-L., Special Issue on the Hong Kong International Computer Conference: Annals of Mathematics and Artificial Intelligence, Baltzer Publishers, Basel, 1991.
      8. Furukawa, K., Mizoguchi, F., and Lassez, J-L., Constraint Logic Programming [in Japanese], OHMSHA Publishers, Tokyo, 1989.
      9. Lassez, J-L., Editor, Logic Programming: Proceedings of the Fourth

      10. International Conference on Logic Programming, MIT Press, 1987.
Research papers:
      1. Brodsky, A., Lassez, C., Lassez, J-L., Maher, M., "Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data," to appear in Journal of Automated Reasoning, Kluwer, 1999.
      2. van Hentenryck, P., et. al., "Strategic Directions in Constraint Programming," Computing Reviews, vol. 28, no. 4, December 1996.
      3. Lassez, J-L., Prabhu, N., "A Condition of the Number of Pivots Necessary to Solve a Linear Program," OPSEARCH, 1996.
      4. Brodsky, A., Lassez, C., Lassez, J-L., Maher, M., "Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data [preliminary version]," Proceedings of the ACM PODS Conference, 1995.
      5. Lassez C., Lassez J-L., "Quantifier Elimination for Conjunctions of Linear Constraints via a Convex Hull Algorithm," Symbolic and Numerical Computation for Artificial Intelligence, Donald, Kapur, and Mundy Ed., Academic Press, 1993
      6. Lassez, J-L., McAloon, K., "A Canonical Form for Generalized Linear Constraints," Journal of Symbolic Computation, January 1992.
      7. Huynh, T., Lassez, C., Lassez, J-L., "Practical Issues in the Projection of Polyhedral Sets," Annals of Mathematics and Artificial Intelligence, vol. 6, no. 4, M. C. Golumbic and F. Hoffman Ed., pp. 295-316, J. C. Baltzer AG, 1992.
      8. Lassez, J-L., Maher, M., "On Fourier's Algorithm for Linear Constraints," vol. 9, Journal of Automated Reasoning, 1992.
      9. Huynh, T., Joskowicz, L., Lassez, C., Lassez, J-L., "Practical Tools to Reason about Linear Constraints," Fundamenta Informaticae, vol. 15, no. 3-4, December 1991.
      10. Lassez, J-L., Maher, M., Marriott, K., "Elimination of Negation in Term Algebras," Proceedings of the Conference on Mathematical Foundations of Computer Science, Kazimierz Dolny, Lecture Notes in Computer Science, Springer-Verlag, 1991.
      11. Lassez, J-L., "From LP to LP: Programming with Constraints," Proceedings of Theoretical Aspects of Computer Software, Sendai,
      12. Springer Verlag, 1991. Also in Database Programming Languages, P. Kanellakis and J.W. Schmidt Ed., Morgan-Kaufmann, 1991.
      13. Huynh, T., Joskowicz, L., Lassez, C., Lassez, J-L., "Reasoning About Linear Constraints Using Parametric Queries," Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Sciences, Bangalore, Springer-Verlag, 1990.
      14. Huynh, T., Lassez, C., Lassez, J-L., "Fourier Algorithm Revisited," Proceedings of the Second International Conference on Algebraic and Logic Programming, Nancy, Springer-Verlag, 1990.
      15. Lassez, J-L., "Querying Constraints," Proceedings of the ACM Conference on Principles of Database Systems, Nashville, 1990.
      16. Lassez, J-L., McAloon, K., "A Constraint Sequent Calculus," Proceedings of the IEEE Conference on Logic in Computer Science, Philadelphia, 1990.
      17. Lassez, J-L., "Parametric Queries, Linear Constraints, and Variable Elimination," Proceedings of the Conference on Design and Implementation of Symbolic Computation Systems, Capri, 1990.
      18. Marriott, K., Naish, L., Lassez, J-L., "Most-Specific Logic Programs," Proceedings of the Fifth International Logic Programming Conference, MIT Press, 1988. Full paper in Horn Logic, Search and Satisfiability: Annals of Mathematics and Artificial Intelligence, Baltzer Publisher, 1990.
      19. Lassez, J-L., Huynh, T., McAloon, K., "Simplification and Elimination of Redundant Linear Arithmetic Constraints," Proceedings of the North American Conference on Logic Programming, MIT Press, 1989.
      20. Lassez, J-L., McAloon, K., "Independence of Negative Constraints," Proceedings of the Advanced Seminar on Foundations of Innovative Software Development, Barcelona, Springer-Verlag, 1989.
      21. Lassez, J-L., McAloon, K., "Applications of a Canonical Form for Generalized Linear Constraints," Proceedings of the International Conference on Fifth Generation Computer Systems, Tokyo, 1988.
      22. Lassez, J-L., Maher, M., Marriott, K., "Unification Revisited," Foundations of Deductive Databases and Logic Programming, J. Minker Ed., Morgan-Kauffman, pp. 587-625, 1988.
      23. Lassez, J-L., Marriott, K., "Explicit Representations of Terms Defined by Counter Examples," Foundations of Software Technology and Theoretical Computer Science, New Delhi, in Lecture Notes in Computer Science, Springer-Verlag, 1986. Full paper in Journal of Automated Reasoning, vol. 3, pp.301-317, September 1987.
      24. Jaffar, J., Lassez, J-L., Maher, M., "Prolog II as an Instance of the Logic Programming Language Scheme," in Formal Description of Programming Concepts III, M. Wirsing Ed., North-Holland, August 1987.
      25. Jaffar, J., Lassez, J-L., "From Unification to Constraints," Logic Programming Conference, Tokyo, in Lecture Notes in Computer Science, Springer-Verlag, June 1987.
      26. Jaffar, J., Lassez, J-L., "Constraint Logic Programming," Proceedings of Principles of Programming Languages, Munich, pp.111-119, 1987.
      27. Jaffar, J., Lassez, J-L., Maher, M., "Comments on General Failure of Logic Programs," Journal of Logic Programming, Vol. 3, Number 2, pp.115-118, North-Holland, 1986.
      28. Chen, T. Y., Lassez, J-L., Port, G. S., "Maximal Unifiable Subsets and Minimal Non-Unifiable Subsets," New Generation Computing, 4(2), pp.131-152, 1986.
      29. Jaffar, J., Lassez, J-L., Maher, M., "Some Issues and Trends in the Semantics of Logic Programming," Third International Conference of Logic Programming, London, in Lecture Notes in Computer Science 225, Springer-Verlag, 1986.
      30. Jaffar, J., Lassez, J-L., Maher, M., "A Logic Programming Language Scheme," in Logic Programming: Relations, Functions and Equations, D. DeGroot and G. Lindstrom Ed., Prentice-Hall, 1986.
      31. Lassez, J-L., Maher, M., "Optimal Fixed Points of Logic Programs," Third International Conference on Foundations of Software Technology and Theoretical Computer Science, Bangalore, pp.343-362, 1983. Also in Theoretical Computer Science (39), pp. 15-25, North-Holland, 1985.
      32. Lassez, J-L., Maher, M. J., "Closures and Fairness in the Semantics of Programming Logic," Theoretical Computer Science, 29:167-184, North-Holland, 1984.
      33. Wolfram, D., Maher, M. J., Lassez, J-L., "A Unified Treatment of Resolution Strategies for Logic Programs," Proceedings of Second
      34. International Logic Programming Conference, pp.263-276, Uppsala, July 1984.
      35. Jaffar, J., Lassez, J-L., Maher, M. J., "A Theory of Complete Logic Programs with Equality," International Conference on Fifth Generation Computer Systems, pp. 175-184, Tokyo, 1984. Also in Journal of Logic Programming, vol. 3, pp. 211-223, North-Holland, 1984.
      36. Jaffar, J., Lassez, J-L., Lloyd, J., "Completeness of the Negation as Failure Rule," Proceedings of the International Joint Conference on Artificial Intelligence, pp.500-506, Karlsruhe, 1983. [This paper came second in the competition for best submission. (Awarded Honorable Mention).]
      37. Lassez, J-L., Maher, M. J., "Denotational Semantics of Horn Clauses as a Production System," Proceedings of the National Conference on Artificial Intelligence, Washington, American Association for Artificial Intelligence, pp. 229-231, 1983. [This paper was nominated for Publisher's Prize.]
      38. Jaffar, J., Lassez, J-L., "Reasoning about Array Segments," Proceedings of the European Conference on Artificial Intelligence, Paris, pp. 62-66, 1982.
      39. Lassez, J-L., Nguyen, V. L., Sonenberg, E. A., "Fixed Point Theorems and Semantics: A Folk Tale," Information Processing Letters, vol.14, no.3, pp. 112-116, North-Holland, 1982.
      40. Nguyen, V. L., Lassez, J-L., "A Dual Problem to Least Fixed Points," Theoretical Computer Science, vol. 16, pp. 211-221, North-Holland, 1981.
      41. Lassez, J-L., van der Knijff, D., Shepard, J., Lassez, C., "A Critical Examination of Software Science," Journal of Systems and Software, vol. 2, pp.105-112, Elsevier, 1981.
      42. Haebich,, W., Lassez, J-L., "Minimization of Multiple Entry Finite Automata," Combinatorial Mathematics VIII: Springer-Verlag Lecture Notes in Mathematics, no. 884, pp.203-210, 1981.
      43. Lassez, J-L., Nguyen, V.L., "Implicit Recursive Definitions," Proceedings 4th Australian Computer Conference, Brisbane, pp.126-131, 1981.
      44. Lassez, J-L., Shepard, J., "Opposing Views on the Use of Software Science Measures for the Automatic Assessment of Student Programs," Proceedings of the Third Australian Computer Science Conference, Canberra, pp. 205-215, 1980.
      45. Lassez, J-L., van der Knijff, D., "Evaluation of Length and Level for Simple Program Schemes," Proceedings of the Third International Conference on Computer Software and its Applications, Chicago, pp. 695-701, 1979.
      46. van der Knijff, D., Lassez, J-L., "A Clarification on the Comparisons Between Some Measures of Software Science," Information Processing Letters, vol. 8, no. 5, pp. 241-243, North-Holland, 1979.
      47. Lassez, J-L., Shyr, H. J., "Factorizations in the Monoid of Languages," Combinatorial Mathematics: Springer-Verlag Lecture Notes, no. 686, D. A. Holton and J. S. Seberry Ed., pp. 199-205, 1978.
      48. Lassez, J-L., Shyr, H. J., "Prefix Properties and Equations on the Monoid Languages," Tamkang Journal of Mathematics, vol. 9, no. 21, pp. 5-14, 1978.
      49. Lassez, J-L., "Circular Codes and Synchronization," International Journal of Computer and Information Sciences, vol. 5, no. 2, pp. 201-208, Plenum Pub., 1976.
      50. Lassez, J-L., "Prefix Codes, Trees and Automata," Information Sciences, vol. 8, pp. 155-171, American Elsevier, 1975.
      51. Lassez, J-L., "A Correspondence on Strongly Prefix Codes," IEEE Transactions on Information Theory, pp. 344-345, 1975.
      52. Lassez, J-L., "Chaines et Codes Conjuges," Utilitas Mathematica, pp. 311-324, 1975.
      53. Lassez, J-L., "Prefix Codes and Isomorphic Automata," International Journal of Computer Mathematics, vol. 3, pp. 304-314, Gordon and Breach, 1973.
      54. Lassez, J-L., "On the Structure of Systematic Prefix Codes," International Journal of Computer Mathematics, vol. 3, pp. 177-188, Gordon and Breach, 1972.

REFERENCES:

Contact information for references will be readily supplied upon request.


Top