Jean-Louis Lassez

Publication Activity (10 Years)

Years Active: 1975-2019
Publications (10 Years): 1

Top Topics

Complex Systems

Linear Inequalities

Feature Extraction

Top Venues

Publications

Jean-Louis Lassez
Solving Systems of Linear Inequalities. CoRR (2019)
Jean-Louis Lassez, Ryan A. Rossi, Stephen J. Sheel, Srinivas Mukkamala
Signature based intrusion detection using latent semantic analysis. IJCNN (2008)
Jean-Louis Lassez, Ryan A. Rossi, Kumar Jeev
Ranking Links on the Web: Search and Surf Engines. IEA/AIE (2008)
Jean-Louis Lassez
Le théorème de Perron Frobenius est-il vraiment nécessaire? BDA (2007)
Jean-Louis Lassez, Ryan A. Rossi, Axel E. Bernal
Crick's Hypothesis Revisited: The Existence of a Universal Coding Frame. AINA Workshops (1) (2007)
John W. Stamey, Jean-Louis Lassez, Daniel Boorn, Ryan A. Rossi
Client-side dynamic metadata in web 2.0. SIGDOC (2007)
Jean-Louis Lassez, Tayfun Karadeniz, Srinivas Mukkamala
Zoomed Clusters. ICONIP (2) (2006)
Tayfun Karadeniz, Jean-Louis Lassez, Stephen J. Sheel
Developing a pyramid structure for managing web-centric documents. SIGDOC (2005)
Kumar Jeev, Jean-Louis Lassez
Symbolic Stochastic Systems. MSV/AMCS (2004)
Vijay Chandru, Jean-Louis Lassez
Qualitative Theorem Proving in Linear Constraints. Verification: Theory and Practice (2003)
Axel E. Bernal, Karen Hospevian, Tayfun Karadeniz, Jean-Louis Lassez
Similarity Based Classification. IDA (2003)
Alexander Brodsky, Catherine Lassez, Jean-Louis Lassez, Michael J. Maher
Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. J. Autom. Reason. 23 (1) (1999)
Alexander Brodsky, Catherine Lassez, Jean-Louis Lassez, Michael J. Maher
Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. PODS (1995)
Jean-Louis Lassez, Ken McAloon
A Canonical Form for Generalized Linear Constraints. J. Symb. Comput. 13 (1) (1992)
Tien Huynh, Catherine Lassez, Jean-Louis Lassez
Practical Issues on the Projection of Polyhedral Sets. Ann. Math. Artif. Intell. 6 (4) (1992)
Jean-Louis Lassez, Michael J. Maher
On Fourier's Algorithm for Linear Arithmetic Constraints. J. Autom. Reason. 9 (3) (1992)
Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez
Practical tools for reasoning about linear constraints. Fundam. Informaticae 15 (3-4) (1991)
Jean-Louis Lassez
From LP to LP: Programming with Constraints. DBPL (1991)
Jean-Louis Lassez, Tien Huynh, Ken McAloon
Simplification and Elimination of Redundant Linear Arithmetic Constraints. WCLP (1991)
Jean-Louis Lassez, Ken McAloon
A Constraint Sequent Calculus. WCLP (1991)
Jean-Louis Lassez, Michael J. Maher, Kim Marriott
Elimination of Negation in Term Algebras. MFCS (1991)
Jean-Louis Lassez
From LP to LP: Programming with Constraints. TACS (1991)
Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez
Reasoning About Linear Constraints Using Parametric Queries. FSTTCS (1990)
Jean-Louis Lassez
Querying Constraints. PODS (1990)
Jean-Louis Lassez
Parametric queries, linear constraints and variable elimination. DISCO (1990)
Tien Huynh, Catherine Lassez, Jean-Louis Lassez
Fourier Algorithm Revisited. ALP (1990)
Jean-Louis Lassez, Ken McAloon
A Constraint Sequent Calculus LICS (1990)
Kim Marriott, Lee Naish, Jean-Louis Lassez
Most Specific Logic Programs. Ann. Math. Artif. Intell. 1 (1990)
Jean-Louis Lassez, Tien Huynh, Ken McAloon
Simplification and Elimination of Redundant Linear Arithmetic Constraints. NACLP (1989)
Jean-Louis Lassez, Ken McAloon
Independence of Negative Constraints. TAPSOFT, Vol.1 (1989)
Jean-Louis Lassez
From Unification to Constraints. SPLT (1988)
Jean-Louis Lassez, Ken McAloon
Applications of a Canonical Form of Gerneralized Linear Constraints. FGCS (1988)
Kim Marriott, Lee Naish, Jean-Louis Lassez
Most Specific Logic Programs. ICLP/SLP (1988)
Joxan Jaffar, Jean-Louis Lassez
Constraint Logic Programming. POPL (1987)
Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher
PROLOG - II as an instance of the logic programming language scheme. Formal Description of Programming Concepts (1987)
Joxan Jaffar, Jean-Louis Lassez
From Unification to Constraints. LP (1987)
Jean-Louis Lassez, Kim Marriott
Explicit Representation of Terms Defined by Counter Examples. J. Autom. Reason. 3 (3) (1987)
Jean-Louis Lassez, Kim Marriott
Explicit Representation of Terms Defined by Counter Examples. FSTTCS (1986)
Jean-Louis Lassez, Michael J. Maher, Kim Marriott
Unification Revisited. Foundations of Logic and Functional Programming (1986)
Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher
Comments on "General Failure of Logic Programs". J. Log. Program. 3 (2) (1986)
T. Y. Chen, Jean-Louis Lassez, Graeme S. Port
Maximal Unifiable Subsets and Minimal Nonunifiable Subsets. New Gener. Comput. 4 (2) (1986)
Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher
Invited Talk: Some Issues and Trends in the Semantics of Logic Programming. ICLP (1986)
Jean-Louis Lassez, Michael J. Maher
Optimal Fixedpoints of Logic Programs. Theor. Comput. Sci. 39 (1985)
Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher
A Theory of Complete Logic Programs with Equality. J. Log. Program. 1 (3) (1984)
Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher
A Theory of Complete Logic Programs with Equality. FGCS (1984)
David A. Wolfram, Michael J. Maher, Jean-Louis Lassez
A Unified Treatment of Resolution Strategies for Logic Programs. ICLP (1984)
Jean-Louis Lassez, Michael J. Maher
Closures and Fairness in the Semantics of Programming Logic. Theor. Comput. Sci. 29 (1984)
Joxan Jaffar, Jean-Louis Lassez, John W. Lloyd
Completeness of the Negation as Failure Rule. IJCAI (1983)
Jean-Louis Lassez, Michael J. Maher
The Denotational Semantics of Horn Clauses as a Production System. AAAI (1983)
Jean-Louis Lassez, V. L. Nguyen, Liz Sonenberg
Fixed Point Theorems and Semantics: A Folk Tale. Inf. Process. Lett. 14 (3) (1982)
Joxan Jaffar, Jean-Louis Lassez
Reasoning about Array Segments. ECAI (1982)
John W. Bailey, Ken Christensen, Helmut Krcmar, Jean-Louis Lassez, Vincent Y. Shen, Scott N. Woodfield
Evaluating the effect of inter-programmer communication: levels on productivity by varying programming team structure. ACM SIGSOFT Softw. Eng. Notes 7 (1) (1982)
Jean-Louis Lassez, Dirk van der Knijff, John Shepherd, Catherine Lassez
A critical examination of software science. J. Syst. Softw. 2 (2) (1981)
V. L. Nguyen, Jean-Louis Lassez
A Dual Problem to Least Fixed Points. Theor. Comput. Sci. 16 (1981)
Dirk van der Knijff, Jean-Louis Lassez
A Clarification of the Comparison Between Some Measures of Software Science. Inf. Process. Lett. 8 (5) (1979)
Jean-Louis Lassez, Dirk van der Knijff
Evaluation of length and level for simple program schemes. COMPSAC (1979)
Jean-Louis Lassez
Circular codes and synchronization. Int. J. Parallel Program. 5 (2) (1976)
Jean-Louis Lassez
Prefix codes, trees and automata. Inf. Sci. 8 (2) (1975)
Jean-Louis Lassez
A correspondence on strongly prefix codes (Corresp.). IEEE Trans. Inf. Theory 21 (3) (1975)