Jean-Louis Lassez

From MaRDI portal
Person:688573

Available identifiers

zbMath Open lassez.jean-louisMaRDI QIDQ688573

List of research outcomes





PublicationDate of PublicationType
Fourier algorithm revisited2022-08-16Paper
From LP to LP: Programming with constraints2022-08-16Paper
Verification: Theory and Practice2010-03-23Paper
Practical issues on the projection of polyhedral sets1997-11-09Paper
Most specific logic programs1997-06-04Paper
On Fourier's algorithm for linear arithmetic constraints1994-02-17Paper
https://portal.mardi4nfdi.de/entity/Q40352221993-05-18Paper
A canonical form for generalized linear constraints1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39899431992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q33597891990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37890641988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37937661988-01-01Paper
Explicit representation of terms defined by counter examples1987-01-01Paper
Comments on “general failure of logic programs”1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37617211986-01-01Paper
Optimal fixedpoints of logic programs1985-01-01Paper
A theory of complete logic programs with equality1984-01-01Paper
Closures and fairness in the semantics of programming logic1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33180961983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39174971981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42003971978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41544801978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41757731978-01-01Paper
Circular codes and synchronization1976-01-01Paper
Prefix codes, trees, and automata1975-01-01Paper
A correspondence on strongly prefix codes (Corresp.)1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40968581975-01-01Paper
Prefix codes and isomorphic automata1973-01-01Paper
On the structure of systematic prefix codes1972-01-01Paper

Research outcomes over time

This page was built for person: Jean-Louis Lassez