InforLorV4, PascalFrancis, Curation, bibRecord, 000280

A rewriting approach to satisfiability procedures

Identifieur interne : 000280 ( PascalFrancis/Curation ); précédent : 000279; suivant : 000281

A rewriting approach to satisfiability procedures

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

Source :

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

RBID : Pascal:03-0426820

Descripteurs français

Pascal (Inist)
- Informatique théorique, Logique mathématique, Système réécriture, Théorie preuve, Traitement liste, Homomorphisme, Extension, Satisfaisabilité, Logique ordre 1, Superposition, Cryptage, Logique équationnelle, Déduction automatique, Réécriture terme, Procédure décision.

English descriptors

KwdEn :
- Automated deduction, Computer theory, Decision procedure, Encryption, Equational logic, Extension, First order logic, Homomorphism, List processing, Mathematical logic, Proof theory, Rewriting systems, Satisfiability, Superposition, Term rewriting.

Abstract

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

A01	`01`	`1`		`@0 0890-5401`
A02	`01`			`@0 INFCEC`
A03		`1`		`@0 Inf. comput. : (Print)`
A05				`@2 183`
A06				`@2 2`
A08	`01`	`1`	`ENG`	`@1 A rewriting approach to satisfiability procedures`
A09	`01`	`1`	`ENG`	`@1 Special issue: RTA 2001`
A11	`01`	`1`		`@1 ARMANDO (Alessandro)`
A11	`02`	`1`		`@1 RANISE (Silvio)`
A11	`03`	`1`		`@1 RUSINOWITCH (Michaël)`
A12	`01`	`1`		`@1 MIDDLEDORP (Aart) @9 ed.`
A14	`01`			`@1 DIST-Università degli Studi di Genova, via all'Opera Pia 13 @2 Genova 16145 @3 ITA @Z 1 aut. @Z 2 aut.`
A14	`02`			`@1 LORIA & INRIA-Lorraine, 615, rue du Jardin Botanique, BP 101 @2 Villers les Nancy 54602 @3 FRA @Z 2 aut. @Z 3 aut.`
A20				`@1 140-164`
A21				`@1 2003`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 8341 @5 354000118333900010`
A44				`@0 0000 @1 © 2003 INIST-CNRS. All rights reserved.`
A45				`@0 39 ref.`
A47	`01`	`1`		`@0 03-0426820`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Information and computation : (Print)`
A66	`01`			`@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 for deciding satisfiability in various theories including lists, encryption, extensional arrays, extensional finite sets, and combinations of them. We also give a superposition-based decision procedure for homomorphism.`
C02	`01`	`X`		`@0 001A02A01F`
C02	`02`	`X`		`@0 001D02A05`
C02	`03`	`X`		`@0 001D02B07B`
C02	`04`	`X`		`@0 001A02C07`
C03	`01`	`X`	`FRE`	`@0 Informatique théorique @5 01`
C03	`01`	`X`	`ENG`	`@0 Computer theory @5 01`
C03	`01`	`X`	`SPA`	`@0 Informática teórica @5 01`
C03	`02`	`X`	`FRE`	`@0 Logique mathématique @5 02`
C03	`02`	`X`	`ENG`	`@0 Mathematical logic @5 02`
C03	`02`	`X`	`SPA`	`@0 Lógica matemática @5 02`
C03	`03`	`3`	`FRE`	`@0 Système réécriture @5 03`
C03	`03`	`3`	`ENG`	`@0 Rewriting systems @5 03`
C03	`04`	`X`	`FRE`	`@0 Théorie preuve @5 04`
C03	`04`	`X`	`ENG`	`@0 Proof theory @5 04`
C03	`04`	`X`	`SPA`	`@0 Teoría demonstración @5 04`
C03	`05`	`X`	`FRE`	`@0 Traitement liste @5 05`
C03	`05`	`X`	`ENG`	`@0 List processing @5 05`
C03	`05`	`X`	`SPA`	`@0 Tratamiento lista @5 05`
C03	`06`	`X`	`FRE`	`@0 Homomorphisme @5 06`
C03	`06`	`X`	`ENG`	`@0 Homomorphism @5 06`
C03	`06`	`X`	`SPA`	`@0 Homomorfismo @5 06`
C03	`07`	`X`	`FRE`	`@0 Extension @5 07`
C03	`07`	`X`	`ENG`	`@0 Extension @5 07`
C03	`07`	`X`	`SPA`	`@0 Extensión @5 07`
C03	`08`	`X`	`FRE`	`@0 Satisfaisabilité @5 08`
C03	`08`	`X`	`ENG`	`@0 Satisfiability @5 08`
C03	`08`	`X`	`SPA`	`@0 Satisfactoriabilidad @5 08`
C03	`09`	`X`	`FRE`	`@0 Logique ordre 1 @5 09`
C03	`09`	`X`	`ENG`	`@0 First order logic @5 09`
C03	`09`	`X`	`SPA`	`@0 Lógica orden 1 @5 09`
C03	`10`	`X`	`FRE`	`@0 Superposition @5 11`
C03	`10`	`X`	`ENG`	`@0 Superposition @5 11`
C03	`10`	`X`	`SPA`	`@0 Superposición @5 11`
C03	`11`	`X`	`FRE`	`@0 Cryptage @5 12`
C03	`11`	`X`	`ENG`	`@0 Encryption @5 12`
C03	`11`	`X`	`SPA`	`@0 Cifrado @5 12`
C03	`12`	`X`	`FRE`	`@0 Logique équationnelle @4 CD @5 96`
C03	`12`	`X`	`ENG`	`@0 Equational logic @4 CD @5 96`
C03	`13`	`X`	`FRE`	`@0 Déduction automatique @4 CD @5 97`
C03	`13`	`X`	`ENG`	`@0 Automated deduction @4 CD @5 97`
C03	`14`	`X`	`FRE`	`@0 Réécriture terme @4 CD @5 98`
C03	`14`	`X`	`ENG`	`@0 Term rewriting @4 CD @5 98`
C03	`15`	`X`	`FRE`	`@0 Procédure décision @4 CD @5 99`
C03	`15`	`X`	`ENG`	`@0 Decision procedure @4 CD @5 99`
N21				`@1 293`

A30	`01`	`1`	`ENG`	`@1 RTA 2001 International Conference on Rewriting Techniques and Applications @2 12 @3 Utrecht NLD @4 2001-05-22`

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

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

Links to Exploration step

Pascal:03-0426820

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A rewriting approach to satisfiability procedures</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>Genova 16145</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>Genova 16145</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>Villers les Nancy 54602</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>Villers les Nancy 54602</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">03-0426820</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 03-0426820 INIST</idno>
<idno type="RBID">Pascal:03-0426820</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000763</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000280</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A rewriting approach to satisfiability procedures</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>Genova 16145</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>Genova 16145</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>Villers les Nancy 54602</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>Villers les Nancy 54602</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">Information and computation : (Print)</title>
<title level="j" type="abbreviated">Inf. comput. : (Print)</title>
<idno type="ISSN">0890-5401</idno>
<imprint><date when="2003">2003</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>Automated deduction</term>
<term>Computer theory</term>
<term>Decision procedure</term>
<term>Encryption</term>
<term>Equational logic</term>
<term>Extension</term>
<term>First order logic</term>
<term>Homomorphism</term>
<term>List processing</term>
<term>Mathematical logic</term>
<term>Proof theory</term>
<term>Rewriting systems</term>
<term>Satisfiability</term>
<term>Superposition</term>
<term>Term rewriting</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Logique mathématique</term>
<term>Système réécriture</term>
<term>Théorie preuve</term>
<term>Traitement liste</term>
<term>Homomorphisme</term>
<term>Extension</term>
<term>Satisfaisabilité</term>
<term>Logique ordre 1</term>
<term>Superposition</term>
<term>Cryptage</term>
<term>Logique équationnelle</term>
<term>Déduction automatique</term>
<term>Réécriture terme</term>
<term>Procédure décision</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 for deciding satisfiability in various theories including lists, encryption, extensional arrays, extensional finite sets, 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>0890-5401</s0>
</fA01>
<fA02 i1="01"><s0>INFCEC</s0>
</fA02>
<fA03 i2="1"><s0>Inf. comput. : (Print)</s0>
</fA03>
<fA05><s2>183</s2>
</fA05>
<fA06><s2>2</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>A rewriting approach to satisfiability procedures</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Special issue: RTA 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>MIDDLEDORP (Aart)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>DIST-Università degli Studi di Genova, via all'Opera Pia 13</s1>
<s2>Genova 16145</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>Villers les Nancy 54602</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>140-164</s1>
</fA20>
<fA21><s1>2003</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>8341</s2>
<s5>354000118333900010</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2003 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>39 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>03-0426820</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</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>We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly for deciding satisfiability in various theories including lists, encryption, extensional arrays, extensional finite sets, and combinations of them. We also give a superposition-based decision procedure for homomorphism.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001A02A01F</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A05</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001D02B07B</s0>
</fC02>
<fC02 i1="04" i2="X"><s0>001A02C07</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Logique mathématique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Mathematical logic</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Lógica matemática</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="3" l="FRE"><s0>Système réécriture</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="3" l="ENG"><s0>Rewriting systems</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Théorie preuve</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Proof theory</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Teoría demonstración</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Traitement liste</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>List processing</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Tratamiento lista</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Homomorphisme</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Homomorphism</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Homomorfismo</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Extension</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Extension</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Extensión</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Satisfaisabilité</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Satisfiability</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Satisfactoriabilidad</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Logique ordre 1</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>First order logic</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Lógica orden 1</s0>
<s5>09</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Superposition</s0>
<s5>11</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Superposition</s0>
<s5>11</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Superposición</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Cryptage</s0>
<s5>12</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Encryption</s0>
<s5>12</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Cifrado</s0>
<s5>12</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Logique équationnelle</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Equational logic</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Déduction automatique</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Automated deduction</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fC03 i1="14" i2="X" l="FRE"><s0>Réécriture terme</s0>
<s4>CD</s4>
<s5>98</s5>
</fC03>
<fC03 i1="14" i2="X" l="ENG"><s0>Term rewriting</s0>
<s4>CD</s4>
<s5>98</s5>
</fC03>
<fC03 i1="15" i2="X" l="FRE"><s0>Procédure décision</s0>
<s4>CD</s4>
<s5>99</s5>
</fC03>
<fC03 i1="15" i2="X" l="ENG"><s0>Decision procedure</s0>
<s4>CD</s4>
<s5>99</s5>
</fC03>
<fN21><s1>293</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>RTA 2001 International Conference on Rewriting Techniques and Applications</s1>
<s2>12</s2>
<s3>Utrecht NLD</s3>
<s4>2001-05-22</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 000280 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000280 | 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:03-0426820
   |texte=   A rewriting approach to satisfiability procedures
}}

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 rewriting approach to satisfiability procedures

A rewriting approach to satisfiability procedures

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