InforLorV4, PascalFrancis, Curation, bibRecord, 000143

Uniform derivation of decision procedures by superposition

Identifieur interne : 000143 ( PascalFrancis/Curation ); précédent : 000142; suivant : 000144

Uniform derivation of decision procedures by superposition

Auteurs : Alessandro Armando [Italie] ; Silvio Ranise [Italie, France] ; Michaël Rusinowitch [France]

Source :

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

RBID : Pascal:01-0484641

Descripteurs français

Pascal (Inist)
- Démonstration automatique, Logique ordre 1, Système réécriture, Théorie équationnelle, Liste, Homomorphisme, Superposition, Théorie décision, Extensionnalité.

English descriptors

KwdEn :
- Automatic proving, Decision theory, Equational theory, Extensionality, First order logic, Homomorphism, List, Rewriting systems, Superposition.

Abstract

We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly as a decision procedure for various theories including lists, arrays, extensional arrays and combinations of them. We also give a superposition-based decision procedure for homomorphism.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2142`
A08	`01`	`1`	`ENG`	`@1 Uniform derivation of decision procedures by superposition`
A09	`01`	`1`	`ENG`	`@1 CSL 2001 : computer science logic : Paris, 10-13 September 2001`
A11	`01`	`1`		`@1 ARMANDO (Alessandro)`
A11	`02`	`1`		`@1 RANISE (Silvio)`
A11	`03`	`1`		`@1 RUSINOWITCH (Michaël)`
A12	`01`	`1`		`@1 FRIBOURG (Laurent) @9 ed.`
A14	`01`			`@1 DIST-Università degli Studi di Genova, via all'Opera Pia 13 @2 16145, Genova @3 ITA @Z 1 aut. @Z 2 aut.`
A14	`02`			`@1 LORIA-INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101 @2 54602 Villers les Nancy @3 FRA @Z 2 aut. @Z 3 aut.`
A20				`@1 513-527`
A21				`@1 2001`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-42554-3`
A43	`01`			`@1 INIST @2 16343 @5 354000097008900360`
A44				`@0 0000 @1 © 2001 INIST-CNRS. All rights reserved.`
A45				`@0 19 ref.`
A47	`01`	`1`		`@0 01-0484641`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
A66	`02`			`@0 USA`
C01	`01`		`ENG`	`@0 We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly as a decision procedure for various theories including lists, arrays, extensional arrays and combinations of them. We also give a superposition-based decision procedure for homomorphism.`
C02	`01`	`X`		`@0 001D02A04`
C03	`01`	`X`	`FRE`	`@0 Démonstration automatique @5 04`
C03	`01`	`X`	`ENG`	`@0 Automatic proving @5 04`
C03	`01`	`X`	`SPA`	`@0 Demostración automática @5 04`
C03	`02`	`X`	`FRE`	`@0 Logique ordre 1 @5 06`
C03	`02`	`X`	`ENG`	`@0 First order logic @5 06`
C03	`02`	`X`	`SPA`	`@0 Lógica orden 1 @5 06`
C03	`03`	`3`	`FRE`	`@0 Système réécriture @5 08`
C03	`03`	`3`	`ENG`	`@0 Rewriting systems @5 08`
C03	`04`	`X`	`FRE`	`@0 Théorie équationnelle @5 09`
C03	`04`	`X`	`ENG`	`@0 Equational theory @5 09`
C03	`04`	`X`	`SPA`	`@0 Teoría ecuaciónal @5 09`
C03	`05`	`X`	`FRE`	`@0 Liste @5 10`
C03	`05`	`X`	`ENG`	`@0 List @5 10`
C03	`05`	`X`	`SPA`	`@0 Lista @5 10`
C03	`06`	`X`	`FRE`	`@0 Homomorphisme @5 11`
C03	`06`	`X`	`ENG`	`@0 Homomorphism @5 11`
C03	`06`	`X`	`SPA`	`@0 Homomorfismo @5 11`
C03	`07`	`X`	`FRE`	`@0 Superposition @5 12`
C03	`07`	`X`	`ENG`	`@0 Superposition @5 12`
C03	`07`	`X`	`SPA`	`@0 Superposición @5 12`
C03	`08`	`X`	`FRE`	`@0 Théorie décision @5 13`
C03	`08`	`X`	`ENG`	`@0 Decision theory @5 13`
C03	`08`	`X`	`SPA`	`@0 Teoría decisión @5 13`
C03	`09`	`X`	`FRE`	`@0 Extensionnalité @4 CD @5 96`
C03	`09`	`X`	`ENG`	`@0 Extensionality @4 CD @5 96`
N21				`@1 344`

A30	`01`	`1`	`ENG`	`@1 Computer science logic. International workshop @2 15 @3 Paris FRA @4 2001-09-10`
A30	`02`	`1`	`ENG`	`@1 EACSL. Annual conference @2 10 @3 Paris FRA @4 2001-09-10`

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

to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000933

Links to Exploration step

Pascal:01-0484641

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Uniform derivation of decision procedures by superposition</title>
<author><name sortKey="Armando, Alessandro" sort="Armando, Alessandro" uniqKey="Armando A" first="Alessandro" last="Armando">Alessandro Armando</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>DIST-Università degli Studi di Genova, via all'Opera Pia 13</s1>
<s2>16145, Genova</s2>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Italie</country>
</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>DIST-Università degli Studi di Genova, via all'Opera Pia 13</s1>
<s2>16145, Genova</s2>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Italie</country>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LORIA-INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers les Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LORIA-INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers les Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">01-0484641</idno>
<date when="2001">2001</date>
<idno type="stanalyst">PASCAL 01-0484641 INIST</idno>
<idno type="RBID">Pascal:01-0484641</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000933</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000143</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Uniform derivation of decision procedures by superposition</title>
<author><name sortKey="Armando, Alessandro" sort="Armando, Alessandro" uniqKey="Armando A" first="Alessandro" last="Armando">Alessandro Armando</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>DIST-Università degli Studi di Genova, via all'Opera Pia 13</s1>
<s2>16145, Genova</s2>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Italie</country>
</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>DIST-Università degli Studi di Genova, via all'Opera Pia 13</s1>
<s2>16145, Genova</s2>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Italie</country>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LORIA-INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers les Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LORIA-INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers les Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2001">2001</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>Automatic proving</term>
<term>Decision theory</term>
<term>Equational theory</term>
<term>Extensionality</term>
<term>First order logic</term>
<term>Homomorphism</term>
<term>List</term>
<term>Rewriting systems</term>
<term>Superposition</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Démonstration automatique</term>
<term>Logique ordre 1</term>
<term>Système réécriture</term>
<term>Théorie équationnelle</term>
<term>Liste</term>
<term>Homomorphisme</term>
<term>Superposition</term>
<term>Théorie décision</term>
<term>Extensionnalité</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly as a decision procedure for various theories including lists, arrays, extensional arrays and combinations of them. We also give a superposition-based decision procedure for homomorphism.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2142</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Uniform derivation of decision procedures by superposition</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>CSL 2001 : computer science logic : Paris, 10-13 September 2001</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>ARMANDO (Alessandro)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>RANISE (Silvio)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>RUSINOWITCH (Michaël)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>FRIBOURG (Laurent)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>DIST-Università degli Studi di Genova, via all'Opera Pia 13</s1>
<s2>16145, Genova</s2>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LORIA-INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers les Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>513-527</s1>
</fA20>
<fA21><s1>2001</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-42554-3</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000097008900360</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2001 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>19 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>01-0484641</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>
<fA66 i1="02"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly as a decision procedure for various theories including lists, arrays, extensional arrays and combinations of them. We also give a superposition-based decision procedure for homomorphism.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A04</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Démonstration automatique</s0>
<s5>04</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Automatic proving</s0>
<s5>04</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Demostración automática</s0>
<s5>04</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Logique ordre 1</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>First order logic</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Lógica orden 1</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="3" l="FRE"><s0>Système réécriture</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="3" l="ENG"><s0>Rewriting systems</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Théorie équationnelle</s0>
<s5>09</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Equational theory</s0>
<s5>09</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Teoría ecuaciónal</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Liste</s0>
<s5>10</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>List</s0>
<s5>10</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Lista</s0>
<s5>10</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Homomorphisme</s0>
<s5>11</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Homomorphism</s0>
<s5>11</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Homomorfismo</s0>
<s5>11</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Superposition</s0>
<s5>12</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Superposition</s0>
<s5>12</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Superposición</s0>
<s5>12</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Théorie décision</s0>
<s5>13</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Decision theory</s0>
<s5>13</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Teoría decisión</s0>
<s5>13</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Extensionnalité</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Extensionality</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>344</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Computer science logic. International workshop</s1>
<s2>15</s2>
<s3>Paris FRA</s3>
<s4>2001-09-10</s4>
</fA30>
<fA30 i1="02" i2="1" l="ENG"><s1>EACSL. Annual conference</s1>
<s2>10</s2>
<s3>Paris FRA</s3>
<s4>2001-09-10</s4>
</fA30>
</pR>
</standard>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000143 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000143 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Curation
   |type=    RBID
   |clé=     Pascal:01-0484641
   |texte=   Uniform derivation of decision procedures by superposition
}}

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

Uniform derivation of decision procedures by superposition

Uniform derivation of decision procedures by superposition

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