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.

Bounding Resource Consumption with Gödel-Dummett Logics

Identifieur interne : 006296 ( Main/Exploration ); précédent : 006295; suivant : 006297

Bounding Resource Consumption with Gödel-Dummett Logics

Auteurs : Dominique Larchey-Wendling [France]

Source :

RBID : ISTEX:338E39AB1A7A8A52495EA386B460F671BC127079

Descripteurs français

English descriptors

Abstract

Abstract: Gödel-Dummett logic LC and its finite approximations LC n are the intermediate logics complete w.r.t. linearly ordered Kripke models. In this paper, we use LC n 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 n . 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 n . Combining this result with our previous results on proof and counter-model construction for LC n , we conclude that bounding resource consumption is (linearly) equivalent to searching counter-models in LC n .

Url:
DOI: 10.1007/11591191_47


Affiliations:


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


Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">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>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:338E39AB1A7A8A52495EA386B460F671BC127079</idno>
<date when="2005" year="2005">2005</date>
<idno type="doi">10.1007/11591191_47</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-V6KX3MDB-P/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000C17</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000C17</idno>
<idno type="wicri:Area/Istex/Curation">000C10</idno>
<idno type="wicri:Area/Istex/Checkpoint">001610</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001610</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Larchey Wendling D:bounding:resource:consumption</idno>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-00012536</idno>
<idno type="url">https://hal.archives-ouvertes.fr/hal-00012536</idno>
<idno type="wicri:Area/Hal/Corpus">001294</idno>
<idno type="wicri:Area/Hal/Curation">001294</idno>
<idno type="wicri:Area/Hal/Checkpoint">004458</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">004458</idno>
<idno type="wicri:Area/Main/Merge">006521</idno>
<idno type="wicri:source">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>
<idno type="wicri:Area/Main/Curation">006296</idno>
<idno type="wicri:Area/Main/Exploration">006296</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">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="3">
<country xml:lang="fr">France</country>
<wicri:regionArea>LORIA – CNRS, Campus scientifique, BP 239, 54 506, Vandœuvre-lès-Nancy</wicri:regionArea>
<placeName>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
<settlement type="city" wicri:auto="agglo">Nancy</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<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>Algèbre processus</term>
<term>Approche probabiliste</term>
<term>Intelligence artificielle</term>
<term>Logique intermédiaire</term>
<term>Modèle Kripke</term>
<term>Modélisation</term>
<term>Non déterminisme</term>
<term>Processus linéaire</term>
<term>Système non déterministe</term>
<term>Sémantique opérationnelle</term>
<term>Transformation linéaire</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">Abstract: Gödel-Dummett logic LC and its finite approximations LC n are the intermediate logics complete w.r.t. linearly ordered Kripke models. In this paper, we use LC n 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 n . 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 n . Combining this result with our previous results on proof and counter-model construction for LC n , we conclude that bounding resource consumption is (linearly) equivalent to searching counter-models in LC n .</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>France</li>
</country>
<region>
<li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement>
<li>Nancy</li>
<li>Vandœuvre-lès-Nancy</li>
</settlement>
</list>
<tree>
<country name="France">
<region name="Grand Est">
<name sortKey="Larchey Wendling, Dominique" sort="Larchey Wendling, Dominique" uniqKey="Larchey Wendling D" first="Dominique" last="Larchey-Wendling">Dominique Larchey-Wendling</name>
</region>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006296 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006296 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:338E39AB1A7A8A52495EA386B460F671BC127079
   |texte=   Bounding Resource Consumption with Gödel-Dummett Logics
}}

Wicri

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