InforLorV4, PascalFrancis, Corpus, bibRecord, 000416

A new combination procedure for the word problem that generalizes fusion decidability results in modal logics

Identifieur interne : 000416 ( PascalFrancis/Corpus ); précédent : 000415; suivant : 000417

A new combination procedure for the word problem that generalizes fusion decidability results in modal logics

Auteurs : Franz Baader ; Silvio Ghilardi ; Cesare Tinelli

Source :

Information and computation : (Print) [ 0890-5401 ] ; 2006.

RBID : Pascal:06-0527634

Descripteurs français

Pascal (Inist)
- Mot, Décidabilité, Logique modale, Décision, Théorie équationnelle, Partage, Algèbre Boole, Théorie type, Informatique théorique, Procédure décision, Problème mot, 03B45, 06Exx, 03B15.

English descriptors

KwdEn :
- Boolean algebra, Computer theory, Decidability, Decision, Equational theory, Modal logic, Sharing, Type theory, Word.

Abstract

Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics-which are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other types of equational theories. In this paper, we present a new approach for combining decision procedures for the word problem in the non-disjoint case that applies to equational theories induced by modal logics, but is not restricted to them. The known fusion decidability results for modal logics are instances of our approach. However, even for equational theories induced by modal logics our results are more general since they are not restricted to so-called normal modal logics.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0890-5401`
A02	`01`			`@0 INFCEC`
A03		`1`		`@0 Inf. comput. : (Print)`
A05				`@2 204`
A06				`@2 10`
A08	`01`	`1`	`ENG`	`@1 A new combination procedure for the word problem that generalizes fusion decidability results in modal logics`
A09	`01`	`1`	`ENG`	`@1 Combining logical systems`
A11	`01`	`1`		`@1 BAADER (Franz)`
A11	`02`	`1`		`@1 GHILARDI (Silvio)`
A11	`03`	`1`		`@1 TINELLI (Cesare)`
A12	`01`	`1`		`@1 ARMANDO (Alessandro) @9 ed.`
A12	`02`	`1`		`@1 RINGEISSEN (Christophe) @9 ed.`
A14	`01`			`@1 Institut fur Theoretische Informatik, TU Dresden @3 DEU @Z 1 aut.`
A14	`02`			`@1 Dipartimen to di Scienze dell'Informazione, Università degli Studi di Milano @3 ITA @Z 2 aut.`
A14	`03`			`@1 Department of Computer Science, The University of Iowa @3 USA @Z 3 aut.`
A15	`01`			`@1 DIST, University of Genova @3 ITA @Z 1 aut.`
A15	`02`			`@1 LORIA & INRIA-Lorraine @2 54500 Vandoeuvre-les-Nancy @3 FRA @Z 2 aut.`
A20				`@1 1413-1452`
A21				`@1 2006`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 8341 @5 354000157254510010`
A44				`@0 0000 @1 © 2006 INIST-CNRS. All rights reserved.`
A45				`@0 48 ref.`
A47	`01`	`1`		`@0 06-0527634`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Information and computation : (Print)`
A66	`01`			`@0 USA`
C01	`01`		`ENG`	@0 Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics-which are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other types of equational theories. In this paper, we present a new approach for combining decision procedures for the word problem in the non-disjoint case that applies to equational theories induced by modal logics, but is not restricted to them. The known fusion decidability results for modal logics are instances of our approach. However, even for equational theories induced by modal logics our results are more general since they are not restricted to so-called normal modal logics.
C02	`01`	`X`		`@0 001D02A08`
C02	`02`	`X`		`@0 001A02A01B`
C02	`03`	`X`		`@0 001A02B02`
C03	`01`	`X`	`FRE`	`@0 Mot @5 17`
C03	`01`	`X`	`ENG`	`@0 Word @5 17`
C03	`01`	`X`	`SPA`	`@0 Palabra @5 17`
C03	`02`	`X`	`FRE`	`@0 Décidabilité @5 18`
C03	`02`	`X`	`ENG`	`@0 Decidability @5 18`
C03	`02`	`X`	`SPA`	`@0 Decidibilidad @5 18`
C03	`03`	`X`	`FRE`	`@0 Logique modale @5 19`
C03	`03`	`X`	`ENG`	`@0 Modal logic @5 19`
C03	`03`	`X`	`SPA`	`@0 Lógica modal @5 19`
C03	`04`	`X`	`FRE`	`@0 Décision @5 20`
C03	`04`	`X`	`ENG`	`@0 Decision @5 20`
C03	`04`	`X`	`SPA`	`@0 Decisión @5 20`
C03	`05`	`X`	`FRE`	`@0 Théorie équationnelle @5 21`
C03	`05`	`X`	`ENG`	`@0 Equational theory @5 21`
C03	`05`	`X`	`SPA`	`@0 Teoría ecuaciónal @5 21`
C03	`06`	`X`	`FRE`	`@0 Partage @5 22`
C03	`06`	`X`	`ENG`	`@0 Sharing @5 22`
C03	`06`	`X`	`SPA`	`@0 Partición @5 22`
C03	`07`	`X`	`FRE`	`@0 Algèbre Boole @5 23`
C03	`07`	`X`	`ENG`	`@0 Boolean algebra @5 23`
C03	`07`	`X`	`SPA`	`@0 Algebra Boole @5 23`
C03	`08`	`3`	`FRE`	`@0 Théorie type @5 24`
C03	`08`	`3`	`ENG`	`@0 Type theory @5 24`
C03	`09`	`X`	`FRE`	`@0 Informatique théorique @5 25`
C03	`09`	`X`	`ENG`	`@0 Computer theory @5 25`
C03	`09`	`X`	`SPA`	`@0 Informática teórica @5 25`
C03	`10`	`X`	`FRE`	`@0 Procédure décision @4 INC @5 70`
C03	`11`	`X`	`FRE`	`@0 Problème mot @4 INC @5 71`
C03	`12`	`X`	`FRE`	`@0 03B45 @4 INC @5 72`
C03	`13`	`X`	`FRE`	`@0 06Exx @4 INC @5 73`
C03	`14`	`X`	`FRE`	`@0 03B15 @4 INC @5 74`
N21				`@1 346`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

Format Inist (serveur)

NO :	PASCAL 06-0527634 INIST
ET :	A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
AU :	BAADER (Franz); GHILARDI (Silvio); TINELLI (Cesare); ARMANDO (Alessandro); RINGEISSEN (Christophe)
AF :	Institut fur Theoretische Informatik, TU Dresden/Allemagne (1 aut.); Dipartimen to di Scienze dell'Informazione, Università degli Studi di Milano/Italie (2 aut.); Department of Computer Science, The University of Iowa/Etats-Unis (3 aut.); DIST, University of Genova/Italie (1 aut.); LORIA & INRIA-Lorraine/54500 Vandoeuvre-les-Nancy/France (2 aut.)
DT :	Publication en série; Niveau analytique
SO :	Information and computation : (Print); ISSN 0890-5401; Coden INFCEC; Etats-Unis; Da. 2006; Vol. 204; No. 10; Pp. 1413-1452; Bibl. 48 ref.
LA :	Anglais
EA :	Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics-which are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other types of equational theories. In this paper, we present a new approach for combining decision procedures for the word problem in the non-disjoint case that applies to equational theories induced by modal logics, but is not restricted to them. The known fusion decidability results for modal logics are instances of our approach. However, even for equational theories induced by modal logics our results are more general since they are not restricted to so-called normal modal logics.
CC :	001D02A08; 001A02A01B; 001A02B02
FD :	Mot; Décidabilité; Logique modale; Décision; Théorie équationnelle; Partage; Algèbre Boole; Théorie type; Informatique théorique; Procédure décision; Problème mot; 03B45; 06Exx; 03B15
ED :	Word; Decidability; Modal logic; Decision; Equational theory; Sharing; Boolean algebra; Type theory; Computer theory
SD :	Palabra; Decidibilidad; Lógica modal; Decisión; Teoría ecuaciónal; Partición; Algebra Boole; Informática teórica
LO :	INIST-8341.354000157254510010
ID :	06-0527634

Links to Exploration step

Pascal:06-0527634

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A new combination procedure for the word problem that generalizes fusion decidability results in modal logics</title>
<author><name sortKey="Baader, Franz" sort="Baader, Franz" uniqKey="Baader F" first="Franz" last="Baader">Franz Baader</name>
<affiliation><inist:fA14 i1="01"><s1>Institut fur Theoretische Informatik, TU Dresden</s1>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Ghilardi, Silvio" sort="Ghilardi, Silvio" uniqKey="Ghilardi S" first="Silvio" last="Ghilardi">Silvio Ghilardi</name>
<affiliation><inist:fA14 i1="02"><s1>Dipartimen to di Scienze dell'Informazione, Università degli Studi di Milano</s1>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Tinelli, Cesare" sort="Tinelli, Cesare" uniqKey="Tinelli C" first="Cesare" last="Tinelli">Cesare Tinelli</name>
<affiliation><inist:fA14 i1="03"><s1>Department of Computer Science, The University of Iowa</s1>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">06-0527634</idno>
<date when="2006">2006</date>
<idno type="stanalyst">PASCAL 06-0527634 INIST</idno>
<idno type="RBID">Pascal:06-0527634</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000416</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A new combination procedure for the word problem that generalizes fusion decidability results in modal logics</title>
<author><name sortKey="Baader, Franz" sort="Baader, Franz" uniqKey="Baader F" first="Franz" last="Baader">Franz Baader</name>
<affiliation><inist:fA14 i1="01"><s1>Institut fur Theoretische Informatik, TU Dresden</s1>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Ghilardi, Silvio" sort="Ghilardi, Silvio" uniqKey="Ghilardi S" first="Silvio" last="Ghilardi">Silvio Ghilardi</name>
<affiliation><inist:fA14 i1="02"><s1>Dipartimen to di Scienze dell'Informazione, Università degli Studi di Milano</s1>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Tinelli, Cesare" sort="Tinelli, Cesare" uniqKey="Tinelli C" first="Cesare" last="Tinelli">Cesare Tinelli</name>
<affiliation><inist:fA14 i1="03"><s1>Department of Computer Science, The University of Iowa</s1>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Information and computation : (Print)</title>
<title level="j" type="abbreviated">Inf. comput. : (Print)</title>
<idno type="ISSN">0890-5401</idno>
<imprint><date when="2006">2006</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Information and computation : (Print)</title>
<title level="j" type="abbreviated">Inf. comput. : (Print)</title>
<idno type="ISSN">0890-5401</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Boolean algebra</term>
<term>Computer theory</term>
<term>Decidability</term>
<term>Decision</term>
<term>Equational theory</term>
<term>Modal logic</term>
<term>Sharing</term>
<term>Type theory</term>
<term>Word</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Mot</term>
<term>Décidabilité</term>
<term>Logique modale</term>
<term>Décision</term>
<term>Théorie équationnelle</term>
<term>Partage</term>
<term>Algèbre Boole</term>
<term>Théorie type</term>
<term>Informatique théorique</term>
<term>Procédure décision</term>
<term>Problème mot</term>
<term>03B45</term>
<term>06Exx</term>
<term>03B15</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics-which are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other types of equational theories. In this paper, we present a new approach for combining decision procedures for the word problem in the non-disjoint case that applies to equational theories induced by modal logics, but is not restricted to them. The known fusion decidability results for modal logics are instances of our approach. However, even for equational theories induced by modal logics our results are more general since they are not restricted to so-called normal modal logics.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0890-5401</s0>
</fA01>
<fA02 i1="01"><s0>INFCEC</s0>
</fA02>
<fA03 i2="1"><s0>Inf. comput. : (Print)</s0>
</fA03>
<fA05><s2>204</s2>
</fA05>
<fA06><s2>10</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>A new combination procedure for the word problem that generalizes fusion decidability results in modal logics</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Combining logical systems</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>BAADER (Franz)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>GHILARDI (Silvio)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>TINELLI (Cesare)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>ARMANDO (Alessandro)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>RINGEISSEN (Christophe)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Institut fur Theoretische Informatik, TU Dresden</s1>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Dipartimen to di Scienze dell'Informazione, Università degli Studi di Milano</s1>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>Department of Computer Science, The University of Iowa</s1>
<s3>USA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>DIST, University of Genova</s1>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA15 i1="02"><s1>LORIA & INRIA-Lorraine</s1>
<s2>54500 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA15>
<fA20><s1>1413-1452</s1>
</fA20>
<fA21><s1>2006</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>8341</s2>
<s5>354000157254510010</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2006 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>48 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>06-0527634</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Information and computation : (Print)</s0>
</fA64>
<fA66 i1="01"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics-which are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other types of equational theories. In this paper, we present a new approach for combining decision procedures for the word problem in the non-disjoint case that applies to equational theories induced by modal logics, but is not restricted to them. The known fusion decidability results for modal logics are instances of our approach. However, even for equational theories induced by modal logics our results are more general since they are not restricted to so-called normal modal logics.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A08</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001A02A01B</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001A02B02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Mot</s0>
<s5>17</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Word</s0>
<s5>17</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Palabra</s0>
<s5>17</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Décidabilité</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Decidability</s0>
<s5>18</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Decidibilidad</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Logique modale</s0>
<s5>19</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Modal logic</s0>
<s5>19</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Lógica modal</s0>
<s5>19</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Décision</s0>
<s5>20</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Decision</s0>
<s5>20</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Decisión</s0>
<s5>20</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Théorie équationnelle</s0>
<s5>21</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Equational theory</s0>
<s5>21</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Teoría ecuaciónal</s0>
<s5>21</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Partage</s0>
<s5>22</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Sharing</s0>
<s5>22</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Partición</s0>
<s5>22</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Algèbre Boole</s0>
<s5>23</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Boolean algebra</s0>
<s5>23</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Algebra Boole</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="3" l="FRE"><s0>Théorie type</s0>
<s5>24</s5>
</fC03>
<fC03 i1="08" i2="3" l="ENG"><s0>Type theory</s0>
<s5>24</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>25</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>25</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>25</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Procédure décision</s0>
<s4>INC</s4>
<s5>70</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Problème mot</s0>
<s4>INC</s4>
<s5>71</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>03B45</s0>
<s4>INC</s4>
<s5>72</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>06Exx</s0>
<s4>INC</s4>
<s5>73</s5>
</fC03>
<fC03 i1="14" i2="X" l="FRE"><s0>03B15</s0>
<s4>INC</s4>
<s5>74</s5>
</fC03>
<fN21><s1>346</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 06-0527634 INIST</NO>
<ET>A new combination procedure for the word problem that generalizes fusion decidability results in modal logics</ET>
<AU>BAADER (Franz); GHILARDI (Silvio); TINELLI (Cesare); ARMANDO (Alessandro); RINGEISSEN (Christophe)</AU>
<AF>Institut fur Theoretische Informatik, TU Dresden/Allemagne (1 aut.); Dipartimen to di Scienze dell'Informazione, Università degli Studi di Milano/Italie (2 aut.); Department of Computer Science, The University of Iowa/Etats-Unis (3 aut.); DIST, University of Genova/Italie (1 aut.); LORIA & INRIA-Lorraine/54500 Vandoeuvre-les-Nancy/France (2 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Information and computation : (Print); ISSN 0890-5401; Coden INFCEC; Etats-Unis; Da. 2006; Vol. 204; No. 10; Pp. 1413-1452; Bibl. 48 ref.</SO>
<LA>Anglais</LA>
<EA>Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics-which are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other types of equational theories. In this paper, we present a new approach for combining decision procedures for the word problem in the non-disjoint case that applies to equational theories induced by modal logics, but is not restricted to them. The known fusion decidability results for modal logics are instances of our approach. However, even for equational theories induced by modal logics our results are more general since they are not restricted to so-called normal modal logics.</EA>
<CC>001D02A08; 001A02A01B; 001A02B02</CC>
<FD>Mot; Décidabilité; Logique modale; Décision; Théorie équationnelle; Partage; Algèbre Boole; Théorie type; Informatique théorique; Procédure décision; Problème mot; 03B45; 06Exx; 03B15</FD>
<ED>Word; Decidability; Modal logic; Decision; Equational theory; Sharing; Boolean algebra; Type theory; Computer theory</ED>
<SD>Palabra; Decidibilidad; Lógica modal; Decisión; Teoría ecuaciónal; Partición; Algebra Boole; Informática teórica</SD>
<LO>INIST-8341.354000157254510010</LO>
<ID>06-0527634</ID>
</server>
</inist>
</record>

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 000416 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000416 | 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:06-0527634
   |texte=   A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
}}

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

A new combination procedure for the word problem that generalizes fusion decidability results in modal logics

A new combination procedure for the word problem that generalizes fusion decidability results in modal logics

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

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