InforLorV4, PascalFrancis, Curation, bibRecord, 000126

Constraint solving on terms

Identifieur interne : 000126 ( PascalFrancis/Curation ); précédent : 000125; suivant : 000127

Constraint solving on terms

Auteurs : Hubert Comon [France] ; Claude Kirchner [France]

Source :

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

RBID : Pascal:01-0326562

Descripteurs français

Pascal (Inist)
- Programmation logique, Satisfaction contrainte, Théorie équationnelle, Unification, Automate fini, Automate arbre.

English descriptors

KwdEn :
- Constraint satisfaction, Equational theory, Finite automaton, Logical programming, Tree automaton, Unification.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2002`
A08	`01`	`1`	`ENG`	`@1 Constraint solving on terms`
A09	`01`	`1`	`ENG`	`@1 CCL'99 : constraints in computational logics, theory and applications : Gif sur Yvette, 5-8 September 1999, revised lectures`
A11	`01`	`1`		`@1 COMON (Hubert)`
A11	`02`	`1`		`@1 KIRCHNER (Claude)`
A12	`01`	`1`		`@1 COMON (Hubert) @9 ed.`
A12	`02`	`1`		`@1 MARCHE (Claude) @9 ed.`
A12	`03`	`1`		`@1 TREINEN (Ralf) @9 ed.`
A14	`01`			`@1 LSV, Ecole Normale Supérieure de Cachan @2 Cachan @3 FRA @Z 1 aut.`
A14	`02`			`@1 LORIA and INRIA @2 Villers-lès-Nancy @3 FRA @Z 2 aut.`
A20				`@1 47-103`
A21				`@1 2001`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-41950-0`
A43	`01`			`@1 INIST @2 16343 @5 354000092400200020`
A44				`@0 0000 @1 © 2001 INIST-CNRS. All rights reserved.`
A45				`@0 9 p.`
A47	`01`	`1`		`@0 01-0326562`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
C02	`01`	`X`		`@0 001D02A07`
C02	`02`	`X`		`@0 001D02A03`
C02	`03`	`X`		`@0 001A02A01B`
C03	`01`	`X`	`FRE`	`@0 Programmation logique @5 09`
C03	`01`	`X`	`ENG`	`@0 Logical programming @5 09`
C03	`01`	`X`	`SPA`	`@0 Programación lógica @5 09`
C03	`02`	`X`	`FRE`	`@0 Satisfaction contrainte @5 10`
C03	`02`	`X`	`ENG`	`@0 Constraint satisfaction @5 10`
C03	`02`	`X`	`SPA`	`@0 Satisfaccion restricción @5 10`
C03	`03`	`X`	`FRE`	`@0 Théorie équationnelle @5 11`
C03	`03`	`X`	`ENG`	`@0 Equational theory @5 11`
C03	`03`	`X`	`SPA`	`@0 Teoría ecuaciónal @5 11`
C03	`04`	`X`	`FRE`	`@0 Unification @5 12`
C03	`04`	`X`	`ENG`	`@0 Unification @5 12`
C03	`04`	`X`	`SPA`	`@0 Unificación @5 12`
C03	`05`	`X`	`FRE`	`@0 Automate fini @5 13`
C03	`05`	`X`	`ENG`	`@0 Finite automaton @5 13`
C03	`05`	`X`	`SPA`	`@0 Autómata estado finito @5 13`
C03	`06`	`X`	`FRE`	`@0 Automate arbre @5 14`
C03	`06`	`X`	`ENG`	`@0 Tree automaton @5 14`
C03	`06`	`X`	`SPA`	`@0 Autómata árbol @5 14`
N21				`@1 225`

A30	`01`	`1`	`ENG`	`@1 Constraints in computational logics. International summer school @3 Gif sur Yvette FRA @4 1999-09-05`

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000950

Links to Exploration step

Pascal:01-0326562

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Constraint solving on terms</title>
<author><name sortKey="Comon, Hubert" sort="Comon, Hubert" uniqKey="Comon H" first="Hubert" last="Comon">Hubert Comon</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LSV, Ecole Normale Supérieure de Cachan</s1>
<s2>Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LORIA and INRIA</s1>
<s2>Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">01-0326562</idno>
<date when="2001">2001</date>
<idno type="stanalyst">PASCAL 01-0326562 INIST</idno>
<idno type="RBID">Pascal:01-0326562</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000950</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000126</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Constraint solving on terms</title>
<author><name sortKey="Comon, Hubert" sort="Comon, Hubert" uniqKey="Comon H" first="Hubert" last="Comon">Hubert Comon</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LSV, Ecole Normale Supérieure de Cachan</s1>
<s2>Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LORIA and INRIA</s1>
<s2>Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2001">2001</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>Constraint satisfaction</term>
<term>Equational theory</term>
<term>Finite automaton</term>
<term>Logical programming</term>
<term>Tree automaton</term>
<term>Unification</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Programmation logique</term>
<term>Satisfaction contrainte</term>
<term>Théorie équationnelle</term>
<term>Unification</term>
<term>Automate fini</term>
<term>Automate arbre</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2002</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Constraint solving on terms</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>CCL'99 : constraints in computational logics, theory and applications : Gif sur Yvette, 5-8 September 1999, revised lectures</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>COMON (Hubert)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>KIRCHNER (Claude)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>COMON (Hubert)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>MARCHE (Claude)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>TREINEN (Ralf)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LSV, Ecole Normale Supérieure de Cachan</s1>
<s2>Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LORIA and INRIA</s1>
<s2>Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>47-103</s1>
</fA20>
<fA21><s1>2001</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-41950-0</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000092400200020</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2001 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>9 p.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>01-0326562</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>
<fC02 i1="01" i2="X"><s0>001D02A07</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A03</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001A02A01B</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Programmation logique</s0>
<s5>09</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Logical programming</s0>
<s5>09</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Programación lógica</s0>
<s5>09</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Satisfaction contrainte</s0>
<s5>10</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Constraint satisfaction</s0>
<s5>10</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Satisfaccion restricción</s0>
<s5>10</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Théorie équationnelle</s0>
<s5>11</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Equational theory</s0>
<s5>11</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Teoría ecuaciónal</s0>
<s5>11</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Unification</s0>
<s5>12</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Unification</s0>
<s5>12</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Unificación</s0>
<s5>12</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Automate fini</s0>
<s5>13</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Finite automaton</s0>
<s5>13</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Autómata estado finito</s0>
<s5>13</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Automate arbre</s0>
<s5>14</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Tree automaton</s0>
<s5>14</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Autómata árbol</s0>
<s5>14</s5>
</fC03>
<fN21><s1>225</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Constraints in computational logics. International summer school</s1>
<s3>Gif sur Yvette FRA</s3>
<s4>1999-09-05</s4>
</fA30>
</pR>
</standard>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation

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

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000126 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Curation
   |type=    RBID
   |clé=     Pascal:01-0326562
   |texte=   Constraint solving on terms
}}

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

Constraint solving on terms

Constraint solving on terms

Source :

Descripteurs français

English descriptors

Links toward previous steps (curation, corpus...)

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