InforLorV4, PascalFrancis, Corpus, bibRecord, 000708

Rewriting Logic and probabilities

Identifieur interne : 000708 ( PascalFrancis/Corpus ); précédent : 000707; suivant : 000709

Rewriting Logic and probabilities

Auteurs : Olivier Bournez ; Mathieu Hoyrup

Source :

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

RBID : Pascal:04-0196075

Descripteurs français

Pascal (Inist)
- Simultanéité informatique, Système expert, Langage naturel, Système réécriture, Réécriture, Déduction, Logique probabiliste, Approche probabiliste, Base connaissance.

English descriptors

KwdEn :
- Concurrency, Deduction, Expert system, Knowledge base, Natural language, Probabilistic approach, Probabilistic logics, Rewriting, Rewriting systems.

Abstract

Rewriting Logic has shown to provide a general and elegant framework for unifying a wide variety of models, including concurrency models and deduction systems. In order to extend the modeling capabilities of rule based languages, it is natural to consider that the firing of rules can be subject to some probabilistic laws. Considering rewrite rules subject to probabilities leads to numerous questions about the underlying notions and results. In this paper, we discuss whether there exists a notion of probabilistic rewrite system with an associated notion of probabilistic rewriting logic.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2706`
A08	`01`	`1`	`ENG`	`@1 Rewriting Logic and probabilities`
A09	`01`	`1`	`ENG`	`@1 RTA 2003 : rewriting techniques and applications : Valencia, 9-11 June 2003`
A11	`01`	`1`		`@1 BOURNEZ (Olivier)`
A11	`02`	`1`		`@1 HOYRUP (Mathieu)`
A12	`01`	`1`		`@1 NIEUWENHUIS (Robert) @9 ed.`
A14	`01`			`@1 LORIA/INRIA, 615 Rue du Jardin Botanique @2 54602 Villers lès Nancy @3 FRA @Z 1 aut.`
A14	`02`			`@1 ENS-Lyon, 46 Allée d'Italie @2 69364 Lyon @3 FRA @Z 2 aut.`
A20				`@1 61-75`
A21				`@1 2003`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-40254-3`
A43	`01`			`@1 INIST @2 16343 @5 354000117812010050`
A44				`@0 0000 @1 © 2004 INIST-CNRS. All rights reserved.`
A45				`@0 24 ref.`
A47	`01`	`1`		`@0 04-0196075`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
C01	`01`		`ENG`	@0 Rewriting Logic has shown to provide a general and elegant framework for unifying a wide variety of models, including concurrency models and deduction systems. In order to extend the modeling capabilities of rule based languages, it is natural to consider that the firing of rules can be subject to some probabilistic laws. Considering rewrite rules subject to probabilities leads to numerous questions about the underlying notions and results. In this paper, we discuss whether there exists a notion of probabilistic rewrite system with an associated notion of probabilistic rewriting logic.
C02	`01`	`X`		`@0 001D02B01`
C02	`02`	`X`		`@0 001D02A02`
C03	`01`	`X`	`FRE`	`@0 Simultanéité informatique @5 02`
C03	`01`	`X`	`ENG`	`@0 Concurrency @5 02`
C03	`01`	`X`	`SPA`	`@0 Simultaneidad informatica @5 02`
C03	`02`	`X`	`FRE`	`@0 Système expert @5 03`
C03	`02`	`X`	`ENG`	`@0 Expert system @5 03`
C03	`02`	`X`	`SPA`	`@0 Sistema experto @5 03`
C03	`03`	`X`	`FRE`	`@0 Langage naturel @5 04`
C03	`03`	`X`	`ENG`	`@0 Natural language @5 04`
C03	`03`	`X`	`SPA`	`@0 Lenguaje natural @5 04`
C03	`04`	`3`	`FRE`	`@0 Système réécriture @5 05`
C03	`04`	`3`	`ENG`	`@0 Rewriting systems @5 05`
C03	`05`	`X`	`FRE`	`@0 Réécriture @5 11`
C03	`05`	`X`	`ENG`	`@0 Rewriting @5 11`
C03	`05`	`X`	`SPA`	`@0 Reescritura @5 11`
C03	`06`	`X`	`FRE`	`@0 Déduction @5 12`
C03	`06`	`X`	`ENG`	`@0 Deduction @5 12`
C03	`06`	`X`	`SPA`	`@0 Deducción @5 12`
C03	`07`	`1`	`FRE`	`@0 Logique probabiliste @5 13`
C03	`07`	`1`	`ENG`	`@0 Probabilistic logics @5 13`
C03	`08`	`X`	`FRE`	`@0 Approche probabiliste @5 16`
C03	`08`	`X`	`ENG`	`@0 Probabilistic approach @5 16`
C03	`08`	`X`	`SPA`	`@0 Enfoque probabilista @5 16`
C03	`09`	`X`	`FRE`	`@0 Base connaissance @5 17`
C03	`09`	`X`	`ENG`	`@0 Knowledge base @5 17`
C03	`09`	`X`	`SPA`	`@0 Base conocimiento @5 17`
N21				`@1 131`
N82				`@1 PSI`

A30	`01`	`1`	`ENG`	`@1 International conference on rewriting techniques and applications @2 14 @3 Valencia ESP @4 2003-06-09`

Format Inist (serveur)

NO :	PASCAL 04-0196075 INIST
ET :	Rewriting Logic and probabilities
AU :	BOURNEZ (Olivier); HOYRUP (Mathieu); NIEUWENHUIS (Robert)
AF :	LORIA/INRIA, 615 Rue du Jardin Botanique/54602 Villers lès Nancy /France (1 aut.); ENS-Lyon, 46 Allée d'Italie/69364 Lyon/France (2 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2706; Pp. 61-75; Bibl. 24 ref.
LA :	Anglais
EA :	Rewriting Logic has shown to provide a general and elegant framework for unifying a wide variety of models, including concurrency models and deduction systems. In order to extend the modeling capabilities of rule based languages, it is natural to consider that the firing of rules can be subject to some probabilistic laws. Considering rewrite rules subject to probabilities leads to numerous questions about the underlying notions and results. In this paper, we discuss whether there exists a notion of probabilistic rewrite system with an associated notion of probabilistic rewriting logic.
CC :	001D02B01; 001D02A02
FD :	Simultanéité informatique; Système expert; Langage naturel; Système réécriture; Réécriture; Déduction; Logique probabiliste; Approche probabiliste; Base connaissance
ED :	Concurrency; Expert system; Natural language; Rewriting systems; Rewriting; Deduction; Probabilistic logics; Probabilistic approach; Knowledge base
SD :	Simultaneidad informatica; Sistema experto; Lenguaje natural; Reescritura; Deducción; Enfoque probabilista; Base conocimiento
LO :	INIST-16343.354000117812010050
ID :	04-0196075

Links to Exploration step

Pascal:04-0196075

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Rewriting Logic and probabilities</title>
<author><name sortKey="Bournez, Olivier" sort="Bournez, Olivier" uniqKey="Bournez O" first="Olivier" last="Bournez">Olivier Bournez</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA/INRIA, 615 Rue du Jardin Botanique</s1>
<s2>54602 Villers lès Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Hoyrup, Mathieu" sort="Hoyrup, Mathieu" uniqKey="Hoyrup M" first="Mathieu" last="Hoyrup">Mathieu Hoyrup</name>
<affiliation><inist:fA14 i1="02"><s1>ENS-Lyon, 46 Allée d'Italie</s1>
<s2>69364 Lyon</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0196075</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0196075 INIST</idno>
<idno type="RBID">Pascal:04-0196075</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000708</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Rewriting Logic and probabilities</title>
<author><name sortKey="Bournez, Olivier" sort="Bournez, Olivier" uniqKey="Bournez O" first="Olivier" last="Bournez">Olivier Bournez</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA/INRIA, 615 Rue du Jardin Botanique</s1>
<s2>54602 Villers lès Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Hoyrup, Mathieu" sort="Hoyrup, Mathieu" uniqKey="Hoyrup M" first="Mathieu" last="Hoyrup">Mathieu Hoyrup</name>
<affiliation><inist:fA14 i1="02"><s1>ENS-Lyon, 46 Allée d'Italie</s1>
<s2>69364 Lyon</s2>
<s3>FRA</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="2003">2003</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>Concurrency</term>
<term>Deduction</term>
<term>Expert system</term>
<term>Knowledge base</term>
<term>Natural language</term>
<term>Probabilistic approach</term>
<term>Probabilistic logics</term>
<term>Rewriting</term>
<term>Rewriting systems</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Simultanéité informatique</term>
<term>Système expert</term>
<term>Langage naturel</term>
<term>Système réécriture</term>
<term>Réécriture</term>
<term>Déduction</term>
<term>Logique probabiliste</term>
<term>Approche probabiliste</term>
<term>Base connaissance</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Rewriting Logic has shown to provide a general and elegant framework for unifying a wide variety of models, including concurrency models and deduction systems. In order to extend the modeling capabilities of rule based languages, it is natural to consider that the firing of rules can be subject to some probabilistic laws. Considering rewrite rules subject to probabilities leads to numerous questions about the underlying notions and results. In this paper, we discuss whether there exists a notion of probabilistic rewrite system with an associated notion of probabilistic rewriting logic.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2706</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Rewriting Logic and probabilities</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>RTA 2003 : rewriting techniques and applications : Valencia, 9-11 June 2003</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>BOURNEZ (Olivier)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>HOYRUP (Mathieu)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>NIEUWENHUIS (Robert)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA/INRIA, 615 Rue du Jardin Botanique</s1>
<s2>54602 Villers lès Nancy </s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>ENS-Lyon, 46 Allée d'Italie</s1>
<s2>69364 Lyon</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>61-75</s1>
</fA20>
<fA21><s1>2003</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-40254-3</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000117812010050</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>24 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>04-0196075</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>
<fC01 i1="01" l="ENG"><s0>Rewriting Logic has shown to provide a general and elegant framework for unifying a wide variety of models, including concurrency models and deduction systems. In order to extend the modeling capabilities of rule based languages, it is natural to consider that the firing of rules can be subject to some probabilistic laws. Considering rewrite rules subject to probabilities leads to numerous questions about the underlying notions and results. In this paper, we discuss whether there exists a notion of probabilistic rewrite system with an associated notion of probabilistic rewriting logic.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B01</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Simultanéité informatique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Concurrency</s0>
<s5>02</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Simultaneidad informatica</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Système expert</s0>
<s5>03</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Expert system</s0>
<s5>03</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Sistema experto</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Langage naturel</s0>
<s5>04</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Natural language</s0>
<s5>04</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Lenguaje natural</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="3" l="FRE"><s0>Système réécriture</s0>
<s5>05</s5>
</fC03>
<fC03 i1="04" i2="3" l="ENG"><s0>Rewriting systems</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Réécriture</s0>
<s5>11</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Rewriting</s0>
<s5>11</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Reescritura</s0>
<s5>11</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Déduction</s0>
<s5>12</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Deduction</s0>
<s5>12</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Deducción</s0>
<s5>12</s5>
</fC03>
<fC03 i1="07" i2="1" l="FRE"><s0>Logique probabiliste</s0>
<s5>13</s5>
</fC03>
<fC03 i1="07" i2="1" l="ENG"><s0>Probabilistic logics</s0>
<s5>13</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Approche probabiliste</s0>
<s5>16</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Probabilistic approach</s0>
<s5>16</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Enfoque probabilista</s0>
<s5>16</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Base connaissance</s0>
<s5>17</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Knowledge base</s0>
<s5>17</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Base conocimiento</s0>
<s5>17</s5>
</fC03>
<fN21><s1>131</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference on rewriting techniques and applications</s1>
<s2>14</s2>
<s3>Valencia ESP</s3>
<s4>2003-06-09</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 04-0196075 INIST</NO>
<ET>Rewriting Logic and probabilities</ET>
<AU>BOURNEZ (Olivier); HOYRUP (Mathieu); NIEUWENHUIS (Robert)</AU>
<AF>LORIA/INRIA, 615 Rue du Jardin Botanique/54602 Villers lès Nancy /France (1 aut.); ENS-Lyon, 46 Allée d'Italie/69364 Lyon/France (2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2706; Pp. 61-75; Bibl. 24 ref.</SO>
<LA>Anglais</LA>
<EA>Rewriting Logic has shown to provide a general and elegant framework for unifying a wide variety of models, including concurrency models and deduction systems. In order to extend the modeling capabilities of rule based languages, it is natural to consider that the firing of rules can be subject to some probabilistic laws. Considering rewrite rules subject to probabilities leads to numerous questions about the underlying notions and results. In this paper, we discuss whether there exists a notion of probabilistic rewrite system with an associated notion of probabilistic rewriting logic.</EA>
<CC>001D02B01; 001D02A02</CC>
<FD>Simultanéité informatique; Système expert; Langage naturel; Système réécriture; Réécriture; Déduction; Logique probabiliste; Approche probabiliste; Base connaissance</FD>
<ED>Concurrency; Expert system; Natural language; Rewriting systems; Rewriting; Deduction; Probabilistic logics; Probabilistic approach; Knowledge base</ED>
<SD>Simultaneidad informatica; Sistema experto; Lenguaje natural; Reescritura; Deducción; Enfoque probabilista; Base conocimiento</SD>
<LO>INIST-16343.354000117812010050</LO>
<ID>04-0196075</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 000708 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000708 | 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:04-0196075
   |texte=   Rewriting Logic and probabilities
}}

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

Rewriting Logic and probabilities

Rewriting Logic and probabilities

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