JEANLOUIS LASSEZ
classez@gilanet.com
ADDRESS: P.O. Box 407, Magdalena, New Mexico
878250407
PHONE: 505 854 2253 (home), 505 835 5396 (work)
PERSONAL:
Date of birth: December 24^{th}, 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

Professor of Computer Science, New Mexico Institute
of Technology

Visiting Professor, Department of Computer Science,
Brown University, summers 96 and 97
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, 19931996
Lecturer,
Senior
Lecturer,
Reader,
Department of Computer Science, University of Melbourne, Victoria, Australia
19761985
Professeur
Adjoint, Département de Mathématique et Informatique, Université
de Moncton, Canada 19741976
Research
Fellow and Assistant Professor, Department of Computer Science, Purdue
University, West Lafayette, Indiana, 19721973
Lecturer,
Département de Mathématiques, Université de Sherbrooke,
Canada 19701972
Lecturer,
Académie Commerciale Internationale, Paris, 19681970
PROFESSIONAL
ACTIVITIES:
Editor in Chief:

Journal of Logic Programming, Elsevier (19851990)
Area Editor:

Journal of the Association for Computing Machinery
(19911996)
Associate Editor:

Series in Logic Programming, AddisonWesley

Logic Programming, MIT Press.

Editorial Board: (past and present):

Journal of Symbolic Computation, Academic
Press

Journal of Future Generation Computer Systems,
North Holland

New Generation Computing, OhmshaSpringer

Annals of Mathematics and Artificial Intelligence,
Baltzer

Journal of Automated Reasoning, Kluwer

Constraints, Kluwer
Advisory Editor:

Principles and Practice of Constraint Programming,
95 MIT Press.
CONFERENCE ORGANIZATION:
Chair:

Organizing Committee, Principles and Practice
of Constraint Programming, Cassis 1996

Principles and applications of Constraints
Languages, Newport 1993 (jointly with P.Kanellakis and V. Saraswat)

AI and Math Conference, Fort Lauderdale 1992

Workshop on Theorem Proving with Constraints,
Saarbrucken, 1991

International Conference on Computer Science,
Hong Kong, 1988, (jointly with F. Chin).

Workshop on Constraints and Languages, Boston,
1988 (jointly with J. Cohen)

Workshop on Constraint Logic Programming Languages,
Rehovot, 1988

Fourth International Conference on Logic Programming,
Melbourne, 1988

Logic and Computation Conference Melbourne
1984 (jointly with J. Crossley)

Fifth Generation Languages Workshop, Melbourne,
1984
Program committee member:

AI and Math Conference, Fort Lauderdale, 1996

Joint International Symposium on Constraint
Logic Programming, Bonn, 1996

Theoretical Aspects of Computer Software,
Sendai, 1994

AI and Math Conference, Fort Lauderdale, FL,
1994

Deductive and ObjectOriented Databases, Phoenix,
AZ, 1993

Logic Programming and Automated Reasoning,
Saint Petersburg 1993

Conference on Automated Deduction, Saratoga
Springs, 1992

Artificial Intelligence and Symbolic Computation,
Kaiserslautern, 1992

Logic in Computer Science, Santa Cruz, CA
1992

LFCS 92, Logic at Tver, Russia, 1992

ACM Principles of Database Systems, 1991

International Workshop on Processing Declarative
Knowledge, Karlsruhe, 1991

Theoretical Aspects of Computer Software,
Sendai, 1991

Workshop on NonStandard Queries, Toulouse,
1991

Conference on Automated Deduction, Kaiserslautern,
1990

AI and Math Conference, Fort Lauderdale, 1990

7^{th} International Conference in
Logic Programming, Seattle, WA, 1990

6^{th} International Conference in
Logic Programming, Lisbon, Portugal, 1989

Theory and Practice of Software, Barcelona,
1989

Conference on Automated Deduction, 1989

Logic in Computer Science, Philadelphia, 1988

5^{th} International Conference in
Logic Programming, Cleveland, OH, 1988

Fifth Generation Computer Systems, Tokyo,
1988

4^{th} International Conference in
Logic Programming, Melbourne, Australia, 1987

4^{th} International Symposium in
Logic Programming, Boston, MA, 1987

3^{rd} International Conference in
Logic Programming, London, UK, 1986
ADDITIONAL ACTIVITIES:

Invited participant, Strategic Directions
in Computer Science, MIT, July 1996 on the 50^{th} anniversary
of the foundation of the Association for Computing Machinery.

Member of a panel of 15 international experts
asked to evaluate the mission of France’s National Research Institute for
Computer Science, INRIA, Sept 1994

Review Panel member, Evaluation of Research
Directions, U.S. Office of Naval Research, Washington, D.C., February 1992

Chairman, Session on Functional Programming,
Logic Programming and ObjectOriented Programming, in "Critical Research
directions in Programming Languages", U.S. Office of Naval Research, Miami
1988

Member, Advisory Board, Foundations of Software
Technology and Theoretical Computer Science.

Chair, Organizing Committee for Principles
and Practice of Constraints Programming

Nominator, Kyoto Prize, 1988, 1996

Advisor to the Australian Minister for Science
and Technology, 19841985.

Onemonth mission in Tokyo to evaluate the
potential for a joint AustralianJapanese venture in the software industry.
MAIN INVITED PRESENTATIONS:
International Meetings:

Workshop on Constraints, Principles of Database
Systems, Seattle, 1998

AI and Math, Fort Lauderdale,FL, 1996

Portuguese Artificial Intelligence Conference,
1996

Second Asian Computer Science Conference,
Bangkok, 1995

Logic at Tver, 1992

Theoretical Aspects of Computer Software,
Sendai, 1991

Conference of the American Association for
Artificial Intelligence, Anaheim, 1991

Third International Workshop on Database Programming
languages, Napflion, 1991

AAAI Symposium on Principles of Hybrid Systems,
Asilomar, 1991

Mathematical Foundations of Computer Science
, Poland, 1991

Foundations of Software Technology and Theoretical
Computer Science, Bangalore, 1990

Algebraic and Logic Programming Conference,
Nancy, 1990

ACM Principles of Database Systems, Nashville,
1990

TAPSOFT, Barcelona, 1989

USJapan Logic Programming Conference, Argonne,
1989

Colloque sur la Programmation Logique, Trégastel
1988

Conference of the Italian Association for
Logic Programming, Rome, 1988

U.S.Japan Logic Conference, Hawaii, 1987

Logic Programming Conference, Tokyo, 1987

Third International Conference on Logic Programming,
London,UK, 1986
Intensive short courses at international
meetings:

School on Alternatives of Logic Programming,
Kuopio, 1989, sponsored by the Finnish Academy of Sciences, year Nevanlinna.

International Summer School on New Directions
in Program Construction Methods, European Association for Theoretical Computer
Science, Orivesi, Finland 1988

Advanced School on the Foundations of Logic
Programming, Alghero, Sicily 1988

Tutorial on Logic programming, Principles
of Programming Languages, Munich 1987

Foundations of Logic and Functional Programming,
Trento, 1986
Due to time constraints, a number
of invitations as banquet speaker had to be declined, however the following
was accepted:

Sixth International Conference on Logic Programming,
Lisbon, 1989
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:

Joskowicz, L., Lassez, JL., and Hoffman, F., Editors,
Artificial
Intelligence III: Annals of Mathematics and Artificial
Intelligence,
Baltzer Publishers, Basel, 1994.

Kirchner, H., Lassez, JL., Editors, Theorem Proving
and Logic
Programming: Annals of Mathematics and Artificial
Intelligence, Baltzer Publishers, Basel, 1993.

Lassez, JL., Plotkin, G., Editors, Computational
Logic: Essays in
Honor of Alan Robinson, MIT Press, 1991.

Chen, T. Y., Foo, N., and Lassez, JL., Special Issue
on the Hong Kong International Computer Conference: Annals of Mathematics
and Artificial Intelligence, Baltzer Publishers, Basel, 1991.

Furukawa, K., Mizoguchi, F., and Lassez, JL., Constraint
Logic Programming [in Japanese], OHMSHA Publishers, Tokyo, 1989.

Lassez, JL., Editor, Logic Programming: Proceedings
of the Fourth
International Conference on Logic Programming,
MIT Press, 1987.
Research papers:

Brodsky, A., Lassez, C., Lassez, JL., Maher, M., "Separability
of Polyhedra for Optimal Filtering of Spatial and Constraint Data," to
appear in Journal of Automated Reasoning, Kluwer, 1999.

van Hentenryck, P., et. al., "Strategic Directions
in Constraint Programming," Computing Reviews, vol. 28, no. 4, December
1996.

Lassez, JL., Prabhu, N., "A Condition of the Number
of Pivots Necessary to Solve a Linear Program," OPSEARCH, 1996.

Brodsky, A., Lassez, C., Lassez, JL., Maher, M., "Separability
of Polyhedra for Optimal Filtering of Spatial and Constraint Data [preliminary
version]," Proceedings of the ACM PODS Conference, 1995.

Lassez C., Lassez JL., "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

Lassez, JL., McAloon, K., "A Canonical Form for Generalized
Linear Constraints," Journal of Symbolic Computation, January 1992.

Huynh, T., Lassez, C., Lassez, JL., "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.
295316, J. C. Baltzer AG, 1992.

Lassez, JL., Maher, M., "On Fourier's Algorithm for
Linear Constraints," vol. 9, Journal of Automated Reasoning, 1992.

Huynh, T., Joskowicz, L., Lassez, C., Lassez, JL.,
"Practical Tools to Reason about Linear Constraints," Fundamenta Informaticae,
vol. 15, no. 34, December 1991.

Lassez, JL., 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, SpringerVerlag, 1991.

Lassez, JL., "From LP to LP: Programming with Constraints,"
Proceedings
of Theoretical Aspects of Computer Software, Sendai,

Springer Verlag, 1991. Also in Database Programming
Languages, P. Kanellakis and J.W. Schmidt Ed., MorganKaufmann, 1991.

Huynh, T., Joskowicz, L., Lassez, C., Lassez, JL.,
"Reasoning About Linear Constraints Using Parametric Queries," Proceedings
of the Conference on Foundations of Software Technology and Theoretical
Computer Sciences, Bangalore, SpringerVerlag, 1990.

Huynh, T., Lassez, C., Lassez, JL., "Fourier Algorithm
Revisited," Proceedings of the Second International Conference on Algebraic
and Logic Programming, Nancy, SpringerVerlag, 1990.

Lassez, JL., "Querying Constraints," Proceedings
of the ACM Conference on Principles of Database Systems, Nashville,
1990.

Lassez, JL., McAloon, K., "A Constraint Sequent Calculus,"
Proceedings
of the IEEE Conference on Logic in Computer Science, Philadelphia,
1990.

Lassez, JL., "Parametric Queries, Linear Constraints,
and Variable Elimination," Proceedings of the Conference on Design and
Implementation of Symbolic Computation Systems, Capri, 1990.

Marriott, K., Naish, L., Lassez, JL., "MostSpecific
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.

Lassez, JL., Huynh, T., McAloon, K., "Simplification
and Elimination of Redundant Linear Arithmetic Constraints," Proceedings
of the North American Conference on Logic Programming, MIT Press, 1989.

Lassez, JL., McAloon, K., "Independence of Negative
Constraints," Proceedings of the Advanced Seminar on Foundations of
Innovative Software Development, Barcelona, SpringerVerlag, 1989.

Lassez, JL., McAloon, K., "Applications of a Canonical
Form for Generalized Linear Constraints," Proceedings of the International
Conference on Fifth Generation Computer Systems, Tokyo, 1988.

Lassez, JL., Maher, M., Marriott, K., "Unification
Revisited," Foundations of Deductive Databases and Logic Programming,
J. Minker Ed., MorganKauffman, pp. 587625, 1988.

Lassez, JL., 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, SpringerVerlag, 1986. Full paper in Journal of Automated
Reasoning, vol. 3, pp.301317, September 1987.

Jaffar, J., Lassez, JL., Maher, M., "Prolog II as an
Instance of the Logic Programming Language Scheme," in Formal Description
of Programming Concepts III, M. Wirsing Ed., NorthHolland, August
1987.

Jaffar, J., Lassez, JL., "From Unification to Constraints,"
Logic Programming Conference, Tokyo, in Lecture Notes in Computer Science,
SpringerVerlag, June 1987.

Jaffar, J., Lassez, JL., "Constraint Logic Programming,"
Proceedings
of Principles of Programming Languages, Munich, pp.111119, 1987.

Jaffar, J., Lassez, JL., Maher, M., "Comments on General
Failure of Logic Programs," Journal of Logic Programming, Vol. 3,
Number 2, pp.115118, NorthHolland, 1986.

Chen, T. Y., Lassez, JL., Port, G. S., "Maximal Unifiable
Subsets and Minimal NonUnifiable Subsets," New Generation Computing,
4(2), pp.131152, 1986.

Jaffar, J., Lassez, JL., 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,
SpringerVerlag, 1986.

Jaffar, J., Lassez, JL., Maher, M., "A Logic Programming
Language Scheme," in Logic Programming: Relations, Functions and Equations,
D. DeGroot and G. Lindstrom Ed., PrenticeHall, 1986.

Lassez, JL., Maher, M., "Optimal Fixed Points of Logic
Programs," Third International Conference on Foundations of Software
Technology and Theoretical Computer Science, Bangalore, pp.343362,
1983. Also in Theoretical Computer Science (39), pp. 1525, NorthHolland,
1985.

Lassez, JL., Maher, M. J., "Closures and Fairness in
the Semantics of Programming Logic," Theoretical Computer Science,
29:167184, NorthHolland, 1984.

Wolfram, D., Maher, M. J., Lassez, JL., "A Unified
Treatment of Resolution Strategies for Logic Programs," Proceedings
of Second

International Logic Programming Conference, pp.263276,
Uppsala, July 1984.

Jaffar, J., Lassez, JL., Maher, M. J., "A Theory of
Complete Logic Programs with Equality," International Conference on
Fifth Generation Computer Systems, pp. 175184, Tokyo, 1984. Also in
Journal of Logic Programming, vol. 3, pp. 211223, NorthHolland,
1984.

Jaffar, J., Lassez, JL., Lloyd, J., "Completeness of
the Negation as Failure Rule," Proceedings of the International Joint
Conference on Artificial Intelligence, pp.500506, Karlsruhe, 1983.
[This paper came second in the competition for best submission. (Awarded
Honorable Mention).]

Lassez, JL., 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. 229231, 1983. [This paper was nominated
for Publisher's Prize.]

Jaffar, J., Lassez, JL., "Reasoning about Array Segments,"
Proceedings
of the European Conference on Artificial Intelligence, Paris, pp. 6266,
1982.

Lassez, JL., Nguyen, V. L., Sonenberg, E. A., "Fixed
Point Theorems and Semantics: A Folk Tale," Information Processing Letters,
vol.14, no.3, pp. 112116, NorthHolland, 1982.

Nguyen, V. L., Lassez, JL., "A Dual Problem to Least
Fixed Points," Theoretical Computer Science, vol. 16, pp. 211221,
NorthHolland, 1981.

Lassez, JL., van der Knijff, D., Shepard, J., Lassez,
C., "A Critical Examination of Software Science," Journal of Systems
and Software, vol. 2, pp.105112, Elsevier, 1981.

Haebich,, W., Lassez, JL., "Minimization of Multiple
Entry Finite Automata," Combinatorial Mathematics VIII: SpringerVerlag
Lecture Notes in Mathematics, no. 884, pp.203210, 1981.

Lassez, JL., Nguyen, V.L., "Implicit Recursive Definitions,"
Proceedings
4th Australian Computer Conference, Brisbane, pp.126131, 1981.

Lassez, JL., 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.
205215, 1980.

Lassez, JL., 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.
695701, 1979.

van der Knijff, D., Lassez, JL., "A Clarification on
the Comparisons Between Some Measures of Software Science," Information
Processing Letters, vol. 8, no. 5, pp. 241243, NorthHolland, 1979.

Lassez, JL., Shyr, H. J., "Factorizations in the Monoid
of Languages," Combinatorial Mathematics: SpringerVerlag Lecture Notes,
no. 686, D. A. Holton and J. S. Seberry Ed., pp. 199205, 1978.

Lassez, JL., Shyr, H. J., "Prefix Properties and Equations
on the Monoid Languages," Tamkang Journal of Mathematics, vol. 9,
no. 21, pp. 514, 1978.

Lassez, JL., "Circular Codes and Synchronization,"
International
Journal of Computer and Information Sciences, vol. 5, no. 2, pp. 201208,
Plenum Pub., 1976.

Lassez, JL., "Prefix Codes, Trees and Automata," Information
Sciences, vol. 8, pp. 155171, American Elsevier, 1975.

Lassez, JL., "A Correspondence on Strongly Prefix Codes,"
IEEE
Transactions on Information Theory, pp. 344345, 1975.

Lassez, JL., "Chaines et Codes Conjuges," Utilitas
Mathematica, pp. 311324, 1975.

Lassez, JL., "Prefix Codes and Isomorphic Automata,"
International
Journal of Computer Mathematics, vol. 3, pp. 304314, Gordon and Breach,
1973.

Lassez, JL., "On the Structure of Systematic Prefix
Codes," International Journal of Computer Mathematics, vol. 3, pp.
177188, Gordon and Breach, 1972.
REFERENCES:
Contact information for references will
be readily supplied upon request.
Top