Jean-Louis Lassez

Available identifiers

zbMath Open lassez.jean-louisMaRDI QIDQ688573

List of research outcomes

Publication	Date of Publication	Type
Fourier algorithm revisited	2022-08-16	Paper
From LP to LP: Programming with constraints	2022-08-16	Paper
Verification: Theory and Practice	2010-03-23	Paper
Practical issues on the projection of polyhedral sets	1997-11-09	Paper
Most specific logic programs	1997-06-04	Paper
On Fourier's algorithm for linear arithmetic constraints	1994-02-17	Paper
https://portal.mardi4nfdi.de/entity/Q4035222	1993-05-18	Paper
A canonical form for generalized linear constraints	1992-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q3989943	1992-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q3359789	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3789064	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3793766	1988-01-01	Paper
Explicit representation of terms defined by counter examples	1987-01-01	Paper
Comments on “general failure of logic programs”	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3761721	1986-01-01	Paper
Optimal fixedpoints of logic programs	1985-01-01	Paper
A theory of complete logic programs with equality	1984-01-01	Paper
Closures and fairness in the semantics of programming logic	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3318096	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3917497	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4200397	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4154480	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4175773	1978-01-01	Paper
Circular codes and synchronization	1976-01-01	Paper
Prefix codes, trees, and automata	1975-01-01	Paper
A correspondence on strongly prefix codes (Corresp.)	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4096858	1975-01-01	Paper
Prefix codes and isomorphic automata	1973-01-01	Paper
On the structure of systematic prefix codes	1972-01-01	Paper

Research outcomes over time

This page was built for person: Jean-Louis Lassez