Jean-Louis Lassez

According to our database, Jean-Louis Lassez authored at least 55 papers between 1973 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Solving Systems of Linear Inequalities.

Jean-Louis Lassez

CoRR, 2019

2008

Signature based intrusion detection using latent semantic analysis.

Jean-Louis Lassez, Ryan A. Rossi, Stephen J. Sheel, Srinivas Mukkamala

Proceedings of the International Joint Conference on Neural Networks, 2008

Ranking Links on the Web: Search and Surf Engines.

Jean-Louis Lassez, Ryan A. Rossi, Kumar Jeev

Proceedings of the New Frontiers in Applied Artificial Intelligence, 2008

2007

Client-side dynamic metadata in web 2.0.

John W. Stamey, Jean-Louis Lassez, Daniel Boorn, Ryan A. Rossi

Proceedings of the 25th Annual International Conference on Design of Communication, 2007

Le théorème de Perron Frobenius est-il vraiment nécessaire?

Jean-Louis Lassez

Proceedings of the 23èmes Journées Bases de Données Avancées, 2007

Crick's Hypothesis Revisited: The Existence of a Universal Coding Frame.

Jean-Louis Lassez, Ryan A. Rossi, Axel E. Bernal

Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA 2007), 2007

2006

Zoomed Clusters.

Jean-Louis Lassez, Tayfun Karadeniz, Srinivas Mukkamala

Proceedings of the Neural Information Processing, 13th International Conference, 2006

2005

Developing a pyramid structure for managing web-centric documents.

Tayfun Karadeniz, Jean-Louis Lassez, Stephen J. Sheel

Proceedings of the 23rd Annual International Conference on Design of Communication: documenting & Designing for Pervasive Information, 2005

2004

Symbolic Stochastic Systems.

Kumar Jeev, Jean-Louis Lassez

Proceedings of the International Conference on Modeling, 2004

2003

Similarity Based Classification.

Axel E. Bernal, Karen Hospevian, Tayfun Karadeniz, Jean-Louis Lassez

Proceedings of the Advances in Intelligent Data Analysis V, 2003

Qualitative Theorem Proving in Linear Constraints.

Vijay Chandru, Jean-Louis Lassez

Proceedings of the Verification: Theory and Practice, 2003

1999

Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data.

Alexander Brodsky, Catherine Lassez, Jean-Louis Lassez, Michael J. Maher

J. Autom. Reason., 1999

1992

A Canonical Form for Generalized Linear Constraints.

Jean-Louis Lassez, Ken McAloon

J. Symb. Comput., 1992

On Fourier's Algorithm for Linear Arithmetic Constraints.

Jean-Louis Lassez, Michael J. Maher

J. Autom. Reason., 1992

Practical Issues on the Projection of Polyhedral Sets.

Tien Huynh, Catherine Lassez, Jean-Louis Lassez

Ann. Math. Artif. Intell., 1992

1991

Practical tools for reasoning about linear constraints.

Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez

Fundam. Informaticae, 1991

Elimination of Negation in Term Algebras.

Jean-Louis Lassez, Michael J. Maher, Kim Marriott

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

From LP to LP: Programming with Constraints.

Jean-Louis Lassez

Proceedings of the Database Programming Languages: Bulk Types and Persistent Data. 3rd International Workshop, 1991

1990

Most Specific Logic Programs.

Kim Marriott, Lee Naish, Jean-Louis Lassez

Ann. Math. Artif. Intell., 1990

Querying Constraints.

Jean-Louis Lassez

Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1990

A Constraint Sequent Calculus

Jean-Louis Lassez, Ken McAloon

Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

Reasoning About Linear Constraints Using Parametric Queries.

Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

Parametric queries, linear constraints and variable elimination.

Jean-Louis Lassez

Proceedings of the Design and Implementation of Symbolic Computation Systems, 1990

Fourier Algorithm Revisited.

Tien Huynh, Catherine Lassez, Jean-Louis Lassez

Proceedings of the Algebraic and Logic Programming, 1990

1989

Independence of Negative Constraints.

Jean-Louis Lassez, Ken McAloon

Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

Simplification and Elimination of Redundant Linear Arithmetic Constraints.

Jean-Louis Lassez, Tien Huynh, Ken McAloon

Proceedings of the Logic Programming, 1989

1988

From Unification to Constraints.

Jean-Louis Lassez

Proceedings of the SPLT'88, 1988

Applications of a Canonical Form of Gerneralized Linear Constraints.

Jean-Louis Lassez, Ken McAloon

Proceedings of the International Conference on Fifth Generation Computer Systems, 1988

Unification Revisited

Jean-Louis Lassez, Michael J. Maher, Kim Marriott

Proceedings of the Foundations of Deductive Databases and Logic Programming, 1988

1987

Explicit Representation of Terms Defined by Counter Examples.

Jean-Louis Lassez, Kim Marriott

J. Autom. Reason., 1987

Constraint Logic Programming.

Joxan Jaffar, Jean-Louis Lassez

Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

From Unification to Constraints.

Joxan Jaffar, Jean-Louis Lassez

Proceedings of the Logic Programming '87, 1987

PROLOG - II as an instance of the logic programming language scheme.

Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher

Proceedings of the Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2/WG 2.2 Working Conference on Formal Description of Programming Concepts, 1987

1986

Maximal Unifiable Subsets and Minimal Nonunifiable Subsets.

T. Y. Chen, Jean-Louis Lassez, Graeme S. Port

New Gener. Comput., 1986

Comments on "General Failure of Logic Programs".

Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher

J. Log. Program., 1986

Invited Talk: Some Issues and Trends in the Semantics of Logic Programming.

Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher

Proceedings of the Third International Conference on Logic Programming, 1986

Unification Revisited.

Jean-Louis Lassez, Michael J. Maher, Kim Marriott

Proceedings of the Foundations of Logic and Functional Programming, 1986

Logic Programming Language Scheme.

Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher

Proceedings of the Logic Programming: Functions, Relations, and Equations, 1986

1985

Optimal Fixedpoints of Logic Programs.

Jean-Louis Lassez, Michael J. Maher

Theor. Comput. Sci., 1985

1984

Closures and Fairness in the Semantics of Programming Logic.

Jean-Louis Lassez, Michael J. Maher

Theor. Comput. Sci., 1984

A Theory of Complete Logic Programs with Equality.

Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher

J. Log. Program., 1984

A Unified Treatment of Resolution Strategies for Logic Programs.

David A. Wolfram, Michael J. Maher, Jean-Louis Lassez

Proceedings of the Second International Logic Programming Conference, 1984

1983

Completeness of the Negation as Failure Rule.

Joxan Jaffar, Jean-Louis Lassez, John W. Lloyd

Proceedings of the 8th International Joint Conference on Artificial Intelligence. Karlsruhe, 1983

The Denotational Semantics of Horn Clauses as a Production System.

Jean-Louis Lassez, Michael J. Maher

Proceedings of the National Conference on Artificial Intelligence, 1983

1982

Evaluating the effect of inter-programmer communication: levels on productivity by varying programming team structure.

John W. Bailey, Ken Christensen, Helmut Krcmar, Jean-Louis Lassez, Vincent Y. Shen, Scott N. Woodfield

ACM SIGSOFT Softw. Eng. Notes, 1982

Fixed Point Theorems and Semantics: A Folk Tale.

Jean-Louis Lassez, V. L. Nguyen, Liz Sonenberg

Inf. Process. Lett., 1982

Reasoning about Array Segments.

Joxan Jaffar, Jean-Louis Lassez

Proceedings of the 5th European Conference on Artificial Intelligence, 1982

1981

A Dual Problem to Least Fixed Points.

V. L. Nguyen, Jean-Louis Lassez

Theor. Comput. Sci., 1981

A critical examination of software science.

Jean-Louis Lassez, Dirk van der Knijff, John Shepherd, Catherine Lassez

J. Syst. Softw., 1981

1979

A Clarification of the Comparison Between Some Measures of Software Science.

Dirk van der Knijff, Jean-Louis Lassez

Inf. Process. Lett., 1979

Evaluation of length and level for simple program schemes.

Jean-Louis Lassez, Dirk van der Knijff

Proceedings of the IEEE Computer Society's Third International Computer Software and Applications Conference, 1979

1976

Circular codes and synchronization.

Jean-Louis Lassez

Int. J. Parallel Program., 1976

1975

A correspondence on strongly prefix codes (Corresp.).

Jean-Louis Lassez

IEEE Trans. Inf. Theory, 1975

Prefix codes, trees and automata.

Jean-Louis Lassez

Inf. Sci., 1975

1973

On the relationship between prefix-codes, trees, and automata.

Jean-Louis Lassez

PhD thesis, 1973