default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Louis Lassez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1973
[b1]Jean-Louis Lassez:
On the relationship between prefix-codes, trees, and automata. Purdue University, USA, 1973
Journal Articles
- 1999
- [j20]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): 83-104 (1999) - 1992
- [j19]Tien Huynh, Catherine Lassez, Jean-Louis Lassez:
Practical Issues on the Projection of Polyhedral Sets. Ann. Math. Artif. Intell. 6(4): 295-315 (1992) - [j18]Jean-Louis Lassez, Michael J. Maher:
On Fourier's Algorithm for Linear Arithmetic Constraints. J. Autom. Reason. 9(3): 373-379 (1992) - [j17]Jean-Louis Lassez, Ken McAloon:
A Canonical Form for Generalized Linear Constraints. J. Symb. Comput. 13(1): 1-24 (1992) - 1991
- [j16]Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez:
Practical tools for reasoning about linear constraints. Fundam. Informaticae 15(3-4): 357-380 (1991) - 1990
- [j15]Kim Marriott, Lee Naish, Jean-Louis Lassez:
Most Specific Logic Programs. Ann. Math. Artif. Intell. 1: 303-338 (1990) - 1987
- [j14]Jean-Louis Lassez, Kim Marriott:
Explicit Representation of Terms Defined by Counter Examples. J. Autom. Reason. 3(3): 301-317 (1987) - 1986
- [j13]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
Comments on "General Failure of Logic Programs". J. Log. Program. 3(2): 115-118 (1986) - [j12]T. Y. Chen, Jean-Louis Lassez, Graeme S. Port:
Maximal Unifiable Subsets and Minimal Nonunifiable Subsets. New Gener. Comput. 4(2): 133-152 (1986) - 1985
- [j11]Jean-Louis Lassez, Michael J. Maher:
Optimal Fixedpoints of Logic Programs. Theor. Comput. Sci. 39: 15-25 (1985) - 1984
- [j10]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
A Theory of Complete Logic Programs with Equality. J. Log. Program. 1(3): 211-223 (1984) - [j9]Jean-Louis Lassez, Michael J. Maher:
Closures and Fairness in the Semantics of Programming Logic. Theor. Comput. Sci. 29: 167-184 (1984) - 1982
- [j8]Jean-Louis Lassez, V. L. Nguyen, Liz Sonenberg:
Fixed Point Theorems and Semantics: A Folk Tale. Inf. Process. Lett. 14(3): 112-116 (1982) - [j7]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): 10-20 (1982) - 1981
- [j6]Jean-Louis Lassez, Dirk van der Knijff, John Shepherd
, Catherine Lassez:
A critical examination of software science. J. Syst. Softw. 2(2): 105-112 (1981) - [j5]V. L. Nguyen, Jean-Louis Lassez:
A Dual Problem to Least Fixed Points. Theor. Comput. Sci. 16: 211-221 (1981) - 1979
- [j4]Dirk van der Knijff, Jean-Louis Lassez:
A Clarification of the Comparison Between Some Measures of Software Science. Inf. Process. Lett. 8(5): 241-243 (1979) - 1976
- [j3]Jean-Louis Lassez:
Circular codes and synchronization. Int. J. Parallel Program. 5(2): 201-208 (1976) - 1975
- [j2]Jean-Louis Lassez:
Prefix codes, trees and automata. Inf. Sci. 8(2): 155-171 (1975) - [j1]Jean-Louis Lassez:
A correspondence on strongly prefix codes (Corresp.). IEEE Trans. Inf. Theory 21(3): 344-345 (1975)
Conference and Workshop Papers
- 2008
- [c38]Jean-Louis Lassez, Ryan A. Rossi, Kumar Jeev:
Ranking Links on the Web: Search and Surf Engines. IEA/AIE 2008: 199-208 - [c37]Jean-Louis Lassez, Ryan A. Rossi, Stephen J. Sheel, Srinivas Mukkamala:
Signature based intrusion detection using latent semantic analysis. IJCNN 2008: 1068-1074 - 2007
- [c36]Jean-Louis Lassez, Ryan A. Rossi, Axel E. Bernal:
Crick's Hypothesis Revisited: The Existence of a Universal Coding Frame. AINA Workshops (1) 2007: 745-751 - [c35]Jean-Louis Lassez:
Le théorème de Perron Frobenius est-il vraiment nécessaire? BDA 2007 - [c34]John W. Stamey, Jean-Louis Lassez, Daniel Boorn, Ryan A. Rossi:
Client-side dynamic metadata in web 2.0. SIGDOC 2007: 155-161 - 2006
- [c33]Jean-Louis Lassez, Tayfun Karadeniz, Srinivas Mukkamala:
Zoomed Clusters. ICONIP (2) 2006: 824-830 - 2005
- [c32]Tayfun Karadeniz, Jean-Louis Lassez, Stephen J. Sheel:
Developing a pyramid structure for managing web-centric documents. SIGDOC 2005: 80-84 - 2004
- [c31]Kumar Jeev, Jean-Louis Lassez:
Symbolic Stochastic Systems. MSV/AMCS 2004: 321-328 - 2003
- [c30]Vijay Chandru, Jean-Louis Lassez:
Qualitative Theorem Proving in Linear Constraints. Verification: Theory and Practice 2003: 395-406 - [c29]Axel E. Bernal, Karen Hospevian, Tayfun Karadeniz, Jean-Louis Lassez:
Similarity Based Classification. IDA 2003: 187-197 - 1995
- [c28]Alexander Brodsky, Catherine Lassez, Jean-Louis Lassez, Michael J. Maher:
Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. PODS 1995: 54-65 - 1991
- [c27]Jean-Louis Lassez:
From LP to LP: Programming with Constraints. DBPL 1991: 257-283 - [c26]Jean-Louis Lassez, Michael J. Maher, Kim Marriott:
Elimination of Negation in Term Algebras. MFCS 1991: 1-16 - [c25]Jean-Louis Lassez:
From LP to LP: Programming with Constraints. TACS 1991: 420-446 - [c24]Jean-Louis Lassez, Ken McAloon:
A Constraint Sequent Calculus. WCLP 1991: 33-43 - [c23]Jean-Louis Lassez, Tien Huynh, Ken McAloon:
Simplification and Elimination of Redundant Linear Arithmetic Constraints. WCLP 1991: 73-87 - 1990
- [c22]Tien Huynh, Catherine Lassez, Jean-Louis Lassez:
Fourier Algorithm Revisited. ALP 1990: 117-131 - [c21]Jean-Louis Lassez:
Parametric queries, linear constraints and variable elimination. DISCO 1990: 164-173 - [c20]Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez:
Reasoning About Linear Constraints Using Parametric Queries. FSTTCS 1990: 1-20 - [c19]Jean-Louis Lassez, Ken McAloon:
A Constraint Sequent Calculus. LICS 1990: 52-61 - [c18]Jean-Louis Lassez:
Querying Constraints. PODS 1990: 288-298 - 1989
- [c17]Jean-Louis Lassez, Tien Huynh, Ken McAloon:
Simplification and Elimination of Redundant Linear Arithmetic Constraints. NACLP 1989: 37-51 - [c16]Jean-Louis Lassez, Ken McAloon:
Independence of Negative Constraints. TAPSOFT, Vol.1 1989: 19-27 - 1988
- [c15]Jean-Louis Lassez, Ken McAloon:
Applications of a Canonical Form of Gerneralized Linear Constraints. FGCS 1988: 703-710 - [c14]Kim Marriott, Lee Naish, Jean-Louis Lassez:
Most Specific Logic Programs. ICLP/SLP 1988: 909-923 - [c13]Jean-Louis Lassez:
From Unification to Constraints. SPLT 1988: 543- - 1987
- [c12]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: 275-298 - [c11]Joxan Jaffar, Jean-Louis Lassez:
From Unification to Constraints. LP 1987: 1-18 - [c10]Joxan Jaffar, Jean-Louis Lassez:
Constraint Logic Programming. POPL 1987: 111-119 - 1986
- [c9]Jean-Louis Lassez, Michael J. Maher, Kim Marriott:
Unification Revisited. Foundations of Logic and Functional Programming 1986: 67-113 - [c8]Jean-Louis Lassez, Kim Marriott:
Explicit Representation of Terms Defined by Counter Examples. FSTTCS 1986: 96-107 - [c7]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
Invited Talk: Some Issues and Trends in the Semantics of Logic Programming. ICLP 1986: 223-241 - 1984
- [c6]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
A Theory of Complete Logic Programs with Equality. FGCS 1984: 175-184 - [c5]David A. Wolfram, Michael J. Maher, Jean-Louis Lassez:
A Unified Treatment of Resolution Strategies for Logic Programs. ICLP 1984: 263-276 - 1983
- [c4]Jean-Louis Lassez, Michael J. Maher:
The Denotational Semantics of Horn Clauses as a Production System. AAAI 1983: 229-231 - [c3]Joxan Jaffar, Jean-Louis Lassez, John W. Lloyd:
Completeness of the Negation as Failure Rule. IJCAI 1983: 500-506 - 1982
- [c2]Joxan Jaffar, Jean-Louis Lassez:
Reasoning about Array Segments. ECAI 1982: 62-66 - 1979
- [c1]Jean-Louis Lassez, Dirk van der Knijff:
Evaluation of length and level for simple program schemes. COMPSAC 1979: 688-694
Parts in Books or Collections
- 1988
- [p2]Jean-Louis Lassez, Michael J. Maher, Kim Marriott:
Unification Revisited. Foundations of Deductive Databases and Logic Programming. 1988: 587-625 - 1986
- [p1]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
Logic Programming Language Scheme. Logic Programming: Functions, Relations, and Equations 1986: 441-467
Editorship
- 1991
- [e2]Jean-Louis Lassez, Gordon D. Plotkin:
Computational Logic - Essays in Honor of Alan Robinson. The MIT Press 1991, ISBN 0-262-12156-5 [contents] - 1987
- [e1]Jean-Louis Lassez:
Logic Programming, Proceedings of the Fourth International Conference, Melbourne, Victoria, Australia, May 25-29, 1987 (2 Volumes). MIT Press 1987, ISBN 0-262-12125-5 [contents]
Informal and Other Publications
- 2019
- [i1]Jean-Louis Lassez:
Solving Systems of Linear Inequalities. CoRR abs/1907.07811 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-27 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
