( en | de | ru )

 

Disambiguation of "Lassez, Jean-Louis"

Author of the publication

copydeleteadd this publication to your clipboard
Comments on "General Failure of Logic Programs".

, , and . J. Log. Program., 3 (2): 115-118 (1986)see JLP 2: 157-165 (1985).

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jean-Louis She

Jean-Louis Arni

Jean-Louis Fournel

Jean-Louis Zimmermann

Jean-Louis Souletie

 

Other publications of authors with the same name

Completeness of the Negation as Failure Rule., , and . IJCAI, page 500-506. William Kaufmann, (1983)Unification Revisited., , and . Foundations of Logic and Functional Programming, volume 306 of Lecture Notes in Computer Science, page 67-113. Springer, (1986)A critical examination of software science., , , and . J. Syst. Softw., 2 (2): 105-112 (1981)Fourier Algorithm Revisited., , and . ALP, volume 463 of Lecture Notes in Computer Science, page 117-131. Springer, (1990)Simplification and Elimination of Redundant Linear Arithmetic Constraints., , and . NACLP, page 37-51. MIT Press, (1989)Signature based intrusion detection using latent semantic analysis., , , and . IJCNN, page 1068-1074. IEEE, (2008)Comments on "General Failure of Logic Programs"., , and . J. Log. Program., 3 (2): 115-118 (1986)see JLP 2: 157-165 (1985).Elimination of Negation in Term Algebras., , and . MFCS, volume 520 of Lecture Notes in Computer Science, page 1-16. Springer, (1991)Optimal Fixedpoints of Logic Programs., and . Theor. Comput. Sci., (1985)Explicit Representation of Terms Defined by Counter Examples., and . FSTTCS, volume 241 of Lecture Notes in Computer Science, page 96-107. Springer, (1986)