The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean-Louis Lassez: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joxan Jaffar, Jean-Louis Lassez
    Constraint Logic Programming. [Citation Graph (33, 0)][DBLP]
    POPL, 1987, pp:111-119 [Conf]
  2. Jean-Louis Lassez
    Querying Constraints. [Citation Graph (9, 9)][DBLP]
    PODS, 1990, pp:288-298 [Conf]
  3. Jean-Louis Lassez, Tien Huynh, Ken McAloon
    Simplification and Elimination of Redundant Linear Arithmetic Constraints. [Citation Graph (6, 0)][DBLP]
    NACLP, 1989, pp:37-51 [Conf]
  4. Alexander Brodsky, Catherine Lassez, Jean-Louis Lassez, Michael J. Maher
    Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. [Citation Graph (5, 15)][DBLP]
    PODS, 1995, pp:54-65 [Conf]
  5. Jean-Louis Lassez, Ken McAloon
    A Canonical Form for Generalized Linear Constraints. [Citation Graph (4, 0)][DBLP]
    J. Symb. Comput., 1992, v:13, n:1, pp:1-24 [Journal]
  6. Jean-Louis Lassez, Ken McAloon
    A Constraint Sequent Calculus [Citation Graph (3, 0)][DBLP]
    LICS, 1990, pp:52-61 [Conf]
  7. Jean-Louis Lassez, Michael J. Maher
    On Fourier's Algorithm for Linear Arithmetic Constraints. [Citation Graph (3, 0)][DBLP]
    J. Autom. Reasoning, 1992, v:9, n:3, pp:373-379 [Journal]
  8. Tien Huynh, Catherine Lassez, Jean-Louis Lassez
    Fourier Algorithm Revisited. [Citation Graph (2, 0)][DBLP]
    ALP, 1990, pp:117-131 [Conf]
  9. Joxan Jaffar, Jean-Louis Lassez, John W. Lloyd
    Completeness of the Negation as Failure Rule. [Citation Graph (2, 0)][DBLP]
    IJCAI, 1983, pp:500-506 [Conf]
  10. Jean-Louis Lassez, Michael J. Maher
    Closures and Fairness in the Semantics of Programming Logic. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:29, n:, pp:167-184 [Journal]
  11. Jean-Louis Lassez, Ken McAloon
    Applications of a Canonical Form of Gerneralized Linear Constraints. [Citation Graph (1, 0)][DBLP]
    FGCS, 1988, pp:703-710 [Conf]
  12. Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez
    Reasoning About Linear Constraints Using Parametric Queries. [Citation Graph (1, 0)][DBLP]
    FSTTCS, 1990, pp:1-20 [Conf]
  13. Joxan Jaffar, Jean-Louis Lassez
    From Unification to Constraints. [Citation Graph (1, 0)][DBLP]
    LP, 1987, pp:1-18 [Conf]
  14. Jean-Louis Lassez, Ken McAloon
    Independence of Negative Constraints. [Citation Graph (1, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:19-27 [Conf]
  15. Jean-Louis Lassez, V. L. Nguyen, Liz Sonenberg
    Fixed Point Theorems and Semantics: A Folk Tale. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:3, pp:112-116 [Journal]
  16. Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher
    A Theory of Complete Logic Programs with Equality. [Citation Graph (1, 0)][DBLP]
    J. Log. Program., 1984, v:1, n:3, pp:211-223 [Journal]
  17. T. Y. Chen, Jean-Louis Lassez, Graeme S. Port
    Maximal Unifiable Subsets and Minimal Nonunifiable Subsets. [Citation Graph (1, 0)][DBLP]
    New Generation Comput., 1986, v:4, n:2, pp:133-152 [Journal]
  18. Jean-Louis Lassez, Michael J. Maher
    The Denotational Semantics of Horn Clauses as a Production System. [Citation Graph (0, 0)][DBLP]
    AAAI, 1983, pp:229-231 [Conf]
  19. Jean-Louis Lassez, Ryan A. Rossi, Axel E. Bernal
    Crick's Hypothesis Revisited: The Existence of a Universal Coding Frame. [Citation Graph (0, 0)][DBLP]
    AINA Workshops (1), 2007, pp:745-751 [Conf]
  20. Vijay Chandru, Jean-Louis Lassez
    Qualitative Theorem Proving in Linear Constraints. [Citation Graph (0, 0)][DBLP]
    Verification: Theory and Practice, 2003, pp:395-406 [Conf]
  21. Jean-Louis Lassez
    From LP to LP: Programming with Constraints. [Citation Graph (0, 25)][DBLP]
    DBPL, 1991, pp:257-283 [Conf]
  22. Jean-Louis Lassez
    Parametric queries, linear constraints and variable elimination. [Citation Graph (0, 0)][DBLP]
    DISCO, 1990, pp:164-173 [Conf]
  23. Joxan Jaffar, Jean-Louis Lassez
    Reasoning about Array Segments. [Citation Graph (0, 0)][DBLP]
    ECAI, 1982, pp:62-66 [Conf]
  24. Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher
    A Theory of Complete Logic Programs with Equality. [Citation Graph (0, 0)][DBLP]
    FGCS, 1984, pp:175-184 [Conf]
  25. Jean-Louis Lassez, Michael J. Maher, Kim Marriott
    Unification Revisited. [Citation Graph (0, 0)][DBLP]
    Foundations of Logic and Functional Programming, 1986, pp:67-113 [Conf]
  26. Jean-Louis Lassez, Kim Marriott
    Explicit Representation of Terms Defined by Counter Examples. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:96-107 [Conf]
  27. Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher
    Invited Talk: Some Issues and Trends in the Semantics of Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1986, pp:223-241 [Conf]
  28. Kim Marriott, Lee Naish, Jean-Louis Lassez
    Most Specific Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP/SLP, 1988, pp:909-923 [Conf]
  29. David A. Wolfram, Michael J. Maher, Jean-Louis Lassez
    A Unified Treatment of Resolution Strategies for Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1984, pp:263-276 [Conf]
  30. Jean-Louis Lassez, Tayfun Karadeniz, Srinivas Mukkamala
    Zoomed Clusters. [Citation Graph (0, 0)][DBLP]
    ICONIP (2), 2006, pp:824-830 [Conf]
  31. Axel E. Bernal, Karen Hospevian, Tayfun Karadeniz, Jean-Louis Lassez
    Similarity Based Classification. [Citation Graph (0, 0)][DBLP]
    IDA, 2003, pp:187-197 [Conf]
  32. Jean-Louis Lassez
    From Unification to Constraints. [Citation Graph (0, 0)][DBLP]
    SPLT, 1988, pp:543-0 [Conf]
  33. Jean-Louis Lassez, Michael J. Maher, Kim Marriott
    Elimination of Negation in Term Algebras. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:1-16 [Conf]
  34. Kumar Jeev, Jean-Louis Lassez
    Symbolic Stochastic Systems. [Citation Graph (0, 0)][DBLP]
    MSV/AMCS, 2004, pp:321-328 [Conf]
  35. Tayfun Karadeniz, Jean-Louis Lassez, Stephen J. Sheel
    Developing a pyramid structure for managing web-centric documents. [Citation Graph (0, 0)][DBLP]
    SIGDOC, 2005, pp:80-84 [Conf]
  36. Jean-Louis Lassez
    From LP to LP: Programming with Constraints. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:420-446 [Conf]
  37. Jean-Louis Lassez, Tien Huynh, Ken McAloon
    Simplification and Elimination of Redundant Linear Arithmetic Constraints. [Citation Graph (0, 0)][DBLP]
    WCLP, 1991, pp:73-87 [Conf]
  38. Jean-Louis Lassez, Ken McAloon
    A Constraint Sequent Calculus. [Citation Graph (0, 0)][DBLP]
    WCLP, 1991, pp:33-43 [Conf]
  39. Tien Huynh, Catherine Lassez, Jean-Louis Lassez
    Practical Issues on the Projection of Polyhedral Sets. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1992, v:6, n:4, pp:295-315 [Journal]
  40. Kim Marriott, Lee Naish, Jean-Louis Lassez
    Most Specific Logic Programs. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:1, n:, pp:- [Journal]
  41. Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez
    Practical tools for reasoning about linear constraints. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1991, v:15, n:3-4, pp:357-380 [Journal]
  42. D. van der Knijff, Jean-Louis Lassez
    A Clarification of the Comparison Between Some Measures of Software Science. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:5, pp:241-243 [Journal]
  43. Jean-Louis Lassez
    Prefix codes, trees and automata. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1975, v:8, n:2, pp:155-171 [Journal]
  44. Alexander Brodsky, Catherine Lassez, Jean-Louis Lassez, Michael J. Maher
    Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1999, v:23, n:1, pp:83-104 [Journal]
  45. Jean-Louis Lassez, Kim Marriott
    Explicit Representation of Terms Defined by Counter Examples. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1987, v:3, n:3, pp:301-317 [Journal]
  46. Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher
    Comments on "General Failure of Logic Programs". [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1986, v:3, n:2, pp:115-118 [Journal]
  47. Jean-Louis Lassez, D. van der Knijff, John Shepherd, Catherine Lassez
    A critical examination of software science. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 1981, v:2, n:2, pp:105-112 [Journal]
  48. Jean-Louis Lassez, Michael J. Maher
    Optimal Fixedpoints of Logic Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:15-25 [Journal]
  49. V. L. Nguyen, Jean-Louis Lassez
    A Dual Problem to Least Fixed Points. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:211-221 [Journal]

  50. Le théorème de Perron Frobenius est-il vraiment nécessaire? [Citation Graph (, )][DBLP]


  51. Ranking Links on the Web: Search and Surf Engines. [Citation Graph (, )][DBLP]


  52. Signature based intrusion detection using latent semantic analysis. [Citation Graph (, )][DBLP]


  53. Client-side dynamic metadata in web 2.0. [Citation Graph (, )][DBLP]


Search in 0.181secs, Finished in 0.182secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002