Bounding resource consumption with Gödel-Dummett logics
Identifieur interne :
000485 ( PascalFrancis/Corpus );
précédent :
000484;
suivant :
000486
Bounding resource consumption with Gödel-Dummett logics
Auteurs : Dominique Larchey-WendlingSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2005.
RBID : Pascal:06-0063204
Descripteurs français
- Pascal (Inist)
- Intelligence artificielle,
Non déterminisme,
Système non déterministe,
Sémantique opérationnelle,
Modèle Kripke,
Approche probabiliste,
Algèbre processus,
Processus linéaire,
Transformation linéaire,
Modélisation,
Logique intermédiaire.
English descriptors
- KwdEn :
- Artificial intelligence,
Intermediate logic,
Kripke model,
Linear process,
Linear transformation,
Modeling,
Non determinism,
Non deterministic system,
Operational semantics,
Probabilistic approach,
Process algebra.
Abstract
Gödel-Dummett logic LC and its finite approximations LCn are the intermediate logics complete w.r.t. linearly ordered Kripke models. In this paper, we use LCn logics as a tool to bound resource consumption in some process calculi. We introduce a non-deterministic process calculus where the consumption of a particular resource denoted ● is explicit and provide an operational semantics which measures the consumption of this resource. We present a linear transformation of a process P into a formula f of LC. We show that the consumption of the resource by P can be bounded by the positive integer n if and only if the formula f admits a counter-model in LCn. Combining this result with our previous results on proof and counter-model construction for LCn, we conclude that bounding resource consumption is (linearly) equivalent to searching counter-models in LCn.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 3835 |
|---|
| A08 | 01 | 1 | ENG | @1 Bounding resource consumption with Gödel-Dummett logics |
|---|
| A09 | 01 | 1 | ENG | @1 Logic for programming, artificial intelligence, and reasoning : 12th international conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005 : Proceedings |
|---|
| A11 | 01 | 1 | | @1 LARCHEY-WENDLING (Dominique) |
|---|
| A14 | 01 | | | @1 LORIA - CNRS, Campus scientifique, BP 239 @2 54 506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. |
|---|
| A20 | | | | @1 682-696 |
|---|
| A21 | | | | @1 2005 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-30553-X |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000138672300460 |
|---|
| A44 | | | | @0 0000 @1 © 2006 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 13 ref. |
|---|
| A47 | 01 | 1 | | @0 06-0063204 |
|---|
| 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 Gödel-Dummett logic LC and its finite approximations LCn are the intermediate logics complete w.r.t. linearly ordered Kripke models. In this paper, we use LCn logics as a tool to bound resource consumption in some process calculi. We introduce a non-deterministic process calculus where the consumption of a particular resource denoted ● is explicit and provide an operational semantics which measures the consumption of this resource. We present a linear transformation of a process P into a formula f of LC. We show that the consumption of the resource by P can be bounded by the positive integer n if and only if the formula f admits a counter-model in LCn. Combining this result with our previous results on proof and counter-model construction for LCn, we conclude that bounding resource consumption is (linearly) equivalent to searching counter-models in LCn. |
|---|
| C02 | 01 | X | | @0 001D02C |
|---|
| C02 | 02 | X | | @0 001D02A04 |
|---|
| 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 Non déterminisme @5 06 |
|---|
| C03 | 02 | X | ENG | @0 Non determinism @5 06 |
|---|
| C03 | 02 | X | SPA | @0 No determinismo @5 06 |
|---|
| C03 | 03 | X | FRE | @0 Système non déterministe @5 07 |
|---|
| C03 | 03 | X | ENG | @0 Non deterministic system @5 07 |
|---|
| C03 | 03 | X | SPA | @0 Sistema no determinista @5 07 |
|---|
| C03 | 04 | X | FRE | @0 Sémantique opérationnelle @5 08 |
|---|
| C03 | 04 | X | ENG | @0 Operational semantics @5 08 |
|---|
| C03 | 04 | X | SPA | @0 Semantica operacional @5 08 |
|---|
| C03 | 05 | X | FRE | @0 Modèle Kripke @5 23 |
|---|
| C03 | 05 | X | ENG | @0 Kripke model @5 23 |
|---|
| C03 | 05 | X | SPA | @0 Modelo Kripke @5 23 |
|---|
| C03 | 06 | X | FRE | @0 Approche probabiliste @5 24 |
|---|
| C03 | 06 | X | ENG | @0 Probabilistic approach @5 24 |
|---|
| C03 | 06 | X | SPA | @0 Enfoque probabilista @5 24 |
|---|
| C03 | 07 | X | FRE | @0 Algèbre processus @5 25 |
|---|
| C03 | 07 | X | ENG | @0 Process algebra @5 25 |
|---|
| C03 | 07 | X | SPA | @0 Algebra proceso @5 25 |
|---|
| C03 | 08 | X | FRE | @0 Processus linéaire @5 26 |
|---|
| C03 | 08 | X | ENG | @0 Linear process @5 26 |
|---|
| C03 | 08 | X | SPA | @0 Proceso lineal @5 26 |
|---|
| C03 | 09 | X | FRE | @0 Transformation linéaire @5 27 |
|---|
| C03 | 09 | X | ENG | @0 Linear transformation @5 27 |
|---|
| C03 | 09 | X | SPA | @0 Transformación lineal @5 27 |
|---|
| C03 | 10 | X | FRE | @0 Modélisation @5 28 |
|---|
| C03 | 10 | X | ENG | @0 Modeling @5 28 |
|---|
| C03 | 10 | X | SPA | @0 Modelización @5 28 |
|---|
| C03 | 11 | X | FRE | @0 Logique intermédiaire @4 CD @5 96 |
|---|
| C03 | 11 | X | ENG | @0 Intermediate logic @4 CD @5 96 |
|---|
| C03 | 11 | X | SPA | @0 Lógica intermediaria @4 CD @5 96 |
|---|
| N21 | | | | @1 037 |
|---|
| N44 | 01 | | | @1 OTO |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Logic for programming, artificial intelligence, and reasoning. International conference @2 12 @3 Montego Bay JAM @4 2005-12-02 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 06-0063204 INIST |
|---|
| ET : | Bounding resource consumption with Gödel-Dummett logics |
|---|
| AU : | LARCHEY-WENDLING (Dominique) |
|---|
| AF : | LORIA - CNRS, Campus scientifique, BP 239/54 506 Vandœuvre-lès-Nancy/France (1 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2005; Vol. 3835; Pp. 682-696; Bibl. 13 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | Gödel-Dummett logic LC and its finite approximations LCn are the intermediate logics complete w.r.t. linearly ordered Kripke models. In this paper, we use LCn logics as a tool to bound resource consumption in some process calculi. We introduce a non-deterministic process calculus where the consumption of a particular resource denoted ● is explicit and provide an operational semantics which measures the consumption of this resource. We present a linear transformation of a process P into a formula f of LC. We show that the consumption of the resource by P can be bounded by the positive integer n if and only if the formula f admits a counter-model in LCn. Combining this result with our previous results on proof and counter-model construction for LCn, we conclude that bounding resource consumption is (linearly) equivalent to searching counter-models in LCn. |
|---|
| CC : | 001D02C; 001D02A04 |
|---|
| FD : | Intelligence artificielle; Non déterminisme; Système non déterministe; Sémantique opérationnelle; Modèle Kripke; Approche probabiliste; Algèbre processus; Processus linéaire; Transformation linéaire; Modélisation; Logique intermédiaire |
|---|
| ED : | Artificial intelligence; Non determinism; Non deterministic system; Operational semantics; Kripke model; Probabilistic approach; Process algebra; Linear process; Linear transformation; Modeling; Intermediate logic |
|---|
| SD : | Inteligencia artificial; No determinismo; Sistema no determinista; Semantica operacional; Modelo Kripke; Enfoque probabilista; Algebra proceso; Proceso lineal; Transformación lineal; Modelización; Lógica intermediaria |
|---|
| LO : | INIST-16343.354000138672300460 |
|---|
| ID : | 06-0063204 |
|---|
Links to Exploration step
Pascal:06-0063204
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Bounding resource consumption with Gödel-Dummett logics</title>
<author><name sortKey="Larchey Wendling, Dominique" sort="Larchey Wendling, Dominique" uniqKey="Larchey Wendling D" first="Dominique" last="Larchey-Wendling">Dominique Larchey-Wendling</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - CNRS, Campus scientifique, BP 239</s1>
<s2>54 506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">06-0063204</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 06-0063204 INIST</idno>
<idno type="RBID">Pascal:06-0063204</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000485</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Bounding resource consumption with Gödel-Dummett logics</title>
<author><name sortKey="Larchey Wendling, Dominique" sort="Larchey Wendling, Dominique" uniqKey="Larchey Wendling D" first="Dominique" last="Larchey-Wendling">Dominique Larchey-Wendling</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - CNRS, Campus scientifique, BP 239</s1>
<s2>54 506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2005">2005</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Artificial intelligence</term>
<term>Intermediate logic</term>
<term>Kripke model</term>
<term>Linear process</term>
<term>Linear transformation</term>
<term>Modeling</term>
<term>Non determinism</term>
<term>Non deterministic system</term>
<term>Operational semantics</term>
<term>Probabilistic approach</term>
<term>Process algebra</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Intelligence artificielle</term>
<term>Non déterminisme</term>
<term>Système non déterministe</term>
<term>Sémantique opérationnelle</term>
<term>Modèle Kripke</term>
<term>Approche probabiliste</term>
<term>Algèbre processus</term>
<term>Processus linéaire</term>
<term>Transformation linéaire</term>
<term>Modélisation</term>
<term>Logique intermédiaire</term>
</keywords><front><div type="abstract" xml:lang="en">Gödel-Dummett logic LC and its finite approximations LC<sub>n</sub>
are the intermediate logics complete w.r.t. linearly ordered Kripke models. In this paper, we use LC<sub>n</sub>
logics as a tool to bound resource consumption in some process calculi. We introduce a non-deterministic process calculus where the consumption of a particular resource denoted ● is explicit and provide an operational semantics which measures the consumption of this resource. We present a linear transformation of a process P into a formula f of LC. We show that the consumption of the resource by P can be bounded by the positive integer n if and only if the formula f admits a counter-model in LC<sub>n</sub>
. Combining this result with our previous results on proof and counter-model construction for LC<sub>n</sub>
, we conclude that bounding resource consumption is (linearly) equivalent to searching counter-models in LC<sub>n</sub>
.</div><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>3835</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Bounding resource consumption with Gödel-Dummett logics</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Logic for programming, artificial intelligence, and reasoning : 12th international conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005 : Proceedings</s1>
</fA09><fA11 i1="01" i2="1"><s1>LARCHEY-WENDLING (Dominique)</s1>
</fA11><fA14 i1="01"><s1>LORIA - CNRS, Campus scientifique, BP 239</s1>
<s2>54 506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14><fA20><s1>682-696</s1>
</fA20><fA21><s1>2005</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-30553-X</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000138672300460</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2006 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>13 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>06-0063204</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><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>Gödel-Dummett logic LC and its finite approximations LC<sub>n</sub>
are the intermediate logics complete w.r.t. linearly ordered Kripke models. In this paper, we use LC<sub>n</sub>
logics as a tool to bound resource consumption in some process calculi. We introduce a non-deterministic process calculus where the consumption of a particular resource denoted ● is explicit and provide an operational semantics which measures the consumption of this resource. We present a linear transformation of a process P into a formula f of LC. We show that the consumption of the resource by P can be bounded by the positive integer n if and only if the formula f admits a counter-model in LC<sub>n</sub>
. Combining this result with our previous results on proof and counter-model construction for LC<sub>n</sub>
, we conclude that bounding resource consumption is (linearly) equivalent to searching counter-models in LC<sub>n</sub>
.</s0><fC02 i1="01" i2="X"><s0>001D02C</s0>
</fC02><fC02 i1="02" i2="X"><s0>001D02A04</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>Non déterminisme</s0>
<s5>06</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Non determinism</s0>
<s5>06</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>No determinismo</s0>
<s5>06</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Système non déterministe</s0>
<s5>07</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Non deterministic system</s0>
<s5>07</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Sistema no determinista</s0>
<s5>07</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Sémantique opérationnelle</s0>
<s5>08</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Operational semantics</s0>
<s5>08</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Semantica operacional</s0>
<s5>08</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Modèle Kripke</s0>
<s5>23</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Kripke model</s0>
<s5>23</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Modelo Kripke</s0>
<s5>23</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Approche probabiliste</s0>
<s5>24</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Probabilistic approach</s0>
<s5>24</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Enfoque probabilista</s0>
<s5>24</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Algèbre processus</s0>
<s5>25</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Process algebra</s0>
<s5>25</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Algebra proceso</s0>
<s5>25</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Processus linéaire</s0>
<s5>26</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Linear process</s0>
<s5>26</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Proceso lineal</s0>
<s5>26</s5>
</fC03><fC03 i1="09" i2="X" l="FRE"><s0>Transformation linéaire</s0>
<s5>27</s5>
</fC03><fC03 i1="09" i2="X" l="ENG"><s0>Linear transformation</s0>
<s5>27</s5>
</fC03><fC03 i1="09" i2="X" l="SPA"><s0>Transformación lineal</s0>
<s5>27</s5>
</fC03><fC03 i1="10" i2="X" l="FRE"><s0>Modélisation</s0>
<s5>28</s5>
</fC03><fC03 i1="10" i2="X" l="ENG"><s0>Modeling</s0>
<s5>28</s5>
</fC03><fC03 i1="10" i2="X" l="SPA"><s0>Modelización</s0>
<s5>28</s5>
</fC03><fC03 i1="11" i2="X" l="FRE"><s0>Logique intermédiaire</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="11" i2="X" l="ENG"><s0>Intermediate logic</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="11" i2="X" l="SPA"><s0>Lógica intermediaria</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fN21><s1>037</s1>
</fN21><fN44 i1="01"><s1>OTO</s1>
</fN44><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>Logic for programming, artificial intelligence, and reasoning. International conference</s1>
<s2>12</s2>
<s3>Montego Bay JAM</s3>
<s4>2005-12-02</s4>
</fA30><server><NO>PASCAL 06-0063204 INIST</NO>
<ET>Bounding resource consumption with Gödel-Dummett logics</ET>
<AU>LARCHEY-WENDLING (Dominique)</AU>
<AF>LORIA - CNRS, Campus scientifique, BP 239/54 506 Vandœuvre-lès-Nancy/France (1 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2005; Vol. 3835; Pp. 682-696; Bibl. 13 ref.</SO>
<LA>Anglais</LA>
<EA>Gödel-Dummett logic LC and its finite approximations LC<sub>n</sub>
are the intermediate logics complete w.r.t. linearly ordered Kripke models. In this paper, we use LC<sub>n</sub>
logics as a tool to bound resource consumption in some process calculi. We introduce a non-deterministic process calculus where the consumption of a particular resource denoted ● is explicit and provide an operational semantics which measures the consumption of this resource. We present a linear transformation of a process P into a formula f of LC. We show that the consumption of the resource by P can be bounded by the positive integer n if and only if the formula f admits a counter-model in LC<sub>n</sub>
. Combining this result with our previous results on proof and counter-model construction for LC<sub>n</sub>
, we conclude that bounding resource consumption is (linearly) equivalent to searching counter-models in LC<sub>n</sub>
.</EA><CC>001D02C; 001D02A04</CC>
<FD>Intelligence artificielle; Non déterminisme; Système non déterministe; Sémantique opérationnelle; Modèle Kripke; Approche probabiliste; Algèbre processus; Processus linéaire; Transformation linéaire; Modélisation; Logique intermédiaire</FD>
<ED>Artificial intelligence; Non determinism; Non deterministic system; Operational semantics; Kripke model; Probabilistic approach; Process algebra; Linear process; Linear transformation; Modeling; Intermediate logic</ED>
<SD>Inteligencia artificial; No determinismo; Sistema no determinista; Semantica operacional; Modelo Kripke; Enfoque probabilista; Algebra proceso; Proceso lineal; Transformación lineal; Modelización; Lógica intermediaria</SD>
<LO>INIST-16343.354000138672300460</LO>
<ID>06-0063204</ID>
</server>
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 000485 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000485 | 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:06-0063204
|texte= Bounding resource consumption with Gödel-Dummett logics
}}
| 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 |  |
