A reactive approach for solving constraint Satisfaction problems
Identifieur interne :
000B42 ( PascalFrancis/Corpus );
précédent :
000B41;
suivant :
000B43
A reactive approach for solving constraint Satisfaction problems
Auteurs : A. Dury ;
F. Le Ber ;
V. ChevrierSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 1999.
RBID : Pascal:99-0208728
Descripteurs français
English descriptors
Abstract
We propose in this paper a multi-agent model for solving a class of Constraint Satisfaction Problems: the assignment problem. Our work is based on a real-world problem, the assignment of land-use categories in a farming territory, in the north-east of France. This problem exhibits a function to optimize, while respecting a set of constraints, both local (compatibility of grounds and land-use categories) and global (ratio of production between land-use categories). We developed a model using a purely reactive multi-agent system that builds its solution upon conflicts that arise during the resolution process. In this paper, we present the reactive modelling of the problem solving and experimental results from two points of view: the efficiency of the problem being solved and the properties of the problem solving process.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 1555 |
|---|
| A08 | 01 | 1 | ENG | @1 A reactive approach for solving constraint Satisfaction problems |
|---|
| A09 | 01 | 1 | ENG | @1 ATAL '98 : intelligent agents V : agent theories, architectures, and languages : Paris, 4-7 July 1998 |
|---|
| A11 | 01 | 1 | | @1 DURY (A.) |
|---|
| A11 | 02 | 1 | | @1 LE BER (F.) |
|---|
| A11 | 03 | 1 | | @1 CHEVRIER (V.) |
|---|
| A12 | 01 | 1 | | @1 MULLER (Jörg P.) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 SINGH (Munindar P.) @9 ed. |
|---|
| A12 | 03 | 1 | | @1 RAO (Anand S.) @9 ed. |
|---|
| A14 | 01 | | | @1 LORIA, B.P. 239 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut. |
|---|
| A14 | 02 | | | @1 INRA LIAB @2 54280 Champenoux @3 FRA @Z 2 aut. |
|---|
| A20 | | | | @1 397-411 |
|---|
| A21 | | | | @1 1999 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-65713-4 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000074561310260 |
|---|
| A44 | | | | @0 0000 @1 © 1999 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 14 ref. |
|---|
| A47 | 01 | 1 | | @0 99-0208728 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| A66 | 02 | | | @0 USA |
|---|
| C01 | 01 | | ENG | @0 We propose in this paper a multi-agent model for solving a class of Constraint Satisfaction Problems: the assignment problem. Our work is based on a real-world problem, the assignment of land-use categories in a farming territory, in the north-east of France. This problem exhibits a function to optimize, while respecting a set of constraints, both local (compatibility of grounds and land-use categories) and global (ratio of production between land-use categories). We developed a model using a purely reactive multi-agent system that builds its solution upon conflicts that arise during the resolution process. In this paper, we present the reactive modelling of the problem solving and experimental results from two points of view: the efficiency of the problem being solved and the properties of the problem solving process. |
|---|
| C02 | 01 | X | | @0 001D02C05 |
|---|
| C03 | 01 | X | FRE | @0 Système multiagent @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Multiagent system @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Sistema multiagente @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Système intelligent @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Intelligent system @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Sistema inteligente @5 02 |
|---|
| C03 | 03 | 3 | FRE | @0 Système coopératif @5 03 |
|---|
| C03 | 03 | 3 | ENG | @0 Cooperative systems @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Résolution problème @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Problem solving @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Resolución problema @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 |
|---|
| N21 | | | | @1 130 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Intelligent agents. International workshop @2 5 @3 Paris FRA @4 1998-07-04 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 99-0208728 INIST |
|---|
| ET : | A reactive approach for solving constraint Satisfaction problems |
|---|
| AU : | DURY (A.); LE BER (F.); CHEVRIER (V.); MULLER (Jörg P.); SINGH (Munindar P.); RAO (Anand S.) |
|---|
| AF : | LORIA, B.P. 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut., 3 aut.); INRA LIAB/54280 Champenoux/France (2 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1999; Vol. 1555; Pp. 397-411; Bibl. 14 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | We propose in this paper a multi-agent model for solving a class of Constraint Satisfaction Problems: the assignment problem. Our work is based on a real-world problem, the assignment of land-use categories in a farming territory, in the north-east of France. This problem exhibits a function to optimize, while respecting a set of constraints, both local (compatibility of grounds and land-use categories) and global (ratio of production between land-use categories). We developed a model using a purely reactive multi-agent system that builds its solution upon conflicts that arise during the resolution process. In this paper, we present the reactive modelling of the problem solving and experimental results from two points of view: the efficiency of the problem being solved and the properties of the problem solving process. |
|---|
| CC : | 001D02C05 |
|---|
| FD : | Système multiagent; Système intelligent; Système coopératif; Résolution problème; Satisfaction contrainte |
|---|
| ED : | Multiagent system; Intelligent system; Cooperative systems; Problem solving; Constraint satisfaction |
|---|
| SD : | Sistema multiagente; Sistema inteligente; Resolución problema; Satisfaccion restricción |
|---|
| LO : | INIST-16343.354000074561310260 |
|---|
| ID : | 99-0208728 |
|---|
Links to Exploration step
Pascal:99-0208728
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A reactive approach for solving constraint Satisfaction problems</title>
<author><name sortKey="Dury, A" sort="Dury, A" uniqKey="Dury A" first="A." last="Dury">A. Dury</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Le Ber, F" sort="Le Ber, F" uniqKey="Le Ber F" first="F." last="Le Ber">F. Le Ber</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="02"><s1>INRA LIAB</s1>
<s2>54280 Champenoux</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Chevrier, V" sort="Chevrier, V" uniqKey="Chevrier V" first="V." last="Chevrier">V. Chevrier</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">99-0208728</idno>
<date when="1999">1999</date>
<idno type="stanalyst">PASCAL 99-0208728 INIST</idno>
<idno type="RBID">Pascal:99-0208728</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000B42</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A reactive approach for solving constraint Satisfaction problems</title>
<author><name sortKey="Dury, A" sort="Dury, A" uniqKey="Dury A" first="A." last="Dury">A. Dury</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Le Ber, F" sort="Le Ber, F" uniqKey="Le Ber F" first="F." last="Le Ber">F. Le Ber</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="02"><s1>INRA LIAB</s1>
<s2>54280 Champenoux</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Chevrier, V" sort="Chevrier, V" uniqKey="Chevrier V" first="V." last="Chevrier">V. Chevrier</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="1999">1999</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>Constraint satisfaction</term>
<term>Cooperative systems</term>
<term>Intelligent system</term>
<term>Multiagent system</term>
<term>Problem solving</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Système multiagent</term>
<term>Système intelligent</term>
<term>Système coopératif</term>
<term>Résolution problème</term>
<term>Satisfaction contrainte</term>
</keywords><front><div type="abstract" xml:lang="en">We propose in this paper a multi-agent model for solving a class of Constraint Satisfaction Problems: the assignment problem. Our work is based on a real-world problem, the assignment of land-use categories in a farming territory, in the north-east of France. This problem exhibits a function to optimize, while respecting a set of constraints, both local (compatibility of grounds and land-use categories) and global (ratio of production between land-use categories). We developed a model using a purely reactive multi-agent system that builds its solution upon conflicts that arise during the resolution process. In this paper, we present the reactive modelling of the problem solving and experimental results from two points of view: the efficiency of the problem being solved and the properties of the problem solving process.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>1555</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>A reactive approach for solving constraint Satisfaction problems</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>ATAL '98 : intelligent agents V : agent theories, architectures, and languages : Paris, 4-7 July 1998</s1>
</fA09><fA11 i1="01" i2="1"><s1>DURY (A.)</s1>
</fA11><fA11 i1="02" i2="1"><s1>LE BER (F.)</s1>
</fA11><fA11 i1="03" i2="1"><s1>CHEVRIER (V.)</s1>
</fA11><fA12 i1="01" i2="1"><s1>MULLER (Jörg P.)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>SINGH (Munindar P.)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="03" i2="1"><s1>RAO (Anand S.)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>LORIA, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14><fA14 i1="02"><s1>INRA LIAB</s1>
<s2>54280 Champenoux</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14><fA20><s1>397-411</s1>
</fA20><fA21><s1>1999</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-65713-4</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000074561310260</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 1999 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>14 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>99-0208728</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><fA66 i1="02"><s0>USA</s0>
</fA66><fC01 i1="01" l="ENG"><s0>We propose in this paper a multi-agent model for solving a class of Constraint Satisfaction Problems: the assignment problem. Our work is based on a real-world problem, the assignment of land-use categories in a farming territory, in the north-east of France. This problem exhibits a function to optimize, while respecting a set of constraints, both local (compatibility of grounds and land-use categories) and global (ratio of production between land-use categories). We developed a model using a purely reactive multi-agent system that builds its solution upon conflicts that arise during the resolution process. In this paper, we present the reactive modelling of the problem solving and experimental results from two points of view: the efficiency of the problem being solved and the properties of the problem solving process.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02C05</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Système multiagent</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Multiagent system</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Sistema multiagente</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Système intelligent</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Intelligent system</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Sistema inteligente</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="3" l="FRE"><s0>Système coopératif</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="3" l="ENG"><s0>Cooperative systems</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Résolution problème</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Problem solving</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Resolución problema</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><fN21><s1>130</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>Intelligent agents. International workshop</s1>
<s2>5</s2>
<s3>Paris FRA</s3>
<s4>1998-07-04</s4>
</fA30><server><NO>PASCAL 99-0208728 INIST</NO>
<ET>A reactive approach for solving constraint Satisfaction problems</ET>
<AU>DURY (A.); LE BER (F.); CHEVRIER (V.); MULLER (Jörg P.); SINGH (Munindar P.); RAO (Anand S.)</AU>
<AF>LORIA, B.P. 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut., 3 aut.); INRA LIAB/54280 Champenoux/France (2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1999; Vol. 1555; Pp. 397-411; Bibl. 14 ref.</SO>
<LA>Anglais</LA>
<EA>We propose in this paper a multi-agent model for solving a class of Constraint Satisfaction Problems: the assignment problem. Our work is based on a real-world problem, the assignment of land-use categories in a farming territory, in the north-east of France. This problem exhibits a function to optimize, while respecting a set of constraints, both local (compatibility of grounds and land-use categories) and global (ratio of production between land-use categories). We developed a model using a purely reactive multi-agent system that builds its solution upon conflicts that arise during the resolution process. In this paper, we present the reactive modelling of the problem solving and experimental results from two points of view: the efficiency of the problem being solved and the properties of the problem solving process.</EA>
<CC>001D02C05</CC>
<FD>Système multiagent; Système intelligent; Système coopératif; Résolution problème; Satisfaction contrainte</FD>
<ED>Multiagent system; Intelligent system; Cooperative systems; Problem solving; Constraint satisfaction</ED>
<SD>Sistema multiagente; Sistema inteligente; Resolución problema; Satisfaccion restricción</SD>
<LO>INIST-16343.354000074561310260</LO>
<ID>99-0208728</ID>
</server>
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 000B42 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000B42 | 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:99-0208728
|texte= A reactive approach for solving constraint Satisfaction problems
}}
| 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 |  |
