InforLorV4, PascalFrancis, Checkpoint, bibRecord, 000510

Combining lists with non-stably infinite theories

Identifieur interne : 000510 ( PascalFrancis/Checkpoint ); précédent : 000509; suivant : 000511

Combining lists with non-stably infinite theories

Auteurs : Pascal Fontaine [France] ; Silvio Ranise [France] ; Calogero G. Zarba [France]

Source :

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

RBID : Pascal:05-0291230

Descripteurs français

Pascal (Inist)
- Programmation logique, Intelligence artificielle, Traitement liste, Vérification programme, Modélisation.
Wicri :
- topic : Intelligence artificielle.

English descriptors

KwdEn :
- Artificial intelligence, List processing, Logical programming, Modeling, Program verification.

Abstract

In program verification one has often to reason about lists over elements of a given nature. Thus, it becomes important to be able to combine the theory of lists with a generic theory T modeling the elements. This combination can be achieved using the Nelson-Oppen method only if T is stably infinite. The goal of this paper is to relax the stable-infiniteness requirement More specifically, we provide a new method that is able to combine the theory of lists with any theory T of the elements, regardless of whether T is stably infinite or not. The crux of our combination method is to guess an arrangement over a set of variables that is larger than the one considered by Nelson and Oppen. Furthermore, our results entail that. it is also possible to combine T with the more general theory of lists with a length function.

Affiliations:

France

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

to stream PascalFrancis, to step Corpus: 000553
to stream PascalFrancis, to step Curation: 000485

Links to Exploration step

Pascal:05-0291230

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Combining lists with non-stably infinite theories</title>
<author><name sortKey="Fontaine, Pascal" sort="Fontaine, Pascal" uniqKey="Fontaine P" first="Pascal" last="Fontaine">Pascal Fontaine</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA and INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA and INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Zarba, Calogero G" sort="Zarba, Calogero G" uniqKey="Zarba C" first="Calogero G." last="Zarba">Calogero G. Zarba</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA and INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">05-0291230</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 05-0291230 INIST</idno>
<idno type="RBID">Pascal:05-0291230</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000553</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000485</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000510</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000510</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Combining lists with non-stably infinite theories</title>
<author><name sortKey="Fontaine, Pascal" sort="Fontaine, Pascal" uniqKey="Fontaine P" first="Pascal" last="Fontaine">Pascal Fontaine</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA and INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA and INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Zarba, Calogero G" sort="Zarba, Calogero G" uniqKey="Zarba C" first="Calogero G." last="Zarba">Calogero G. Zarba</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA and INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA and INRIA-Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA and INRIA-Lorraine</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>List processing</term>
<term>Logical programming</term>
<term>Modeling</term>
<term>Program verification</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Programmation logique</term>
<term>Intelligence artificielle</term>
<term>Traitement liste</term>
<term>Vérification programme</term>
<term>Modélisation</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">In program verification one has often to reason about lists over elements of a given nature. Thus, it becomes important to be able to combine the theory of lists with a generic theory T modeling the elements. This combination can be achieved using the Nelson-Oppen method only if T is stably infinite. The goal of this paper is to relax the stable-infiniteness requirement More specifically, we provide a new method that is able to combine the theory of lists with any theory T of the elements, regardless of whether T is stably infinite or not. The crux of our combination method is to guess an arrangement over a set of variables that is larger than the one considered by Nelson and Oppen. Furthermore, our results entail that. it is also possible to combine T with the more general theory of lists with a length function.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>3452</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Combining lists with non-stably infinite theories</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>LPAR 2004 : logic for programming, artificial intelligence, and reasoning : Montevideo, 14-18 March 2005</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>FONTAINE (Pascal)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>RANISE (Silvio)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>ZARBA (Calogero G.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>BAADER (Franz)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>VORONKOV (Andrei)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA and INRIA-Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>51-66</s1>
</fA20>
<fA21><s1>2005</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-25236-3</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000124477600040</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2005 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>25 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>05-0291230</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>In program verification one has often to reason about lists over elements of a given nature. Thus, it becomes important to be able to combine the theory of lists with a generic theory T modeling the elements. This combination can be achieved using the Nelson-Oppen method only if T is stably infinite. The goal of this paper is to relax the stable-infiniteness requirement More specifically, we provide a new method that is able to combine the theory of lists with any theory T of the elements, regardless of whether T is stably infinite or not. The crux of our combination method is to guess an arrangement over a set of variables that is larger than the one considered by Nelson and Oppen. Furthermore, our results entail that. it is also possible to combine T with the more general theory of lists with a length function.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A04</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02C02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Programmation logique</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Logical programming</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Programación lógica</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Intelligence artificielle</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Artificial intelligence</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Inteligencia artificial</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Traitement liste</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>List processing</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Tratamiento lista</s0>
<s5>06</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Vérification programme</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Program verification</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Verificación programa</s0>
<s5>07</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Modélisation</s0>
<s5>23</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Modeling</s0>
<s5>23</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Modelización</s0>
<s5>23</s5>
</fC03>
<fN21><s1>206</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. Conference</s1>
<s3>Montevideo URY</s3>
<s4>2005-03-14</s4>
</fA30>
</pR>
</standard>
</inist>
<affiliations><list><country><li>France</li>
</country>
</list>
<tree><country name="France"><noRegion><name sortKey="Fontaine, Pascal" sort="Fontaine, Pascal" uniqKey="Fontaine P" first="Pascal" last="Fontaine">Pascal Fontaine</name>
</noRegion>
<name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name>
<name sortKey="Zarba, Calogero G" sort="Zarba, Calogero G" uniqKey="Zarba C" first="Calogero G." last="Zarba">Calogero G. Zarba</name>
</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 000510 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000510 | 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:05-0291230
   |texte=   Combining lists with non-stably infinite theories
}}

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

Combining lists with non-stably infinite theories

Combining lists with non-stably infinite theories

Source :

Descripteurs français

English descriptors

Abstract

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

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