A control language for designing constraint solvers
Identifieur interne :
000039 ( PascalFrancis/Curation );
précédent :
000038;
suivant :
000040
A control language for designing constraint solvers
Auteurs : C. Castro [
France] ;
E. Monfroy [
Pays-Bas]
Source :
-
Lecture notes in computer science [ 0302-9743 ] ; 2000.
RBID : Pascal:00-0316882
Descripteurs français
English descriptors
Abstract
We propose a strategy language for designing single constraint solvers as well as their collaborations. Based on the notions of constraint filter, separator, and sorter, we define basic strategy operators that allow us to specify single solvers and their collaboration in a uniform way. We exemplify the use of this language by specifying some techniques for solving non-linear constraints over real numbers and CSPs over finite domains.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 1755 |
|---|
| A08 | 01 | 1 | ENG | @1 A control language for designing constraint solvers |
|---|
| A09 | 01 | 1 | ENG | @1 PSI'99 : perspectives of system informatics : Novosibirsk, 6-9 July 1999 |
|---|
| A11 | 01 | 1 | | @1 CASTRO (C.) |
|---|
| A11 | 02 | 1 | | @1 MONFROY (E.) |
|---|
| A12 | 01 | 1 | | @1 BJRNER (Dines) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 BROY (Manfred) @9 ed. |
|---|
| A12 | 03 | 1 | | @1 ZAMULIN (Alexandre V.) @9 ed. |
|---|
| A14 | 01 | | | @1 LORIA-INRIA, BP 101 @2 54602 Villers-lès-Nancy @3 FRA @Z 1 aut. |
|---|
| A14 | 02 | | | @1 CWI, P.O. Box 94079 @2 1090 GB Amsterdam @3 NLD @Z 2 aut. |
|---|
| A20 | | | | @1 402-415 |
|---|
| A21 | | | | @1 2000 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-67102-1 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000080064630360 |
|---|
| A44 | | | | @0 0000 @1 © 2000 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 18 ref. |
|---|
| A47 | 01 | 1 | | @0 00-0316882 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 We propose a strategy language for designing single constraint solvers as well as their collaborations. Based on the notions of constraint filter, separator, and sorter, we define basic strategy operators that allow us to specify single solvers and their collaboration in a uniform way. We exemplify the use of this language by specifying some techniques for solving non-linear constraints over real numbers and CSPs over finite domains. |
|---|
| C02 | 01 | X | | @0 001D02A07 |
|---|
| C03 | 01 | X | FRE | @0 Informatique théorique @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Computer theory @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Informática teórica @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Programmation logique avec contrainte @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Constraint logic programming @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Programación lógica con restricción @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Transformation programme @5 03 |
|---|
| C03 | 03 | X | ENG | @0 Program transformation @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Transformación programa @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Spécification programme @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Program specification @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Especificación programa @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Satisfaction contrainte @5 05 |
|---|
| C03 | 05 | X | ENG | @0 Constraint satisfaction @5 05 |
|---|
| C03 | 05 | X | SPA | @0 Satisfaccion restricción @5 05 |
|---|
| C03 | 06 | 3 | FRE | @0 Système réécriture @5 06 |
|---|
| C03 | 06 | 3 | ENG | @0 Rewriting systems @5 06 |
|---|
| N21 | | | | @1 213 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 International Andrei Ershov Memorial conference @2 3 @3 Novosibirsk RUS @4 1999-07-06 |
|---|
|
|---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000A43
Links to Exploration step
Pascal:00-0316882
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A control language for designing constraint solvers</title>
<author><name sortKey="Castro, C" sort="Castro, C" uniqKey="Castro C" first="C." last="Castro">C. Castro</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA-INRIA, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><country>France</country>
</affiliation><author><name sortKey="Monfroy, E" sort="Monfroy, E" uniqKey="Monfroy E" first="E." last="Monfroy">E. Monfroy</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>CWI, P.O. Box 94079</s1>
<s2>1090 GB Amsterdam</s2>
<s3>NLD</s3>
<sZ>2 aut.</sZ>
</inist:fA14><country>Pays-Bas</country>
</affiliation><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">00-0316882</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 00-0316882 INIST</idno>
<idno type="RBID">Pascal:00-0316882</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000A43</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000039</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A control language for designing constraint solvers</title>
<author><name sortKey="Castro, C" sort="Castro, C" uniqKey="Castro C" first="C." last="Castro">C. Castro</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA-INRIA, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><country>France</country>
</affiliation><author><name sortKey="Monfroy, E" sort="Monfroy, E" uniqKey="Monfroy E" first="E." last="Monfroy">E. Monfroy</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>CWI, P.O. Box 94079</s1>
<s2>1090 GB Amsterdam</s2>
<s3>NLD</s3>
<sZ>2 aut.</sZ>
</inist:fA14><country>Pays-Bas</country>
</affiliation><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2000">2000</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer theory</term>
<term>Constraint logic programming</term>
<term>Constraint satisfaction</term>
<term>Program specification</term>
<term>Program transformation</term>
<term>Rewriting systems</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Programmation logique avec contrainte</term>
<term>Transformation programme</term>
<term>Spécification programme</term>
<term>Satisfaction contrainte</term>
<term>Système réécriture</term>
</keywords><front><div type="abstract" xml:lang="en">We propose a strategy language for designing single constraint solvers as well as their collaborations. Based on the notions of constraint filter, separator, and sorter, we define basic strategy operators that allow us to specify single solvers and their collaboration in a uniform way. We exemplify the use of this language by specifying some techniques for solving non-linear constraints over real numbers and CSPs over finite domains.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>1755</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>A control language for designing constraint solvers</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>PSI'99 : perspectives of system informatics : Novosibirsk, 6-9 July 1999</s1>
</fA09><fA11 i1="01" i2="1"><s1>CASTRO (C.)</s1>
</fA11><fA11 i1="02" i2="1"><s1>MONFROY (E.)</s1>
</fA11><fA12 i1="01" i2="1"><s1>BJRNER (Dines)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>BROY (Manfred)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="03" i2="1"><s1>ZAMULIN (Alexandre V.)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>LORIA-INRIA, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14><fA14 i1="02"><s1>CWI, P.O. Box 94079</s1>
<s2>1090 GB Amsterdam</s2>
<s3>NLD</s3>
<sZ>2 aut.</sZ>
</fA14><fA20><s1>402-415</s1>
</fA20><fA21><s1>2000</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-67102-1</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000080064630360</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2000 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>18 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>00-0316882</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>We propose a strategy language for designing single constraint solvers as well as their collaborations. Based on the notions of constraint filter, separator, and sorter, we define basic strategy operators that allow us to specify single solvers and their collaboration in a uniform way. We exemplify the use of this language by specifying some techniques for solving non-linear constraints over real numbers and CSPs over finite domains.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02A07</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Programmation logique avec contrainte</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Constraint logic programming</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Programación lógica con restricción</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Transformation programme</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Program transformation</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Transformación programa</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Spécification programme</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Program specification</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Especificación programa</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Satisfaction contrainte</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Constraint satisfaction</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Satisfaccion restricción</s0>
<s5>05</s5>
</fC03><fC03 i1="06" i2="3" l="FRE"><s0>Système réécriture</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="3" l="ENG"><s0>Rewriting systems</s0>
<s5>06</s5>
</fC03><fN21><s1>213</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>International Andrei Ershov Memorial conference</s1>
<s2>3</s2>
<s3>Novosibirsk RUS</s3>
<s4>1999-07-06</s4>
</fA30>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000039 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000039 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Curation
|type= RBID
|clé= Pascal:00-0316882
|texte= A control language for designing constraint solvers
}}
| 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 |  |
