Bounding resource consumption with Gödel-Dummett logics
Identifieur interne : 006654 ( Main/Merge ); précédent : 006653; suivant : 006655Bounding 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.
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000485
- to stream PascalFrancis, to step Curation: 000548
- to stream PascalFrancis, to step Checkpoint: 000517
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><idno type="wicri:doubleKey">0302-9743:2005:Larchey Wendling D:bounding:resource:consumption</idno><idno type="wicri:Area/Main/Merge">006654</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><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/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006654 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 006654 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|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. |  |