InforLorV4, PascalFrancis, Corpus, bibRecord, 000A76

A methodological view of constraint solving

Identifieur interne : 000A76 ( PascalFrancis/Corpus ); précédent : 000A75; suivant : 000A77

A methodological view of constraint solving

Auteurs : H. Comon ; M. Dincbas ; J.-P. Jouannaud ; C. Kirchner

Source :

Constraints [ 1383-7133 ] ; 1999.

RBID : Pascal:00-0074460

Descripteurs français

Pascal (Inist)
- Satisfaction contrainte, Unification, Résolution(math), Contrainte, Programmation logique avec contrainte, Règle inférence, Méthode syntaxique, Méthode sémantique, Méthode hybride, Résolution basée règle, Résolution contrainte.

English descriptors

KwdEn :
- Constraint, Constraint logic programming, Constraint satisfaction, Inference rule, Solving, Unification.

Abstract

Constraints are an effective tool to define sets of data by means of logical formulae. Our goal here is to survey the notion of constraint system and to give examples of constraint systems operating on various domains, such as natural, rational or real numbers, finite domains, and term domains. We classify the different methods used for solving constraints, syntactic methods based on transformations, semantic methods based on adequate representations of constraints, hybrid methods combining transformations and enumerations. The concepts and methods are illustrated via examples. We also discuss applications of constraints to various fields, such as programming, operations research, and theorem proving.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`2`		`@0 1383-7133`
A05				`@2 4`
A06				`@2 4`
A08	`01`	`1`	`ENG`	`@1 A methodological view of constraint solving`
A09	`01`	`1`	`ENG`	`@1 Special Issue on Concepts and Topics in Constraint Programming Languages`
A11	`01`	`1`		`@1 COMON (H.)`
A11	`02`	`1`		`@1 DINCBAS (M.)`
A11	`03`	`1`		`@1 JOUANNAUD (J.-P.)`
A11	`04`	`1`		`@1 KIRCHNER (C.)`
A12	`01`	`1`		`@1 COHEN (Jacques) @9 ed.`
A14	`01`			`@1 LSV, Ecole Normale Supérieure de Cachan, 61 Ave. Président Wilson @2 94235 Cachan @3 FRA @Z 1 aut.`
A14	`02`			`@1 COSYTEC, Parc Club Orsay Université, 4 Rue Jean Rostand @2 91893 Orsay @3 FRA @Z 2 aut.`
A14	`03`			`@1 CNRS and LRI, Bat. 490, Université de Paris Sud @2 91405 Orsay @3 FRA @Z 3 aut.`
A14	`04`			`@1 LORIA & INRIA, 615 Rue du Jardin Botanique @2 54602 Villers-lès-Nancy @3 FRA @Z 4 aut.`
A15	`01`			`@1 Brandeis University @2 Waltham, Massachusetts @3 USA @Z 1 aut.`
A20				`@1 337-361`
A21				`@1 1999`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 26595 @5 354000080889740020`
A44				`@0 0000 @1 © 2000 INIST-CNRS. All rights reserved.`
A45				`@0 72 ref.`
A47	`01`	`1`		`@0 00-0074460`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`2`		`@0 Constraints`
A66	`01`			`@0 USA`
A99				`@0 2 notes`
C01	`01`		`ENG`	@0 Constraints are an effective tool to define sets of data by means of logical formulae. Our goal here is to survey the notion of constraint system and to give examples of constraint systems operating on various domains, such as natural, rational or real numbers, finite domains, and term domains. We classify the different methods used for solving constraints, syntactic methods based on transformations, semantic methods based on adequate representations of constraints, hybrid methods combining transformations and enumerations. The concepts and methods are illustrated via examples. We also discuss applications of constraints to various fields, such as programming, operations research, and theorem proving.
C02	`01`	`X`		`@0 001D02A07`
C02	`02`	`X`		`@0 001D01A03`
C02	`03`	`X`		`@0 001D02A02`
C03	`01`	`X`	`FRE`	`@0 Satisfaction contrainte @5 01`
C03	`01`	`X`	`ENG`	`@0 Constraint satisfaction @5 01`
C03	`01`	`X`	`SPA`	`@0 Satisfaccion restricción @5 01`
C03	`02`	`X`	`FRE`	`@0 Unification @5 02`
C03	`02`	`X`	`ENG`	`@0 Unification @5 02`
C03	`02`	`X`	`SPA`	`@0 Unificación @5 02`
C03	`03`	`X`	`FRE`	`@0 Résolution(math) @5 03`
C03	`03`	`X`	`ENG`	`@0 Solving @5 03`
C03	`03`	`X`	`SPA`	`@0 Resolución (matemática) @5 03`
C03	`04`	`X`	`FRE`	`@0 Contrainte @5 04`
C03	`04`	`X`	`ENG`	`@0 Constraint @5 04`
C03	`04`	`X`	`SPA`	`@0 Coacción @5 04`
C03	`05`	`X`	`FRE`	`@0 Programmation logique avec contrainte @5 05`
C03	`05`	`X`	`ENG`	`@0 Constraint logic programming @5 05`
C03	`05`	`X`	`SPA`	`@0 Programación lógica con restricción @5 05`
C03	`06`	`X`	`FRE`	`@0 Règle inférence @5 06`
C03	`06`	`X`	`ENG`	`@0 Inference rule @5 06`
C03	`06`	`X`	`SPA`	`@0 Regla inferencia @5 06`
C03	`07`	`X`	`FRE`	`@0 Méthode syntaxique @4 INC @5 72`
C03	`08`	`X`	`FRE`	`@0 Méthode sémantique @4 INC @5 73`
C03	`09`	`X`	`FRE`	`@0 Méthode hybride @4 INC @5 74`
C03	`10`	`X`	`FRE`	`@0 Résolution basée règle @4 INC @5 75`
C03	`11`	`X`	`FRE`	`@0 Résolution contrainte @4 INC @5 76`
N21				`@1 052`

Format Inist (serveur)

NO :	PASCAL 00-0074460 INIST
ET :	A methodological view of constraint solving
AU :	COMON (H.); DINCBAS (M.); JOUANNAUD (J.-P.); KIRCHNER (C.); COHEN (Jacques)
AF :	LSV, Ecole Normale Supérieure de Cachan, 61 Ave. Président Wilson/94235 Cachan/France (1 aut.); COSYTEC, Parc Club Orsay Université, 4 Rue Jean Rostand/91893 Orsay/France (2 aut.); CNRS and LRI, Bat. 490, Université de Paris Sud/91405 Orsay/France (3 aut.); LORIA & INRIA, 615 Rue du Jardin Botanique/54602 Villers-lès-Nancy/France (4 aut.); Brandeis University/Waltham, Massachusetts/Etats-Unis (1 aut.)
DT :	Publication en série; Niveau analytique
SO :	Constraints; ISSN 1383-7133; Etats-Unis; Da. 1999; Vol. 4; No. 4; Pp. 337-361; Bibl. 72 ref.
LA :	Anglais
EA :	Constraints are an effective tool to define sets of data by means of logical formulae. Our goal here is to survey the notion of constraint system and to give examples of constraint systems operating on various domains, such as natural, rational or real numbers, finite domains, and term domains. We classify the different methods used for solving constraints, syntactic methods based on transformations, semantic methods based on adequate representations of constraints, hybrid methods combining transformations and enumerations. The concepts and methods are illustrated via examples. We also discuss applications of constraints to various fields, such as programming, operations research, and theorem proving.
CC :	001D02A07; 001D01A03; 001D02A02
FD :	Satisfaction contrainte; Unification; Résolution(math); Contrainte; Programmation logique avec contrainte; Règle inférence; Méthode syntaxique; Méthode sémantique; Méthode hybride; Résolution basée règle; Résolution contrainte
ED :	Constraint satisfaction; Unification; Solving; Constraint; Constraint logic programming; Inference rule
SD :	Satisfaccion restricción; Unificación; Resolución (matemática); Coacción; Programación lógica con restricción; Regla inferencia
LO :	INIST-26595.354000080889740020
ID :	00-0074460

Links to Exploration step

Pascal:00-0074460

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A methodological view of constraint solving</title>
<author><name sortKey="Comon, H" sort="Comon, H" uniqKey="Comon H" first="H." last="Comon">H. Comon</name>
<affiliation><inist:fA14 i1="01"><s1>LSV, Ecole Normale Supérieure de Cachan, 61 Ave. Président Wilson</s1>
<s2>94235 Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Dincbas, M" sort="Dincbas, M" uniqKey="Dincbas M" first="M." last="Dincbas">M. Dincbas</name>
<affiliation><inist:fA14 i1="02"><s1>COSYTEC, Parc Club Orsay Université, 4 Rue Jean Rostand</s1>
<s2>91893 Orsay</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Jouannaud, J P" sort="Jouannaud, J P" uniqKey="Jouannaud J" first="J.-P." last="Jouannaud">J.-P. Jouannaud</name>
<affiliation><inist:fA14 i1="03"><s1>CNRS and LRI, Bat. 490, Université de Paris Sud</s1>
<s2>91405 Orsay</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kirchner, C" sort="Kirchner, C" uniqKey="Kirchner C" first="C." last="Kirchner">C. Kirchner</name>
<affiliation><inist:fA14 i1="04"><s1>LORIA & INRIA, 615 Rue du Jardin Botanique</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">00-0074460</idno>
<date when="1999">1999</date>
<idno type="stanalyst">PASCAL 00-0074460 INIST</idno>
<idno type="RBID">Pascal:00-0074460</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000A76</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A methodological view of constraint solving</title>
<author><name sortKey="Comon, H" sort="Comon, H" uniqKey="Comon H" first="H." last="Comon">H. Comon</name>
<affiliation><inist:fA14 i1="01"><s1>LSV, Ecole Normale Supérieure de Cachan, 61 Ave. Président Wilson</s1>
<s2>94235 Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Dincbas, M" sort="Dincbas, M" uniqKey="Dincbas M" first="M." last="Dincbas">M. Dincbas</name>
<affiliation><inist:fA14 i1="02"><s1>COSYTEC, Parc Club Orsay Université, 4 Rue Jean Rostand</s1>
<s2>91893 Orsay</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Jouannaud, J P" sort="Jouannaud, J P" uniqKey="Jouannaud J" first="J.-P." last="Jouannaud">J.-P. Jouannaud</name>
<affiliation><inist:fA14 i1="03"><s1>CNRS and LRI, Bat. 490, Université de Paris Sud</s1>
<s2>91405 Orsay</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kirchner, C" sort="Kirchner, C" uniqKey="Kirchner C" first="C." last="Kirchner">C. Kirchner</name>
<affiliation><inist:fA14 i1="04"><s1>LORIA & INRIA, 615 Rue du Jardin Botanique</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Constraints</title>
<idno type="ISSN">1383-7133</idno>
<imprint><date when="1999">1999</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Constraints</title>
<idno type="ISSN">1383-7133</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Constraint</term>
<term>Constraint logic programming</term>
<term>Constraint satisfaction</term>
<term>Inference rule</term>
<term>Solving</term>
<term>Unification</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Satisfaction contrainte</term>
<term>Unification</term>
<term>Résolution(math)</term>
<term>Contrainte</term>
<term>Programmation logique avec contrainte</term>
<term>Règle inférence</term>
<term>Méthode syntaxique</term>
<term>Méthode sémantique</term>
<term>Méthode hybride</term>
<term>Résolution basée règle</term>
<term>Résolution contrainte</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Constraints are an effective tool to define sets of data by means of logical formulae. Our goal here is to survey the notion of constraint system and to give examples of constraint systems operating on various domains, such as natural, rational or real numbers, finite domains, and term domains. We classify the different methods used for solving constraints, syntactic methods based on transformations, semantic methods based on adequate representations of constraints, hybrid methods combining transformations and enumerations. The concepts and methods are illustrated via examples. We also discuss applications of constraints to various fields, such as programming, operations research, and theorem proving.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="2"><s0>1383-7133</s0>
</fA01>
<fA05><s2>4</s2>
</fA05>
<fA06><s2>4</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>A methodological view of constraint solving</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Special Issue on Concepts and Topics in Constraint Programming Languages</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>COMON (H.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>DINCBAS (M.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>JOUANNAUD (J.-P.)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>KIRCHNER (C.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>COHEN (Jacques)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LSV, Ecole Normale Supérieure de Cachan, 61 Ave. Président Wilson</s1>
<s2>94235 Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>COSYTEC, Parc Club Orsay Université, 4 Rue Jean Rostand</s1>
<s2>91893 Orsay</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>CNRS and LRI, Bat. 490, Université de Paris Sud</s1>
<s2>91405 Orsay</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="04"><s1>LORIA & INRIA, 615 Rue du Jardin Botanique</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>Brandeis University</s1>
<s2>Waltham, Massachusetts</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA20><s1>337-361</s1>
</fA20>
<fA21><s1>1999</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>26595</s2>
<s5>354000080889740020</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2000 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>72 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>00-0074460</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="2"><s0>Constraints</s0>
</fA64>
<fA66 i1="01"><s0>USA</s0>
</fA66>
<fA99><s0>2 notes</s0>
</fA99>
<fC01 i1="01" l="ENG"><s0>Constraints are an effective tool to define sets of data by means of logical formulae. Our goal here is to survey the notion of constraint system and to give examples of constraint systems operating on various domains, such as natural, rational or real numbers, finite domains, and term domains. We classify the different methods used for solving constraints, syntactic methods based on transformations, semantic methods based on adequate representations of constraints, hybrid methods combining transformations and enumerations. The concepts and methods are illustrated via examples. We also discuss applications of constraints to various fields, such as programming, operations research, and theorem proving.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A07</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D01A03</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001D02A02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Satisfaction contrainte</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Constraint satisfaction</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Satisfaccion restricción</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Unification</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Unification</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Unificación</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Résolution(math)</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Solving</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Resolución (matemática)</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Contrainte</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Constraint</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Coacción</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Programmation logique avec contrainte</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Constraint logic programming</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Programación lógica con restricción</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Règle inférence</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Inference rule</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Regla inferencia</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Méthode syntaxique</s0>
<s4>INC</s4>
<s5>72</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Méthode sémantique</s0>
<s4>INC</s4>
<s5>73</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Méthode hybride</s0>
<s4>INC</s4>
<s5>74</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Résolution basée règle</s0>
<s4>INC</s4>
<s5>75</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Résolution contrainte</s0>
<s4>INC</s4>
<s5>76</s5>
</fC03>
<fN21><s1>052</s1>
</fN21>
</pA>
</standard>
<server><NO>PASCAL 00-0074460 INIST</NO>
<ET>A methodological view of constraint solving</ET>
<AU>COMON (H.); DINCBAS (M.); JOUANNAUD (J.-P.); KIRCHNER (C.); COHEN (Jacques)</AU>
<AF>LSV, Ecole Normale Supérieure de Cachan, 61 Ave. Président Wilson/94235 Cachan/France (1 aut.); COSYTEC, Parc Club Orsay Université, 4 Rue Jean Rostand/91893 Orsay/France (2 aut.); CNRS and LRI, Bat. 490, Université de Paris Sud/91405 Orsay/France (3 aut.); LORIA & INRIA, 615 Rue du Jardin Botanique/54602 Villers-lès-Nancy/France (4 aut.); Brandeis University/Waltham, Massachusetts/Etats-Unis (1 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Constraints; ISSN 1383-7133; Etats-Unis; Da. 1999; Vol. 4; No. 4; Pp. 337-361; Bibl. 72 ref.</SO>
<LA>Anglais</LA>
<EA>Constraints are an effective tool to define sets of data by means of logical formulae. Our goal here is to survey the notion of constraint system and to give examples of constraint systems operating on various domains, such as natural, rational or real numbers, finite domains, and term domains. We classify the different methods used for solving constraints, syntactic methods based on transformations, semantic methods based on adequate representations of constraints, hybrid methods combining transformations and enumerations. The concepts and methods are illustrated via examples. We also discuss applications of constraints to various fields, such as programming, operations research, and theorem proving.</EA>
<CC>001D02A07; 001D01A03; 001D02A02</CC>
<FD>Satisfaction contrainte; Unification; Résolution(math); Contrainte; Programmation logique avec contrainte; Règle inférence; Méthode syntaxique; Méthode sémantique; Méthode hybride; Résolution basée règle; Résolution contrainte</FD>
<ED>Constraint satisfaction; Unification; Solving; Constraint; Constraint logic programming; Inference rule</ED>
<SD>Satisfaccion restricción; Unificación; Resolución (matemática); Coacción; Programación lógica con restricción; Regla inferencia</SD>
<LO>INIST-26595.354000080889740020</LO>
<ID>00-0074460</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A76 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000A76 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:00-0074460
   |texte=   A methodological view of constraint solving
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

A methodological view of constraint solving

A methodological view of constraint solving

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri