InforLorV4, PascalFrancis, Corpus, bibRecord, 000993

Rule Based Programming with constraints and strategies

Identifieur interne : 000993 ( PascalFrancis/Corpus ); précédent : 000992; suivant : 000994

Rule Based Programming with constraints and strategies

Auteurs : H. Dubois ; H. Kirchnei

Source :

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

RBID : Pascal:01-0035980

Descripteurs français

Pascal (Inist)
- Prototype, Base connaissance, Système expert, Intelligence artificielle, Spécification, Programmation, Backtracking, Planification, Stratégie, Satisfaction contrainte, Contrainte, 0705B, Rule based Programming, ELAN language, Deduction systems, Finite domains, Constraint solver.

English descriptors

KwdEn :
- Artificial intelligence, Backtracking, Constraint satisfaction, Expert systems, Knowledge base, Planning, Programming, Prototype, Specifications, Strategy, Stresses.

Abstract

We present a framework for Rule Based Programming with Constraints and Strategies. It is implemented in the ELAN language, that provides an environment for specifying and prototyping deduction systems. The existence of strategies provides the user with the possibility to make choices, to act upon them, and to retract if needed using backtracking. To illustrate the framework, we formalise a planning problem, namely a controller for printing tasks, that shows how to combine rules, strategies and constraint solving on finite domains.

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 Rule Based Programming with constraints and strategies`
A09	`01`	`1`	`ENG`	`@1 New trends in constraints : Paphos, 25-27 October 1999, selected papers`
A11	`01`	`1`		`@1 DUBOIS (H.)`
A11	`02`	`1`		`@1 KIRCHNEI (H.)`
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-UHP & CNRS, BP 239 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut.`
A20				`@1 274-297`
A21				`@1 2000`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-67885-9`
A43	`01`			`@1 INIST @2 16343 @5 354000090095240140`
A44				`@0 0000 @1 © 2001 INIST-CNRS. All rights reserved.`
A45				`@0 1 p.3/4`
A47	`01`	`1`		`@0 01-0035980`
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 present a framework for Rule Based Programming with Constraints and Strategies. It is implemented in the ELAN language, that provides an environment for specifying and prototyping deduction systems. The existence of strategies provides the user with the possibility to make choices, to act upon them, and to retract if needed using backtracking. To illustrate the framework, we formalise a planning problem, namely a controller for printing tasks, that shows how to combine rules, strategies and constraint solving on finite domains.
C02	`01`	`3`		`@0 001B00G05B`
C02	`02`	`X`		`@0 001D02A07`
C02	`03`	`X`		`@0 001D02B02`
C02	`04`	`X`		`@0 001D01A11`
C03	`01`	`X`	`FRE`	`@0 Prototype @5 01`
C03	`01`	`X`	`ENG`	`@0 Prototype @5 01`
C03	`01`	`X`	`SPA`	`@0 Prototipo @5 01`
C03	`02`	`3`	`FRE`	`@0 Base connaissance @5 02`
C03	`02`	`3`	`ENG`	`@0 Knowledge base @5 02`
C03	`03`	`3`	`FRE`	`@0 Système expert @5 03`
C03	`03`	`3`	`ENG`	`@0 Expert systems @5 03`
C03	`04`	`3`	`FRE`	`@0 Intelligence artificielle @5 04`
C03	`04`	`3`	`ENG`	`@0 Artificial intelligence @5 04`
C03	`05`	`3`	`FRE`	`@0 Spécification @5 09`
C03	`05`	`3`	`ENG`	`@0 Specifications @5 09`
C03	`06`	`3`	`FRE`	`@0 Programmation @5 11`
C03	`06`	`3`	`ENG`	`@0 Programming @5 11`
C03	`07`	`3`	`FRE`	`@0 Backtracking @5 12`
C03	`07`	`3`	`ENG`	`@0 Backtracking @5 12`
C03	`08`	`X`	`FRE`	`@0 Planification @5 13`
C03	`08`	`X`	`ENG`	`@0 Planning @5 13`
C03	`08`	`X`	`SPA`	`@0 Planificación @5 13`
C03	`09`	`X`	`FRE`	`@0 Stratégie @5 15`
C03	`09`	`X`	`ENG`	`@0 Strategy @5 15`
C03	`09`	`X`	`SPA`	`@0 Estrategia @5 15`
C03	`10`	`X`	`FRE`	`@0 Satisfaction contrainte @5 16`
C03	`10`	`X`	`ENG`	`@0 Constraint satisfaction @5 16`
C03	`10`	`X`	`SPA`	`@0 Satisfaccion restricción @5 16`
C03	`11`	`3`	`FRE`	`@0 Contrainte @5 17`
C03	`11`	`3`	`ENG`	`@0 Stresses @5 17`
C03	`12`	`3`	`FRE`	`@0 0705B @2 PAC @4 INC @5 56`
C03	`13`	`3`	`FRE`	`@0 Rule based Programming @4 INC @5 82`
C03	`14`	`3`	`FRE`	`@0 ELAN language @4 INC @5 83`
C03	`15`	`3`	`FRE`	`@0 Deduction systems @4 INC @5 84`
C03	`16`	`3`	`FRE`	`@0 Finite domains @4 INC @5 85`
C03	`17`	`3`	`FRE`	`@0 Constraint solver @4 INC @5 86`
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-0035980 INIST
ET :	Rule Based Programming with constraints and strategies
AU :	DUBOIS (H.); KIRCHNEI (H.); APT (Krzysztof R.); KAKAS (Antonis C.); MONFROY (Eric); ROSSI (Francesca)
AF :	LORIA-UHP & CNRS, BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 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. 274-297; Bibl. 1 p.3/4
LA :	Anglais
EA :	We present a framework for Rule Based Programming with Constraints and Strategies. It is implemented in the ELAN language, that provides an environment for specifying and prototyping deduction systems. The existence of strategies provides the user with the possibility to make choices, to act upon them, and to retract if needed using backtracking. To illustrate the framework, we formalise a planning problem, namely a controller for printing tasks, that shows how to combine rules, strategies and constraint solving on finite domains.
CC :	001B00G05B; 001D02A07; 001D02B02; 001D01A11
FD :	Prototype; Base connaissance; Système expert; Intelligence artificielle; Spécification; Programmation; Backtracking; Planification; Stratégie; Satisfaction contrainte; Contrainte; 0705B; Rule based Programming; ELAN language; Deduction systems; Finite domains; Constraint solver
ED :	Prototype; Knowledge base; Expert systems; Artificial intelligence; Specifications; Programming; Backtracking; Planning; Strategy; Constraint satisfaction; Stresses
SD :	Prototipo; Planificación; Estrategia; Satisfaccion restricción
LO :	INIST-16343.354000090095240140
ID :	01-0035980

Links to Exploration step

Pascal:01-0035980

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Rule Based Programming with constraints and strategies</title>
<author><name sortKey="Dubois, H" sort="Dubois, H" uniqKey="Dubois H" first="H." last="Dubois">H. Dubois</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-UHP & CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kirchnei, H" sort="Kirchnei, H" uniqKey="Kirchnei H" first="H." last="Kirchnei">H. Kirchnei</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-UHP & CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">01-0035980</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 01-0035980 INIST</idno>
<idno type="RBID">Pascal:01-0035980</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000993</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Rule Based Programming with constraints and strategies</title>
<author><name sortKey="Dubois, H" sort="Dubois, H" uniqKey="Dubois H" first="H." last="Dubois">H. Dubois</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-UHP & CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kirchnei, H" sort="Kirchnei, H" uniqKey="Kirchnei H" first="H." last="Kirchnei">H. Kirchnei</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-UHP & CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<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>Artificial intelligence</term>
<term>Backtracking</term>
<term>Constraint satisfaction</term>
<term>Expert systems</term>
<term>Knowledge base</term>
<term>Planning</term>
<term>Programming</term>
<term>Prototype</term>
<term>Specifications</term>
<term>Strategy</term>
<term>Stresses</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Prototype</term>
<term>Base connaissance</term>
<term>Système expert</term>
<term>Intelligence artificielle</term>
<term>Spécification</term>
<term>Programmation</term>
<term>Backtracking</term>
<term>Planification</term>
<term>Stratégie</term>
<term>Satisfaction contrainte</term>
<term>Contrainte</term>
<term>0705B</term>
<term>Rule based Programming</term>
<term>ELAN language</term>
<term>Deduction systems</term>
<term>Finite domains</term>
<term>Constraint solver</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We present a framework for Rule Based Programming with Constraints and Strategies. It is implemented in the ELAN language, that provides an environment for specifying and prototyping deduction systems. The existence of strategies provides the user with the possibility to make choices, to act upon them, and to retract if needed using backtracking. To illustrate the framework, we formalise a planning problem, namely a controller for printing tasks, that shows how to combine rules, strategies and constraint solving on finite domains.</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>Rule Based Programming with constraints and strategies</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>DUBOIS (H.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>KIRCHNEI (H.)</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-UHP & CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>274-297</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>354000090095240140</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2001 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>1 p.3/4</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>01-0035980</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>
<fC01 i1="01" l="ENG"><s0>We present a framework for Rule Based Programming with Constraints and Strategies. It is implemented in the ELAN language, that provides an environment for specifying and prototyping deduction systems. The existence of strategies provides the user with the possibility to make choices, to act upon them, and to retract if needed using backtracking. To illustrate the framework, we formalise a planning problem, namely a controller for printing tasks, that shows how to combine rules, strategies and constraint solving on finite domains.</s0>
</fC01>
<fC02 i1="01" i2="3"><s0>001B00G05B</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A07</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001D02B02</s0>
</fC02>
<fC02 i1="04" i2="X"><s0>001D01A11</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Prototype</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Prototype</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Prototipo</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="3" l="FRE"><s0>Base connaissance</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="3" l="ENG"><s0>Knowledge base</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="3" l="FRE"><s0>Système expert</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="3" l="ENG"><s0>Expert systems</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="3" l="FRE"><s0>Intelligence artificielle</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="3" l="ENG"><s0>Artificial intelligence</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="3" l="FRE"><s0>Spécification</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="3" l="ENG"><s0>Specifications</s0>
<s5>09</s5>
</fC03>
<fC03 i1="06" i2="3" l="FRE"><s0>Programmation</s0>
<s5>11</s5>
</fC03>
<fC03 i1="06" i2="3" l="ENG"><s0>Programming</s0>
<s5>11</s5>
</fC03>
<fC03 i1="07" i2="3" l="FRE"><s0>Backtracking</s0>
<s5>12</s5>
</fC03>
<fC03 i1="07" i2="3" l="ENG"><s0>Backtracking</s0>
<s5>12</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Planification</s0>
<s5>13</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Planning</s0>
<s5>13</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Planificación</s0>
<s5>13</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Stratégie</s0>
<s5>15</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Strategy</s0>
<s5>15</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Estrategia</s0>
<s5>15</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Satisfaction contrainte</s0>
<s5>16</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Constraint satisfaction</s0>
<s5>16</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Satisfaccion restricción</s0>
<s5>16</s5>
</fC03>
<fC03 i1="11" i2="3" l="FRE"><s0>Contrainte</s0>
<s5>17</s5>
</fC03>
<fC03 i1="11" i2="3" l="ENG"><s0>Stresses</s0>
<s5>17</s5>
</fC03>
<fC03 i1="12" i2="3" l="FRE"><s0>0705B</s0>
<s2>PAC</s2>
<s4>INC</s4>
<s5>56</s5>
</fC03>
<fC03 i1="13" i2="3" l="FRE"><s0>Rule based Programming</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fC03 i1="14" i2="3" l="FRE"><s0>ELAN language</s0>
<s4>INC</s4>
<s5>83</s5>
</fC03>
<fC03 i1="15" i2="3" l="FRE"><s0>Deduction systems</s0>
<s4>INC</s4>
<s5>84</s5>
</fC03>
<fC03 i1="16" i2="3" l="FRE"><s0>Finite domains</s0>
<s4>INC</s4>
<s5>85</s5>
</fC03>
<fC03 i1="17" i2="3" l="FRE"><s0>Constraint solver</s0>
<s4>INC</s4>
<s5>86</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-0035980 INIST</NO>
<ET>Rule Based Programming with constraints and strategies</ET>
<AU>DUBOIS (H.); KIRCHNEI (H.); APT (Krzysztof R.); KAKAS (Antonis C.); MONFROY (Eric); ROSSI (Francesca)</AU>
<AF>LORIA-UHP & CNRS, BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 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. 274-297; Bibl. 1 p.3/4</SO>
<LA>Anglais</LA>
<EA>We present a framework for Rule Based Programming with Constraints and Strategies. It is implemented in the ELAN language, that provides an environment for specifying and prototyping deduction systems. The existence of strategies provides the user with the possibility to make choices, to act upon them, and to retract if needed using backtracking. To illustrate the framework, we formalise a planning problem, namely a controller for printing tasks, that shows how to combine rules, strategies and constraint solving on finite domains.</EA>
<CC>001B00G05B; 001D02A07; 001D02B02; 001D01A11</CC>
<FD>Prototype; Base connaissance; Système expert; Intelligence artificielle; Spécification; Programmation; Backtracking; Planification; Stratégie; Satisfaction contrainte; Contrainte; 0705B; Rule based Programming; ELAN language; Deduction systems; Finite domains; Constraint solver</FD>
<ED>Prototype; Knowledge base; Expert systems; Artificial intelligence; Specifications; Programming; Backtracking; Planning; Strategy; Constraint satisfaction; Stresses</ED>
<SD>Prototipo; Planificación; Estrategia; Satisfaccion restricción</SD>
<LO>INIST-16343.354000090095240140</LO>
<ID>01-0035980</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 000993 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000993 | 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-0035980
   |texte=   Rule Based Programming with constraints and strategies
}}

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

Rule Based Programming with constraints and strategies

Rule Based Programming with constraints and strategies

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