InforLorV4, PascalFrancis, Corpus, bibRecord, 000995

Generating propagation rules for finite domains : A mixed approach

Identifieur interne : 000995 ( PascalFrancis/Corpus ); précédent : 000994; suivant : 000996

Generating propagation rules for finite domains : A mixed approach

Auteurs : C. Ringeissen ; E. Monfroy

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2000.

RBID : Pascal:01-0034696

Descripteurs français

Pascal (Inist)
- Résolution(math), Déduction, Programmation logique avec contrainte, Génération automatique, Intégration, Unification, Méthode mixte, Règle calcul, Logique, Langage programmation, Programmation logique, Algorithme, Satisfaction contrainte, 0260C, Constraint solving technique, Constraint propagation, Constraint handling rules, Deduction rules, Finite domain, Unification algorithm, Declarative programming, Technique résolution contrainte, Règles déduction, Algorithme unification, Programmation déclarative.

English descriptors

KwdEn :
- Algorithms, Automatic generation, Constraint logic programming, Constraint satisfaction, Constraint solving technique, Declarative programming, Deduction, Deduction rules, Integration, Logic, Logic programming, Mixed method, Programming languages, Slide rule, Solving, Unification, Unification algorithm.

Abstract

Constraint solving techniques are frequently based on constraint propagation, a technique that can be seen as a specific form of deduction. Using constraint programming languages enhanced with constraint handling rules facilities, constraint propagation can be achieved just by applying deduction rules to constraints. The automatic generation of propagation rules has been recently investigated in the particular case of finite domains, when constraint satisfaction problems are based on predefined, explicitly given constraints. Due to its interest for practical applications, several solvers have been developed during the last decade for integrating finite domains into (constraint) logic programming. A possible way of integration is implemented using a unification algorithm to compute most general solutions of constraints. In this paper, we propose a mixed approach for designing finite domain constraints solvers: it consists in using a solver based on unification to improve the generation of propagation rules.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 1865`
A08	`01`	`1`	`ENG`	`@1 Generating propagation rules for finite domains : A mixed approach`
A09	`01`	`1`	`ENG`	`@1 New trends in constraints : Paphos, 25-27 October 1999, selected papers`
A11	`01`	`1`		`@1 RINGEISSEN (C.)`
A11	`02`	`1`		`@1 MONFROY (E.)`
A12	`01`	`1`		`@1 APT (Krzysztof R.) @9 ed.`
A12	`02`	`1`		`@1 KAKAS (Antonis C.) @9 ed.`
A12	`03`	`1`		`@1 MONFROY (Eric) @9 ed.`
A12	`04`	`1`		`@1 ROSSI (Francesca) @9 ed.`
A14	`01`			`@1 LORIA-INRIA, 615 rue du Jardin Botanique, 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 150-172`
A21				`@1 2000`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-67885-9`
A43	`01`			`@1 INIST @2 16343 @5 354000090095240080`
A44				`@0 0000 @1 © 2001 INIST-CNRS. All rights reserved.`
A45				`@0 17 ref.`
A47	`01`	`1`		`@0 01-0034696`
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`
A68	`01`	`1`	`FRE`	`@1 Génération de Règles de Propagation pour Domaine Fini : Une Approche Mixte`
C01	`01`		`ENG`	@0 Constraint solving techniques are frequently based on constraint propagation, a technique that can be seen as a specific form of deduction. Using constraint programming languages enhanced with constraint handling rules facilities, constraint propagation can be achieved just by applying deduction rules to constraints. The automatic generation of propagation rules has been recently investigated in the particular case of finite domains, when constraint satisfaction problems are based on predefined, explicitly given constraints. Due to its interest for practical applications, several solvers have been developed during the last decade for integrating finite domains into (constraint) logic programming. A possible way of integration is implemented using a unification algorithm to compute most general solutions of constraints. In this paper, we propose a mixed approach for designing finite domain constraints solvers: it consists in using a solver based on unification to improve the generation of propagation rules.
C02	`01`	`3`		`@0 001B00B60C`
C02	`02`	`X`		`@0 001D02A07`
C02	`03`	`X`		`@0 001D02C05`
C03	`01`	`X`	`FRE`	`@0 Résolution(math) @5 01`
C03	`01`	`X`	`ENG`	`@0 Solving @5 01`
C03	`01`	`X`	`SPA`	`@0 Resolución (matemática) @5 01`
C03	`02`	`X`	`FRE`	`@0 Déduction @5 02`
C03	`02`	`X`	`ENG`	`@0 Deduction @5 02`
C03	`02`	`X`	`SPA`	`@0 Deducción @5 02`
C03	`03`	`X`	`FRE`	`@0 Programmation logique avec contrainte @5 03`
C03	`03`	`X`	`ENG`	`@0 Constraint logic programming @5 03`
C03	`03`	`X`	`SPA`	`@0 Programación lógica con restricción @5 03`
C03	`04`	`X`	`FRE`	`@0 Génération automatique @5 04`
C03	`04`	`X`	`ENG`	`@0 Automatic generation @5 04`
C03	`04`	`X`	`SPA`	`@0 Generación automatica @5 04`
C03	`05`	`3`	`FRE`	`@0 Intégration @5 05`
C03	`05`	`3`	`ENG`	`@0 Integration @5 05`
C03	`06`	`X`	`FRE`	`@0 Unification @5 06`
C03	`06`	`X`	`ENG`	`@0 Unification @5 06`
C03	`06`	`X`	`SPA`	`@0 Unificación @5 06`
C03	`07`	`X`	`FRE`	`@0 Méthode mixte @5 07`
C03	`07`	`X`	`ENG`	`@0 Mixed method @5 07`
C03	`07`	`X`	`SPA`	`@0 Método mixto @5 07`
C03	`08`	`X`	`FRE`	`@0 Règle calcul @5 11`
C03	`08`	`X`	`ENG`	`@0 Slide rule @5 11`
C03	`08`	`X`	`SPA`	`@0 Regla cálculo @5 11`
C03	`09`	`3`	`FRE`	`@0 Logique @5 12`
C03	`09`	`3`	`ENG`	`@0 Logic @5 12`
C03	`10`	`3`	`FRE`	`@0 Langage programmation @5 13`
C03	`10`	`3`	`ENG`	`@0 Programming languages @5 13`
C03	`11`	`3`	`FRE`	`@0 Programmation logique @5 14`
C03	`11`	`3`	`ENG`	`@0 Logic programming @5 14`
C03	`12`	`3`	`FRE`	`@0 Algorithme @5 15`
C03	`12`	`3`	`ENG`	`@0 Algorithms @5 15`
C03	`13`	`X`	`FRE`	`@0 Satisfaction contrainte @5 16`
C03	`13`	`X`	`ENG`	`@0 Constraint satisfaction @5 16`
C03	`13`	`X`	`SPA`	`@0 Satisfaccion restricción @5 16`
C03	`14`	`3`	`FRE`	`@0 0260C @2 PAC @4 INC @5 56`
C03	`15`	`3`	`FRE`	`@0 Constraint solving technique @4 INC @5 82`
C03	`16`	`3`	`FRE`	`@0 Constraint propagation @4 INC @5 83`
C03	`17`	`3`	`FRE`	`@0 Constraint handling rules @4 INC @5 84`
C03	`18`	`3`	`FRE`	`@0 Deduction rules @4 INC @5 85`
C03	`19`	`3`	`FRE`	`@0 Finite domain @4 INC @5 86`
C03	`20`	`3`	`FRE`	`@0 Unification algorithm @4 INC @5 87`
C03	`21`	`3`	`FRE`	`@0 Declarative programming @4 INC @5 88`
C03	`22`	`3`	`FRE`	`@0 Technique résolution contrainte @4 CD @5 96`
C03	`22`	`3`	`ENG`	`@0 Constraint solving technique @4 CD @5 96`
C03	`23`	`3`	`FRE`	`@0 Règles déduction @4 CD @5 97`
C03	`23`	`3`	`ENG`	`@0 Deduction rules @4 CD @5 97`
C03	`24`	`3`	`FRE`	`@0 Algorithme unification @4 CD @5 98`
C03	`24`	`3`	`ENG`	`@0 Unification algorithm @4 CD @5 98`
C03	`25`	`3`	`FRE`	`@0 Programmation déclarative @4 CD @5 99`
C03	`25`	`3`	`ENG`	`@0 Declarative programming @4 CD @5 99`
N21				`@1 022`

A30	`01`	`1`	`ENG`	`@1 Joint ERCIM/Compulog net workshop @3 Paphos CYP @4 1999-10-25`

Format Inist (serveur)

NO :	PASCAL 01-0034696 INIST
FT :	(Génération de Règles de Propagation pour Domaine Fini : Une Approche Mixte)
ET :	Generating propagation rules for finite domains : A mixed approach
AU :	RINGEISSEN (C.); MONFROY (E.); APT (Krzysztof R.); KAKAS (Antonis C.); MONFROY (Eric); ROSSI (Francesca)
AF :	LORIA-INRIA, 615 rue du Jardin Botanique, BP 101/54602 Villers-lès-Nancy/France (1 aut.); CWI, P.O. Box 94079/1090 GB Amsterdam/Pays-Bas (2 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2000; Vol. 1865; Pp. 150-172; Bibl. 17 ref.
LA :	Anglais
EA :	Constraint solving techniques are frequently based on constraint propagation, a technique that can be seen as a specific form of deduction. Using constraint programming languages enhanced with constraint handling rules facilities, constraint propagation can be achieved just by applying deduction rules to constraints. The automatic generation of propagation rules has been recently investigated in the particular case of finite domains, when constraint satisfaction problems are based on predefined, explicitly given constraints. Due to its interest for practical applications, several solvers have been developed during the last decade for integrating finite domains into (constraint) logic programming. A possible way of integration is implemented using a unification algorithm to compute most general solutions of constraints. In this paper, we propose a mixed approach for designing finite domain constraints solvers: it consists in using a solver based on unification to improve the generation of propagation rules.
CC :	001B00B60C; 001D02A07; 001D02C05
FD :	Résolution(math); Déduction; Programmation logique avec contrainte; Génération automatique; Intégration; Unification; Méthode mixte; Règle calcul; Logique; Langage programmation; Programmation logique; Algorithme; Satisfaction contrainte; 0260C; Constraint solving technique; Constraint propagation; Constraint handling rules; Deduction rules; Finite domain; Unification algorithm; Declarative programming; Technique résolution contrainte; Règles déduction; Algorithme unification; Programmation déclarative
ED :	Solving; Deduction; Constraint logic programming; Automatic generation; Integration; Unification; Mixed method; Slide rule; Logic; Programming languages; Logic programming; Algorithms; Constraint satisfaction; Constraint solving technique; Deduction rules; Unification algorithm; Declarative programming
SD :	Resolución (matemática); Deducción; Programación lógica con restricción; Generación automatica; Unificación; Método mixto; Regla cálculo; Satisfaccion restricción
LO :	INIST-16343.354000090095240080
ID :	01-0034696

Links to Exploration step

Pascal:01-0034696

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Generating propagation rules for finite domains : A mixed approach</title>
<author><name sortKey="Ringeissen, C" sort="Ringeissen, C" uniqKey="Ringeissen C" first="C." last="Ringeissen">C. Ringeissen</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA, 615 rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Monfroy, E" sort="Monfroy, E" uniqKey="Monfroy E" first="E." last="Monfroy">E. Monfroy</name>
<affiliation><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>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">01-0034696</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 01-0034696 INIST</idno>
<idno type="RBID">Pascal:01-0034696</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000995</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Generating propagation rules for finite domains : A mixed approach</title>
<author><name sortKey="Ringeissen, C" sort="Ringeissen, C" uniqKey="Ringeissen C" first="C." last="Ringeissen">C. Ringeissen</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA, 615 rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Monfroy, E" sort="Monfroy, E" uniqKey="Monfroy E" first="E." last="Monfroy">E. Monfroy</name>
<affiliation><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>
</affiliation>
</author>
</analytic>
<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>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithms</term>
<term>Automatic generation</term>
<term>Constraint logic programming</term>
<term>Constraint satisfaction</term>
<term>Constraint solving technique</term>
<term>Declarative programming</term>
<term>Deduction</term>
<term>Deduction rules</term>
<term>Integration</term>
<term>Logic</term>
<term>Logic programming</term>
<term>Mixed method</term>
<term>Programming languages</term>
<term>Slide rule</term>
<term>Solving</term>
<term>Unification</term>
<term>Unification algorithm</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Résolution(math)</term>
<term>Déduction</term>
<term>Programmation logique avec contrainte</term>
<term>Génération automatique</term>
<term>Intégration</term>
<term>Unification</term>
<term>Méthode mixte</term>
<term>Règle calcul</term>
<term>Logique</term>
<term>Langage programmation</term>
<term>Programmation logique</term>
<term>Algorithme</term>
<term>Satisfaction contrainte</term>
<term>0260C</term>
<term>Constraint solving technique</term>
<term>Constraint propagation</term>
<term>Constraint handling rules</term>
<term>Deduction rules</term>
<term>Finite domain</term>
<term>Unification algorithm</term>
<term>Declarative programming</term>
<term>Technique résolution contrainte</term>
<term>Règles déduction</term>
<term>Algorithme unification</term>
<term>Programmation déclarative</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Constraint solving techniques are frequently based on constraint propagation, a technique that can be seen as a specific form of deduction. Using constraint programming languages enhanced with constraint handling rules facilities, constraint propagation can be achieved just by applying deduction rules to constraints. The automatic generation of propagation rules has been recently investigated in the particular case of finite domains, when constraint satisfaction problems are based on predefined, explicitly given constraints. Due to its interest for practical applications, several solvers have been developed during the last decade for integrating finite domains into (constraint) logic programming. A possible way of integration is implemented using a unification algorithm to compute most general solutions of constraints. In this paper, we propose a mixed approach for designing finite domain constraints solvers: it consists in using a solver based on unification to improve the generation of propagation rules.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1865</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Generating propagation rules for finite domains : A mixed approach</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>New trends in constraints : Paphos, 25-27 October 1999, selected papers</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>RINGEISSEN (C.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>MONFROY (E.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>APT (Krzysztof R.)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>KAKAS (Antonis C.)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>MONFROY (Eric)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="04" i2="1"><s1>ROSSI (Francesca)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA-INRIA, 615 rue du Jardin Botanique, 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>150-172</s1>
</fA20>
<fA21><s1>2000</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-67885-9</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000090095240080</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2001 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>17 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>01-0034696</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<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>
<fA68 i1="01" i2="1" l="FRE"><s1>Génération de Règles de Propagation pour Domaine Fini : Une Approche Mixte</s1>
</fA68>
<fC01 i1="01" l="ENG"><s0>Constraint solving techniques are frequently based on constraint propagation, a technique that can be seen as a specific form of deduction. Using constraint programming languages enhanced with constraint handling rules facilities, constraint propagation can be achieved just by applying deduction rules to constraints. The automatic generation of propagation rules has been recently investigated in the particular case of finite domains, when constraint satisfaction problems are based on predefined, explicitly given constraints. Due to its interest for practical applications, several solvers have been developed during the last decade for integrating finite domains into (constraint) logic programming. A possible way of integration is implemented using a unification algorithm to compute most general solutions of constraints. In this paper, we propose a mixed approach for designing finite domain constraints solvers: it consists in using a solver based on unification to improve the generation of propagation rules.</s0>
</fC01>
<fC02 i1="01" i2="3"><s0>001B00B60C</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A07</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001D02C05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Résolution(math)</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Solving</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Resolución (matemática)</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Déduction</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Deduction</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Deducción</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Programmation logique avec contrainte</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Constraint logic programming</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Programación lógica con restricción</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Génération automatique</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Automatic generation</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Generación automatica</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="3" l="FRE"><s0>Intégration</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="3" l="ENG"><s0>Integration</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Unification</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Unification</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Unificación</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Méthode mixte</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Mixed method</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Método mixto</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Règle calcul</s0>
<s5>11</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Slide rule</s0>
<s5>11</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Regla cálculo</s0>
<s5>11</s5>
</fC03>
<fC03 i1="09" i2="3" l="FRE"><s0>Logique</s0>
<s5>12</s5>
</fC03>
<fC03 i1="09" i2="3" l="ENG"><s0>Logic</s0>
<s5>12</s5>
</fC03>
<fC03 i1="10" i2="3" l="FRE"><s0>Langage programmation</s0>
<s5>13</s5>
</fC03>
<fC03 i1="10" i2="3" l="ENG"><s0>Programming languages</s0>
<s5>13</s5>
</fC03>
<fC03 i1="11" i2="3" l="FRE"><s0>Programmation logique</s0>
<s5>14</s5>
</fC03>
<fC03 i1="11" i2="3" l="ENG"><s0>Logic programming</s0>
<s5>14</s5>
</fC03>
<fC03 i1="12" i2="3" l="FRE"><s0>Algorithme</s0>
<s5>15</s5>
</fC03>
<fC03 i1="12" i2="3" l="ENG"><s0>Algorithms</s0>
<s5>15</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Satisfaction contrainte</s0>
<s5>16</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Constraint satisfaction</s0>
<s5>16</s5>
</fC03>
<fC03 i1="13" i2="X" l="SPA"><s0>Satisfaccion restricción</s0>
<s5>16</s5>
</fC03>
<fC03 i1="14" i2="3" l="FRE"><s0>0260C</s0>
<s2>PAC</s2>
<s4>INC</s4>
<s5>56</s5>
</fC03>
<fC03 i1="15" i2="3" l="FRE"><s0>Constraint solving technique</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fC03 i1="16" i2="3" l="FRE"><s0>Constraint propagation</s0>
<s4>INC</s4>
<s5>83</s5>
</fC03>
<fC03 i1="17" i2="3" l="FRE"><s0>Constraint handling rules</s0>
<s4>INC</s4>
<s5>84</s5>
</fC03>
<fC03 i1="18" i2="3" l="FRE"><s0>Deduction rules</s0>
<s4>INC</s4>
<s5>85</s5>
</fC03>
<fC03 i1="19" i2="3" l="FRE"><s0>Finite domain</s0>
<s4>INC</s4>
<s5>86</s5>
</fC03>
<fC03 i1="20" i2="3" l="FRE"><s0>Unification algorithm</s0>
<s4>INC</s4>
<s5>87</s5>
</fC03>
<fC03 i1="21" i2="3" l="FRE"><s0>Declarative programming</s0>
<s4>INC</s4>
<s5>88</s5>
</fC03>
<fC03 i1="22" i2="3" l="FRE"><s0>Technique résolution contrainte</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="22" i2="3" l="ENG"><s0>Constraint solving technique</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="23" i2="3" l="FRE"><s0>Règles déduction</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fC03 i1="23" i2="3" l="ENG"><s0>Deduction rules</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fC03 i1="24" i2="3" l="FRE"><s0>Algorithme unification</s0>
<s4>CD</s4>
<s5>98</s5>
</fC03>
<fC03 i1="24" i2="3" l="ENG"><s0>Unification algorithm</s0>
<s4>CD</s4>
<s5>98</s5>
</fC03>
<fC03 i1="25" i2="3" l="FRE"><s0>Programmation déclarative</s0>
<s4>CD</s4>
<s5>99</s5>
</fC03>
<fC03 i1="25" i2="3" l="ENG"><s0>Declarative programming</s0>
<s4>CD</s4>
<s5>99</s5>
</fC03>
<fN21><s1>022</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Joint ERCIM/Compulog net workshop</s1>
<s3>Paphos CYP</s3>
<s4>1999-10-25</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 01-0034696 INIST</NO>
<FT>(Génération de Règles de Propagation pour Domaine Fini : Une Approche Mixte)</FT>
<ET>Generating propagation rules for finite domains : A mixed approach</ET>
<AU>RINGEISSEN (C.); MONFROY (E.); APT (Krzysztof R.); KAKAS (Antonis C.); MONFROY (Eric); ROSSI (Francesca)</AU>
<AF>LORIA-INRIA, 615 rue du Jardin Botanique, BP 101/54602 Villers-lès-Nancy/France (1 aut.); CWI, P.O. Box 94079/1090 GB Amsterdam/Pays-Bas (2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2000; Vol. 1865; Pp. 150-172; Bibl. 17 ref.</SO>
<LA>Anglais</LA>
<EA>Constraint solving techniques are frequently based on constraint propagation, a technique that can be seen as a specific form of deduction. Using constraint programming languages enhanced with constraint handling rules facilities, constraint propagation can be achieved just by applying deduction rules to constraints. The automatic generation of propagation rules has been recently investigated in the particular case of finite domains, when constraint satisfaction problems are based on predefined, explicitly given constraints. Due to its interest for practical applications, several solvers have been developed during the last decade for integrating finite domains into (constraint) logic programming. A possible way of integration is implemented using a unification algorithm to compute most general solutions of constraints. In this paper, we propose a mixed approach for designing finite domain constraints solvers: it consists in using a solver based on unification to improve the generation of propagation rules.</EA>
<CC>001B00B60C; 001D02A07; 001D02C05</CC>
<FD>Résolution(math); Déduction; Programmation logique avec contrainte; Génération automatique; Intégration; Unification; Méthode mixte; Règle calcul; Logique; Langage programmation; Programmation logique; Algorithme; Satisfaction contrainte; 0260C; Constraint solving technique; Constraint propagation; Constraint handling rules; Deduction rules; Finite domain; Unification algorithm; Declarative programming; Technique résolution contrainte; Règles déduction; Algorithme unification; Programmation déclarative</FD>
<ED>Solving; Deduction; Constraint logic programming; Automatic generation; Integration; Unification; Mixed method; Slide rule; Logic; Programming languages; Logic programming; Algorithms; Constraint satisfaction; Constraint solving technique; Deduction rules; Unification algorithm; Declarative programming</ED>
<SD>Resolución (matemática); Deducción; Programación lógica con restricción; Generación automatica; Unificación; Método mixto; Regla cálculo; Satisfaccion restricción</SD>
<LO>INIST-16343.354000090095240080</LO>
<ID>01-0034696</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 000995 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000995 | 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:01-0034696
   |texte=   Generating propagation rules for finite domains : A mixed approach
}}

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

Generating propagation rules for finite domains : A mixed approach

Generating propagation rules for finite domains : A mixed approach

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