<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462020000200453</article-id>
<article-id pub-id-type="doi">10.13053/cys-24-2-3371</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A Fuzzy Multi-Agent Problem: A General Depiction and its Logic Programming-based Application]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Jobczyk]]></surname>
<given-names><![CDATA[Krystian]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ga&#322;czy&#324;ski]]></surname>
<given-names><![CDATA[Patryk]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Lig&#281;za]]></surname>
<given-names><![CDATA[Antoni]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,University of Science and Technology Department of Applied Computer Science ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Poland</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2020</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2020</year>
</pub-date>
<volume>24</volume>
<numero>2</numero>
<fpage>453</fpage>
<lpage>467</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462020000200453&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462020000200453&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462020000200453&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: A Multi-Agent Problem (MAP) may be seen as a class of planning and scheduling problems with multiple interacting intelligent agants. These problems may be naturally expressible and solveable by means of solvers of such programming languages as PROLOG. MAP is sometimes fuzzified because of a vagueness of information, for example &#8211; about abilities and preferences of interacting agents. Simoultaneously, MAP naturally stems from different variants of Constraints Satisfaction Problems (CSP). This property should be preserved in each fuzzy extension of this problem. According to these requirements and expectations a Fuzzy Multi-Agent Problem (FMAP) as referred to CSP and its PROLOG-based solutions are considered in the paper. Finally, a brief discussion of the achieved solutions is also carried out. An effectiveness of this PROLOG-based approach exploits a multi-valency-based approximation of fuzziness in programming contexts.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Multi-agent problem]]></kwd>
<kwd lng="en"><![CDATA[fuzzy multi-agent problem]]></kwd>
<kwd lng="en"><![CDATA[logic programming]]></kwd>
<kwd lng="en"><![CDATA[PROLOG]]></kwd>
<kwd lng="en"><![CDATA[simple temporal problem under uncertainty]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Curtois]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Qu]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Berghe]]></surname>
<given-names><![CDATA[G. V.]]></given-names>
</name>
</person-group>
<source><![CDATA[A scatter search approach to the nurse rostering problem]]></source>
<year>2007</year>
<publisher-name><![CDATA[School of Computer Science and Information Technology, University of Nottingham]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cetin]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Sarucan]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Nurse scheduling using binary fuzzy goal programming]]></source>
<year>2014</year>
<conf-name><![CDATA[ ICAMSAO]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-6</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cheang]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Lim]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Rodrigues]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Nurse rostering problems&#8211;a bibliographic survey]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2003</year>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dechter]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Meiri]]></surname>
</name>
<name>
<surname><![CDATA[Pearl]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On fuzzy temporal constraints networks]]></article-title>
<source><![CDATA[Temporal constraints network]]></source>
<year>1991</year>
<volume>49</volume>
<numero>1-3</numero>
<issue>1-3</issue>
<page-range>61-95</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ernst]]></surname>
<given-names><![CDATA[A. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Krishnamoorthy]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Sier]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Staff scheduling and rostering: A review of applications, methods and models]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year></year>
<volume>153</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>3-27</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Felici]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Gentile]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A polyhedral approach for the staff rostering problem]]></article-title>
<source><![CDATA[Management Science]]></source>
<year>2004</year>
<volume>50</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>381-94</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Iranzo]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Rubio-Manzano]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Bousi-prolog: A fuzzy programming language for modelling vague knowledge and approximate reasoning]]></source>
<year>2010</year>
<conf-name><![CDATA[ IJCCI]]></conf-name>
<conf-loc> </conf-loc>
<page-range>93-8</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Iranzo]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Rubio-Manzano]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[A programming environment for bousi-prolog]]></source>
<year>2010</year>
<conf-name><![CDATA[ IC]]></conf-name>
<conf-loc> </conf-loc>
<page-range>36-42</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jobczyk]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Temporal Planning with Fuzzy Constraints and Preferences]]></source>
<year>2017</year>
<publisher-name><![CDATA[Normandy University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jobczyk]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Ligeza]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Multi-valued halpern-shoham logic for temporal allen&#8217;s relations and preferences]]></source>
<year>2016</year>
<conf-name><![CDATA[ annual international conference of Fuzzy Systems (FuzzIEEE)]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jobczyk]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Ligeza]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Towards a new convolution-based approach to the specification of stpu-solutions]]></source>
<year>2016</year>
<conf-name><![CDATA[ FUZZ-IEEE]]></conf-name>
<conf-loc> </conf-loc>
<page-range>782-9</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jobczyk]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Ligeza]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Dynamic epistemic preferential logic of action]]></source>
<year>2017</year>
<volume>2</volume>
<conf-name><![CDATA[ ICAISC]]></conf-name>
<conf-loc> </conf-loc>
<page-range>243-54</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jobczyk]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[M.]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Ligeza]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Karczmarczuk]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Fuzzy integral logic expressible by convolutions]]></source>
<year>2014</year>
<conf-name><![CDATA[ ECAI&#8217;2014]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1042-3</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jobczyk]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[M.]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Ligeza]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Karczmarczuk]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Comparative approach to the multi-valued logic construction for preferences]]></source>
<year>2015</year>
<conf-name><![CDATA[ ICAISC&#8217;15]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Khatib]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Morris]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Morris]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Rossi]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Temporal reasoning about preferences]]></source>
<year>2001</year>
<conf-name><![CDATA[ IJCAI-01]]></conf-name>
<conf-loc> </conf-loc>
<page-range>322-7</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Leierson]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Saxe]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[A mixed-integer linear programming problem which is efficiently solvable]]></source>
<year>1983</year>
<conf-name><![CDATA[ 21st Annual Alerton Conference on Communications, Control, and Computing]]></conf-name>
<conf-loc> </conf-loc>
<page-range>204-13</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lepegue]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Prot]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Bellenguez-Morineau]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A tour scheduling problem with fixed jobs: use of constraint programming]]></article-title>
<source><![CDATA[Practice and Theory of Automated Timetabling]]></source>
<year>2012</year>
<page-range>29-31</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liao]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Wong]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An algorithm to compact a vlsi symbolic layout with mixed constraints]]></article-title>
<source><![CDATA[IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems]]></source>
<year>1983</year>
<volume>2</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>62-9</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Jing]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multi-agent oriented constraints satisfaction]]></article-title>
<source><![CDATA[Artificial Intelligence]]></source>
<year>2002</year>
<volume>136</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>101-44</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mailler]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Lesser]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Asynchronous partial overlay: A new algorithm for solving distributed constraints satisfaction problems]]></article-title>
<source><![CDATA[Journal of Artificial Intelligence Research]]></source>
<year>2006</year>
<volume>25</volume>
<page-range>529-76</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Metivier]]></surname>
<given-names><![CDATA[J.-P.]]></given-names>
</name>
<name>
<surname><![CDATA[Boizumault]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Loudni]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Solving nurse rostering problems using soft global constraints]]></source>
<year>2009</year>
<conf-name><![CDATA[ 15th international conference on Principles and practice of constraint programming, CP&#8217;09]]></conf-name>
<conf-loc> </conf-loc>
<page-range>73-87</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Modi]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Shen]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Tambe]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Yakoo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Asynchronous distributed constraint optimization with quality guarantees]]></article-title>
<source><![CDATA[Artificial Intelligence]]></source>
<year>2005</year>
<volume>161</volume>
<page-range>149-80</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Qu]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[He]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[A hybrid constraint programming approach for nurse rostering prolems]]></source>
<year>2008</year>
<publisher-name><![CDATA[School of Computer Science]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rossi]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Yorke-Smith]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Venable]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Temporal reasoning with preferences and uncertainty]]></source>
<year>2003</year>
<volume>8</volume>
<conf-name><![CDATA[ AAAI]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1385-6</page-range></nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Selim]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Topaloglu]]></surname>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Nurse scheduling using modeling approach]]></article-title>
<source><![CDATA[Fuzzy Sets and Systems]]></source>
<year>2004</year>
<volume>161</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>1543-63</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shostak]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Deciding linear inequalities by computing loop residues]]></article-title>
<source><![CDATA[Journal of ACM]]></source>
<year>1981</year>
<volume>28</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>769-79</page-range></nlm-citation>
</ref>
<ref id="B27">
<label>27</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Spivak]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Category theory for the sciences]]></source>
<year>2014</year>
<publisher-name><![CDATA[Cambridge Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<label>28</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Traverso]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Ghallab]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Nau]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Automated Planning: theory and practice]]></source>
<year>1997</year>
<volume>2004</volume>
<publisher-name><![CDATA[Elsevier]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B29">
<label>29</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vidal]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Fargier]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Handling contingency in temporal constraints networks: From consistency to controllabilities]]></article-title>
<source><![CDATA[Journal of Experimental and Technical Artificial Intelligence]]></source>
<year>1999</year>
<volume>11</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>23-45</page-range></nlm-citation>
</ref>
<ref id="B30">
<label>30</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yokoo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Distributed Constraints Satisfaction: Foundation of Cooperation in Multi-Agent System]]></source>
<year>2001</year>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
