Bounding resource consumption with Gödel-Dummett logics
Identifieur interne : 000517 ( PascalFrancis/Checkpoint ); précédent : 000516; suivant : 000518Bounding resource consumption with Gödel-Dummett logics
Auteurs : Dominique Larchey-Wendling [France]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 2005.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Intelligence artificielle.
English descriptors
- KwdEn :
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.
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:06-0063204Le 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 wicri:level="1"><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>
<country>France</country>
<wicri:noRegion>54 506 Vandœuvre-lès-Nancy</wicri:noRegion>
<wicri:noRegion>BP 239</wicri:noRegion>
<wicri:noRegion>54 506 Vandœuvre-lès-Nancy</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<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>
<idno type="wicri:Area/PascalFrancis/Curation">000548</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000517</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000517</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 wicri:level="1"><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>
<country>France</country>
<wicri:noRegion>54 506 Vandœuvre-lès-Nancy</wicri:noRegion>
<wicri:noRegion>BP 239</wicri:noRegion>
<wicri:noRegion>54 506 Vandœuvre-lès-Nancy</wicri:noRegion>
</affiliation>
</author>
</analytic>
<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>
</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>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>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Intelligence artificielle</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<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>
</front>
</TEI>
<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>
<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>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>
</fC01>
<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>
</pA>
<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>
</pR>
</standard>
</inist>
<affiliations><list><country><li>France</li>
</country>
</list>
<tree><country name="France"><noRegion><name sortKey="Larchey Wendling, Dominique" sort="Larchey Wendling, Dominique" uniqKey="Larchey Wendling D" first="Dominique" last="Larchey-Wendling">Dominique Larchey-Wendling</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000517 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000517 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= PascalFrancis |étape= Checkpoint |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. | ![]() |