Nelson-oppen, shostak and the extended canonizer : A family picture with a newborn
Identifieur interne :
000533 ( PascalFrancis/Corpus );
précédent :
000532;
suivant :
000534
Nelson-oppen, shostak and the extended canonizer : A family picture with a newborn
Auteurs : Silvio Ranise ;
Christophe Ringeissen ;
Duc-Khanh TranSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2005.
RBID : Pascal:05-0360398
Descripteurs français
English descriptors
Abstract
We consider the problem of building satisfiability procedures for unions of disjoint theories. We briefly review the combination schemas proposed by Nelson-Oppen, Shostak, and others. Three inference systems are directly derived from the properties satisfied by the theories being combined and known results from the literature are obtained in a uniform and abstract way. This rational reconstruction is the starting point for further investigations. We introduce the concept of extended canonizer and derive a modularity result for a new class of theories (larger than Shostak and smaller than Nelson-Oppen theories) which is closed under disjoint union. This is in contrast with the lack of modularity of Shostak theories. We also explain how to implement extended canonizers by using the basic building blocks used in Shostak schema or by means of rewriting techniques.
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 3407 |
|---|
| A08 | 01 | 1 | ENG | @1 Nelson-oppen, shostak and the extended canonizer : A family picture with a newborn |
|---|
| A09 | 01 | 1 | ENG | @1 Theoretical aspects of computing - ICTAC 2004 : Guiyang, 20-24 September 2004, revised selected papers |
|---|
| A11 | 01 | 1 | | @1 RANISE (Silvio) |
|---|
| A11 | 02 | 1 | | @1 RINGEISSEN (Christophe) |
|---|
| A11 | 03 | 1 | | @1 TRAN (Duc-Khanh) |
|---|
| A12 | 01 | 1 | | @1 LIU (Zhiming) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 ARAKI (Keijiro) @9 ed. |
|---|
| A14 | 01 | | | @1 LORIA - INRIA, 615, rue du Jardin Botanique, BP 101 @2 54602 Villers-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut. |
|---|
| A20 | | | | @1 372-386 |
|---|
| A21 | | | | @1 2005 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-25304-1 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000124475210250 |
|---|
| A44 | | | | @0 0000 @1 © 2005 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 26 ref. |
|---|
| A47 | 01 | 1 | | @0 05-0360398 |
|---|
| 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 We consider the problem of building satisfiability procedures for unions of disjoint theories. We briefly review the combination schemas proposed by Nelson-Oppen, Shostak, and others. Three inference systems are directly derived from the properties satisfied by the theories being combined and known results from the literature are obtained in a uniform and abstract way. This rational reconstruction is the starting point for further investigations. We introduce the concept of extended canonizer and derive a modularity result for a new class of theories (larger than Shostak and smaller than Nelson-Oppen theories) which is closed under disjoint union. This is in contrast with the lack of modularity of Shostak theories. We also explain how to implement extended canonizers by using the basic building blocks used in Shostak schema or by means of rewriting techniques. |
|---|
| C02 | 01 | X | | @0 001D02 |
|---|
| C03 | 01 | X | FRE | @0 Inférence @5 06 |
|---|
| C03 | 01 | X | ENG | @0 Inference @5 06 |
|---|
| C03 | 01 | X | SPA | @0 Inferencia @5 06 |
|---|
| C03 | 02 | X | FRE | @0 Réécriture @5 18 |
|---|
| C03 | 02 | X | ENG | @0 Rewriting @5 18 |
|---|
| C03 | 02 | X | SPA | @0 Reescritura @5 18 |
|---|
| C03 | 03 | X | FRE | @0 Problème satisfiabilité @5 23 |
|---|
| C03 | 03 | X | ENG | @0 Satisfiability problem @5 23 |
|---|
| C03 | 03 | X | SPA | @0 Problema satisfactibilidad @5 23 |
|---|
| C03 | 04 | X | FRE | @0 Modularité @4 CD @5 96 |
|---|
| C03 | 04 | X | ENG | @0 Modularity @4 CD @5 96 |
|---|
| C03 | 04 | X | SPA | @0 Modularidad @4 CD @5 96 |
|---|
| N21 | | | | @1 248 |
|---|
| N44 | 01 | | | @1 OTO |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Theoretical aspects of computing. International colloquium @2 1 @3 Guiyang CHN @4 2004-09-20 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 05-0360398 INIST |
|---|
| ET : | Nelson-oppen, shostak and the extended canonizer : A family picture with a newborn |
|---|
| AU : | RANISE (Silvio); RINGEISSEN (Christophe); TRAN (Duc-Khanh); LIU (Zhiming); ARAKI (Keijiro) |
|---|
| AF : | LORIA - INRIA, 615, rue du Jardin Botanique, BP 101/54602 Villers-lès-Nancy/France (1 aut., 2 aut., 3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2005; Vol. 3407; Pp. 372-386; Bibl. 26 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | We consider the problem of building satisfiability procedures for unions of disjoint theories. We briefly review the combination schemas proposed by Nelson-Oppen, Shostak, and others. Three inference systems are directly derived from the properties satisfied by the theories being combined and known results from the literature are obtained in a uniform and abstract way. This rational reconstruction is the starting point for further investigations. We introduce the concept of extended canonizer and derive a modularity result for a new class of theories (larger than Shostak and smaller than Nelson-Oppen theories) which is closed under disjoint union. This is in contrast with the lack of modularity of Shostak theories. We also explain how to implement extended canonizers by using the basic building blocks used in Shostak schema or by means of rewriting techniques. |
|---|
| CC : | 001D02 |
|---|
| FD : | Inférence; Réécriture; Problème satisfiabilité; Modularité |
|---|
| ED : | Inference; Rewriting; Satisfiability problem; Modularity |
|---|
| SD : | Inferencia; Reescritura; Problema satisfactibilidad; Modularidad |
|---|
| LO : | INIST-16343.354000124475210250 |
|---|
| ID : | 05-0360398 |
|---|
Links to Exploration step
Pascal:05-0360398
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Nelson-oppen, shostak and the extended canonizer : A family picture with a newborn</title>
<author><name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - INRIA, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - INRIA, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Tran, Duc Khanh" sort="Tran, Duc Khanh" uniqKey="Tran D" first="Duc-Khanh" last="Tran">Duc-Khanh Tran</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - INRIA, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">05-0360398</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 05-0360398 INIST</idno>
<idno type="RBID">Pascal:05-0360398</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000533</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Nelson-oppen, shostak and the extended canonizer : A family picture with a newborn</title>
<author><name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - INRIA, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - INRIA, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Tran, Duc Khanh" sort="Tran, Duc Khanh" uniqKey="Tran D" first="Duc-Khanh" last="Tran">Duc-Khanh Tran</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - INRIA, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 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>Inference</term>
<term>Modularity</term>
<term>Rewriting</term>
<term>Satisfiability problem</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Inférence</term>
<term>Réécriture</term>
<term>Problème satisfiabilité</term>
<term>Modularité</term>
</keywords><front><div type="abstract" xml:lang="en">We consider the problem of building satisfiability procedures for unions of disjoint theories. We briefly review the combination schemas proposed by Nelson-Oppen, Shostak, and others. Three inference systems are directly derived from the properties satisfied by the theories being combined and known results from the literature are obtained in a uniform and abstract way. This rational reconstruction is the starting point for further investigations. We introduce the concept of extended canonizer and derive a modularity result for a new class of theories (larger than Shostak and smaller than Nelson-Oppen theories) which is closed under disjoint union. This is in contrast with the lack of modularity of Shostak theories. We also explain how to implement extended canonizers by using the basic building blocks used in Shostak schema or by means of rewriting techniques.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>3407</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Nelson-oppen, shostak and the extended canonizer : A family picture with a newborn</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Theoretical aspects of computing - ICTAC 2004 : Guiyang, 20-24 September 2004, revised selected papers</s1>
</fA09><fA11 i1="01" i2="1"><s1>RANISE (Silvio)</s1>
</fA11><fA11 i1="02" i2="1"><s1>RINGEISSEN (Christophe)</s1>
</fA11><fA11 i1="03" i2="1"><s1>TRAN (Duc-Khanh)</s1>
</fA11><fA12 i1="01" i2="1"><s1>LIU (Zhiming)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>ARAKI (Keijiro)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>LORIA - INRIA, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14><fA20><s1>372-386</s1>
</fA20><fA21><s1>2005</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-25304-1</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000124475210250</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2005 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>26 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>05-0360398</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>We consider the problem of building satisfiability procedures for unions of disjoint theories. We briefly review the combination schemas proposed by Nelson-Oppen, Shostak, and others. Three inference systems are directly derived from the properties satisfied by the theories being combined and known results from the literature are obtained in a uniform and abstract way. This rational reconstruction is the starting point for further investigations. We introduce the concept of extended canonizer and derive a modularity result for a new class of theories (larger than Shostak and smaller than Nelson-Oppen theories) which is closed under disjoint union. This is in contrast with the lack of modularity of Shostak theories. We also explain how to implement extended canonizers by using the basic building blocks used in Shostak schema or by means of rewriting techniques.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Inférence</s0>
<s5>06</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Inference</s0>
<s5>06</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Inferencia</s0>
<s5>06</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Réécriture</s0>
<s5>18</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Rewriting</s0>
<s5>18</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Reescritura</s0>
<s5>18</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Problème satisfiabilité</s0>
<s5>23</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Satisfiability problem</s0>
<s5>23</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Problema satisfactibilidad</s0>
<s5>23</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Modularité</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Modularity</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Modularidad</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fN21><s1>248</s1>
</fN21><fN44 i1="01"><s1>OTO</s1>
</fN44><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>Theoretical aspects of computing. International colloquium</s1>
<s2>1</s2>
<s3>Guiyang CHN</s3>
<s4>2004-09-20</s4>
</fA30><server><NO>PASCAL 05-0360398 INIST</NO>
<ET>Nelson-oppen, shostak and the extended canonizer : A family picture with a newborn</ET>
<AU>RANISE (Silvio); RINGEISSEN (Christophe); TRAN (Duc-Khanh); LIU (Zhiming); ARAKI (Keijiro)</AU>
<AF>LORIA - INRIA, 615, rue du Jardin Botanique, BP 101/54602 Villers-lès-Nancy/France (1 aut., 2 aut., 3 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. 3407; Pp. 372-386; Bibl. 26 ref.</SO>
<LA>Anglais</LA>
<EA>We consider the problem of building satisfiability procedures for unions of disjoint theories. We briefly review the combination schemas proposed by Nelson-Oppen, Shostak, and others. Three inference systems are directly derived from the properties satisfied by the theories being combined and known results from the literature are obtained in a uniform and abstract way. This rational reconstruction is the starting point for further investigations. We introduce the concept of extended canonizer and derive a modularity result for a new class of theories (larger than Shostak and smaller than Nelson-Oppen theories) which is closed under disjoint union. This is in contrast with the lack of modularity of Shostak theories. We also explain how to implement extended canonizers by using the basic building blocks used in Shostak schema or by means of rewriting techniques.</EA>
<CC>001D02</CC>
<FD>Inférence; Réécriture; Problème satisfiabilité; Modularité</FD>
<ED>Inference; Rewriting; Satisfiability problem; Modularity</ED>
<SD>Inferencia; Reescritura; Problema satisfactibilidad; Modularidad</SD>
<LO>INIST-16343.354000124475210250</LO>
<ID>05-0360398</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 000533 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000533 | 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:05-0360398
|texte= Nelson-oppen, shostak and the extended canonizer : A family picture with a newborn
}}
| 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 |  |
