Jean-Louis Lassez

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