AustralieFrV1, PascalFrancis, Corpus, bibRecord, 002762

RANGE and ROOTS: Two common patterns for specifying and propagating counting and occurrence constraints

Identifieur interne : 002762 ( PascalFrancis/Corpus ); précédent : 002761; suivant : 002763

RANGE and ROOTS: Two common patterns for specifying and propagating counting and occurrence constraints

Auteurs : Christian Bessiere ; Emmanuel Hebrard ; Brahim Hnich ; Zeynep Kiziltan ; Toby Walsh

Source :

Artificial intelligence [ 0004-3702 ] ; 2009.

RBID : Pascal:10-0174871

Descripteurs français

Pascal (Inist)
- Intelligence artificielle, Indice aptitude, Compétitivité, Comptage, Satisfaction contrainte, Optimisation sous contrainte, ..

English descriptors

KwdEn :
- Artificial intelligence, Capability index, Competitiveness, Constrained optimization, Constraint satisfaction, Counting.

Abstract

We propose RANGE and ROOTS which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algorithm. To illustrate the capabilities of the RANGE and ROOTS constraints, we specify a number of global constraints taken from the literature. Preliminary experiments demonstrate that propagating counting and occurrence constraints using these two patterns leads to a small loss in performance when compared to specialised global constraints and is competitive with alternative decompositions using elementary constraints.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0004-3702`
A02	`01`			`@0 AINTBB`
A03		`1`		`@0 Artif. intell.`
A05				`@2 173`
A06				`@2 11`
A08	`01`	`1`	`ENG`	`@1 RANGE and ROOTS: Two common patterns for specifying and propagating counting and occurrence constraints`
A11	`01`	`1`		`@1 BESSIERE (Christian)`
A11	`02`	`1`		`@1 HEBRARD (Emmanuel)`
A11	`03`	`1`		`@1 HNICH (Brahim)`
A11	`04`	`1`		`@1 KIZILTAN (Zeynep)`
A11	`05`	`1`		`@1 WALSH (Toby)`
A14	`01`			`@1 LIRMM, CNRS and U. Montpellier @2 Montpellier @3 FRA @Z 1 aut.`
A14	`02`			`@1 4C and UCC @2 Cork @3 IRL @Z 2 aut.`
A14	`03`			`@1 Izmir University of Economics @2 Izmir @3 TUR @Z 3 aut.`
A14	`04`			`@1 Department of Computer Science, Univ. di Bologna @3 ITA @Z 4 aut.`
A14	`05`			`@1 NICTA and UNSW @2 Sydney @3 AUS @Z 5 aut.`
A20				`@1 1054-1078`
A21				`@1 2009`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 15159 @5 354000188600990020`
A44				`@0 0000 @1 © 2010 INIST-CNRS. All rights reserved.`
A45				`@0 31 ref.`
A47	`01`	`1`		`@0 10-0174871`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Artificial intelligence`
A66	`01`			`@0 GBR`
C01	`01`		`ENG`	@0 We propose RANGE and ROOTS which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algorithm. To illustrate the capabilities of the RANGE and ROOTS constraints, we specify a number of global constraints taken from the literature. Preliminary experiments demonstrate that propagating counting and occurrence constraints using these two patterns leads to a small loss in performance when compared to specialised global constraints and is competitive with alternative decompositions using elementary constraints.
C02	`01`	`X`		`@0 001D02A05`
C02	`02`	`X`		`@0 001D02C02`
C03	`01`	`X`	`FRE`	`@0 Intelligence artificielle @5 01`
C03	`01`	`X`	`ENG`	`@0 Artificial intelligence @5 01`
C03	`01`	`X`	`SPA`	`@0 Inteligencia artificial @5 01`
C03	`02`	`X`	`FRE`	`@0 Indice aptitude @5 18`
C03	`02`	`X`	`ENG`	`@0 Capability index @5 18`
C03	`02`	`X`	`SPA`	`@0 Indice aptitud @5 18`
C03	`03`	`X`	`FRE`	`@0 Compétitivité @5 19`
C03	`03`	`X`	`ENG`	`@0 Competitiveness @5 19`
C03	`03`	`X`	`SPA`	`@0 Competitividad @5 19`
C03	`04`	`X`	`FRE`	`@0 Comptage @5 23`
C03	`04`	`X`	`ENG`	`@0 Counting @5 23`
C03	`04`	`X`	`SPA`	`@0 Contaje @5 23`
C03	`05`	`X`	`FRE`	`@0 Satisfaction contrainte @5 24`
C03	`05`	`X`	`ENG`	`@0 Constraint satisfaction @5 24`
C03	`05`	`X`	`SPA`	`@0 Satisfaccion restricción @5 24`
C03	`06`	`X`	`FRE`	`@0 Optimisation sous contrainte @5 25`
C03	`06`	`X`	`ENG`	`@0 Constrained optimization @5 25`
C03	`06`	`X`	`SPA`	`@0 Optimización con restricción @5 25`
C03	`07`	`X`	`FRE`	`@0 . @4 INC @5 82`
N21				`@1 116`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

Format Inist (serveur)

NO :	PASCAL 10-0174871 INIST
ET :	RANGE and ROOTS: Two common patterns for specifying and propagating counting and occurrence constraints
AU :	BESSIERE (Christian); HEBRARD (Emmanuel); HNICH (Brahim); KIZILTAN (Zeynep); WALSH (Toby)
AF :	LIRMM, CNRS and U. Montpellier/Montpellier/France (1 aut.); 4C and UCC/Cork/Irlande (2 aut.); Izmir University of Economics/Izmir/Turquie (3 aut.); Department of Computer Science, Univ. di Bologna/Italie (4 aut.); NICTA and UNSW/Sydney/Australie (5 aut.)
DT :	Publication en série; Niveau analytique
SO :	Artificial intelligence; ISSN 0004-3702; Coden AINTBB; Royaume-Uni; Da. 2009; Vol. 173; No. 11; Pp. 1054-1078; Bibl. 31 ref.
LA :	Anglais
EA :	We propose RANGE and ROOTS which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algorithm. To illustrate the capabilities of the RANGE and ROOTS constraints, we specify a number of global constraints taken from the literature. Preliminary experiments demonstrate that propagating counting and occurrence constraints using these two patterns leads to a small loss in performance when compared to specialised global constraints and is competitive with alternative decompositions using elementary constraints.
CC :	001D02A05; 001D02C02
FD :	Intelligence artificielle; Indice aptitude; Compétitivité; Comptage; Satisfaction contrainte; Optimisation sous contrainte; .
ED :	Artificial intelligence; Capability index; Competitiveness; Counting; Constraint satisfaction; Constrained optimization
SD :	Inteligencia artificial; Indice aptitud; Competitividad; Contaje; Satisfaccion restricción; Optimización con restricción
LO :	INIST-15159.354000188600990020
ID :	10-0174871

Links to Exploration step

Pascal:10-0174871

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">RANGE and ROOTS: Two common patterns for specifying and propagating counting and occurrence constraints</title>
<author><name sortKey="Bessiere, Christian" sort="Bessiere, Christian" uniqKey="Bessiere C" first="Christian" last="Bessiere">Christian Bessiere</name>
<affiliation><inist:fA14 i1="01"><s1>LIRMM, CNRS and U. Montpellier</s1>
<s2>Montpellier</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Hebrard, Emmanuel" sort="Hebrard, Emmanuel" uniqKey="Hebrard E" first="Emmanuel" last="Hebrard">Emmanuel Hebrard</name>
<affiliation><inist:fA14 i1="02"><s1>4C and UCC</s1>
<s2>Cork</s2>
<s3>IRL</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Hnich, Brahim" sort="Hnich, Brahim" uniqKey="Hnich B" first="Brahim" last="Hnich">Brahim Hnich</name>
<affiliation><inist:fA14 i1="03"><s1>Izmir University of Economics</s1>
<s2>Izmir</s2>
<s3>TUR</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kiziltan, Zeynep" sort="Kiziltan, Zeynep" uniqKey="Kiziltan Z" first="Zeynep" last="Kiziltan">Zeynep Kiziltan</name>
<affiliation><inist:fA14 i1="04"><s1>Department of Computer Science, Univ. di Bologna</s1>
<s3>ITA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Walsh, Toby" sort="Walsh, Toby" uniqKey="Walsh T" first="Toby" last="Walsh">Toby Walsh</name>
<affiliation><inist:fA14 i1="05"><s1>NICTA and UNSW</s1>
<s2>Sydney</s2>
<s3>AUS</s3>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">10-0174871</idno>
<date when="2009">2009</date>
<idno type="stanalyst">PASCAL 10-0174871 INIST</idno>
<idno type="RBID">Pascal:10-0174871</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">002762</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">RANGE and ROOTS: Two common patterns for specifying and propagating counting and occurrence constraints</title>
<author><name sortKey="Bessiere, Christian" sort="Bessiere, Christian" uniqKey="Bessiere C" first="Christian" last="Bessiere">Christian Bessiere</name>
<affiliation><inist:fA14 i1="01"><s1>LIRMM, CNRS and U. Montpellier</s1>
<s2>Montpellier</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Hebrard, Emmanuel" sort="Hebrard, Emmanuel" uniqKey="Hebrard E" first="Emmanuel" last="Hebrard">Emmanuel Hebrard</name>
<affiliation><inist:fA14 i1="02"><s1>4C and UCC</s1>
<s2>Cork</s2>
<s3>IRL</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Hnich, Brahim" sort="Hnich, Brahim" uniqKey="Hnich B" first="Brahim" last="Hnich">Brahim Hnich</name>
<affiliation><inist:fA14 i1="03"><s1>Izmir University of Economics</s1>
<s2>Izmir</s2>
<s3>TUR</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kiziltan, Zeynep" sort="Kiziltan, Zeynep" uniqKey="Kiziltan Z" first="Zeynep" last="Kiziltan">Zeynep Kiziltan</name>
<affiliation><inist:fA14 i1="04"><s1>Department of Computer Science, Univ. di Bologna</s1>
<s3>ITA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Walsh, Toby" sort="Walsh, Toby" uniqKey="Walsh T" first="Toby" last="Walsh">Toby Walsh</name>
<affiliation><inist:fA14 i1="05"><s1>NICTA and UNSW</s1>
<s2>Sydney</s2>
<s3>AUS</s3>
<sZ>5 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Artificial intelligence</title>
<title level="j" type="abbreviated">Artif. intell.</title>
<idno type="ISSN">0004-3702</idno>
<imprint><date when="2009">2009</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Artificial intelligence</title>
<title level="j" type="abbreviated">Artif. intell.</title>
<idno type="ISSN">0004-3702</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Artificial intelligence</term>
<term>Capability index</term>
<term>Competitiveness</term>
<term>Constrained optimization</term>
<term>Constraint satisfaction</term>
<term>Counting</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Intelligence artificielle</term>
<term>Indice aptitude</term>
<term>Compétitivité</term>
<term>Comptage</term>
<term>Satisfaction contrainte</term>
<term>Optimisation sous contrainte</term>
<term>.</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We propose RANGE and ROOTS which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algorithm. To illustrate the capabilities of the RANGE and ROOTS constraints, we specify a number of global constraints taken from the literature. Preliminary experiments demonstrate that propagating counting and occurrence constraints using these two patterns leads to a small loss in performance when compared to specialised global constraints and is competitive with alternative decompositions using elementary constraints.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0004-3702</s0>
</fA01>
<fA02 i1="01"><s0>AINTBB</s0>
</fA02>
<fA03 i2="1"><s0>Artif. intell.</s0>
</fA03>
<fA05><s2>173</s2>
</fA05>
<fA06><s2>11</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>RANGE and ROOTS: Two common patterns for specifying and propagating counting and occurrence constraints</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>BESSIERE (Christian)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>HEBRARD (Emmanuel)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>HNICH (Brahim)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>KIZILTAN (Zeynep)</s1>
</fA11>
<fA11 i1="05" i2="1"><s1>WALSH (Toby)</s1>
</fA11>
<fA14 i1="01"><s1>LIRMM, CNRS and U. Montpellier</s1>
<s2>Montpellier</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>4C and UCC</s1>
<s2>Cork</s2>
<s3>IRL</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>Izmir University of Economics</s1>
<s2>Izmir</s2>
<s3>TUR</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="04"><s1>Department of Computer Science, Univ. di Bologna</s1>
<s3>ITA</s3>
<sZ>4 aut.</sZ>
</fA14>
<fA14 i1="05"><s1>NICTA and UNSW</s1>
<s2>Sydney</s2>
<s3>AUS</s3>
<sZ>5 aut.</sZ>
</fA14>
<fA20><s1>1054-1078</s1>
</fA20>
<fA21><s1>2009</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>15159</s2>
<s5>354000188600990020</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2010 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>31 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>10-0174871</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Artificial intelligence</s0>
</fA64>
<fA66 i1="01"><s0>GBR</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We propose RANGE and ROOTS which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algorithm. To illustrate the capabilities of the RANGE and ROOTS constraints, we specify a number of global constraints taken from the literature. Preliminary experiments demonstrate that propagating counting and occurrence constraints using these two patterns leads to a small loss in performance when compared to specialised global constraints and is competitive with alternative decompositions using elementary constraints.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02C02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Intelligence artificielle</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Artificial intelligence</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Inteligencia artificial</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Indice aptitude</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Capability index</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Indice aptitud</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Compétitivité</s0>
<s5>19</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Competitiveness</s0>
<s5>19</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Competitividad</s0>
<s5>19</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Comptage</s0>
<s5>23</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Counting</s0>
<s5>23</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Contaje</s0>
<s5>23</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Satisfaction contrainte</s0>
<s5>24</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Constraint satisfaction</s0>
<s5>24</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Satisfaccion restricción</s0>
<s5>24</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Optimisation sous contrainte</s0>
<s5>25</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Constrained optimization</s0>
<s5>25</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Optimización con restricción</s0>
<s5>25</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>.</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fN21><s1>116</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 10-0174871 INIST</NO>
<ET>RANGE and ROOTS: Two common patterns for specifying and propagating counting and occurrence constraints</ET>
<AU>BESSIERE (Christian); HEBRARD (Emmanuel); HNICH (Brahim); KIZILTAN (Zeynep); WALSH (Toby)</AU>
<AF>LIRMM, CNRS and U. Montpellier/Montpellier/France (1 aut.); 4C and UCC/Cork/Irlande (2 aut.); Izmir University of Economics/Izmir/Turquie (3 aut.); Department of Computer Science, Univ. di Bologna/Italie (4 aut.); NICTA and UNSW/Sydney/Australie (5 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Artificial intelligence; ISSN 0004-3702; Coden AINTBB; Royaume-Uni; Da. 2009; Vol. 173; No. 11; Pp. 1054-1078; Bibl. 31 ref.</SO>
<LA>Anglais</LA>
<EA>We propose RANGE and ROOTS which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints specified using these patterns thus directly inherit a propagation algorithm. To illustrate the capabilities of the RANGE and ROOTS constraints, we specify a number of global constraints taken from the literature. Preliminary experiments demonstrate that propagating counting and occurrence constraints using these two patterns leads to a small loss in performance when compared to specialised global constraints and is competitive with alternative decompositions using elementary constraints.</EA>
<CC>001D02A05; 001D02C02</CC>
<FD>Intelligence artificielle; Indice aptitude; Compétitivité; Comptage; Satisfaction contrainte; Optimisation sous contrainte; .</FD>
<ED>Artificial intelligence; Capability index; Competitiveness; Counting; Constraint satisfaction; Constrained optimization</ED>
<SD>Inteligencia artificial; Indice aptitud; Competitividad; Contaje; Satisfaccion restricción; Optimización con restricción</SD>
<LO>INIST-15159.354000188600990020</LO>
<ID>10-0174871</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/PascalFrancis/Corpus

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

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

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

{{Explor lien
   |wiki=    Wicri/Asie
   |area=    AustralieFrV1
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:10-0174871
   |texte=   RANGE and ROOTS: Two common patterns for specifying and propagating counting and occurrence constraints
}}

This area was generated with Dilib version V0.6.33.
Data generation: Tue Dec 5 10:43:12 2017. Site generation: Tue Mar 5 14:07:20 2024

	Serveur d'exploration sur les relations entre la France et l'Australie
	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 les relations entre la France et l'Australie

RANGE and ROOTS: Two common patterns for specifying and propagating counting and occurrence constraints

RANGE and ROOTS: Two common patterns for specifying and propagating counting and occurrence constraints

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