InforLorV4, PascalFrancis, Curation, bibRecord, 000871

Automatic decidability and combinability

Identifieur interne : 000871 ( PascalFrancis/Curation ); précédent : 000870; suivant : 000872

Automatic decidability and combinability

Auteurs : Christopher Lynch [États-Unis] ; Silvio Ranise [Italie] ; Christophe Ringeissen [France] ; Duc-Khanh Tran [Namibie]

Source :

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

RBID : Pascal:11-0330330

Descripteurs français

Pascal (Inist)
- Informatique théorique, Automatique, Décidabilité, Vérification, Equation ordre 1, Disponibilité, Coopération, Théorie décision, Arithmétique Presburger, Structure donnée, Problème satisfiabilité, Question réponse, Saturation, Résolution problème, 68Q60, Satisfiabilité, Procédure décision, Raisonnement équationnel, 68P05, Satisfiability problem, 41A40, 68T20.

English descriptors

KwdEn :
- Automatic, Availability, Computer theory, Cooperation, Data structure, Decidability, Decision theory, First order equation, Presburger arithmetic, Problem solving, Question answering, Satisfiability problem, Saturation, Verification.

Abstract

Verification problems can often be encoded as first-order validity or satisfiability problems. The availability of efficient automated theorem provers is a crucial pre-requisite for automating various verification tasks as well as their cooperation with specialized decision procedures for selected theories, such as Presburger Arithmetic. In this paper, we investigate how automated provers based on a form of equational reasoning, called paramodulation, can be used in verification tools. More precisely, given a theory T axiomatizing some data structure, we devise a procedure to answer the following questions. Is the satisfiability problem of T decidable by paramodulation? Can a procedure based on paramodulation for T be efficiently combined with other specialized procedures by using the Nelson-Oppen schema? Finally, if paramodulation decides the satisfiability problem of two theories, does it decide satisfiability in their union? The procedure capable of answering all questions above is based on Schematic Saturation; an inference system capable of over-approximating the inferences of paramodulation when solving satisfiability problems in a given theory T. Clause schemas derived by Schematic Saturation describe all clauses derived by paramodulation so that the answers to the questions above are obtained by checking that only finitely many different clause schemas are derived or that certain clause schemas are not derived.

A01	`01`	`1`		`@0 0890-5401`
A02	`01`			`@0 INFCEC`
A03		`1`		`@0 Inf. comput. : (Print)`
A05				`@2 209`
A06				`@2 7`
A08	`01`	`1`	`ENG`	`@1 Automatic decidability and combinability`
A11	`01`	`1`		`@1 LYNCH (Christopher)`
A11	`02`	`1`		`@1 RANISE (Silvio)`
A11	`03`	`1`		`@1 RINGEISSEN (Christophe)`
A11	`04`	`1`		`@1 TRAN (Duc-Khanh)`
A14	`01`			`@1 Department of Mathematics and Computer Science, P.O. Box 5815 Clarkson University @2 Potsdam, NY 13699-5815 @3 USA @Z 1 aut.`
A14	`02`			`@1 FBK-Irst, Via Sommarive 18 @2 38100 Povo, Trento @3 ITA @Z 2 aut.`
A14	`03`			`@1 LORIA - INRIA Lorraine, 615, rue du Jardin Botanique, BP 101 @2 54602 Villers-les-Nancy @3 FRA @Z 3 aut.`
A14	`04`			`@1 School of Information and Communication Technology, Hanoi University of Science and Technology, 1 Dai Co Viet @2 Hanoi @3 NAM @Z 4 aut.`
A20				`@1 1026-1047`
A21				`@1 2011`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 8341 @5 354000509420520030`
A44				`@0 0000 @1 © 2011 INIST-CNRS. All rights reserved.`
A45				`@0 34 ref.`
A47	`01`	`1`		`@0 11-0330330`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Information and computation : (Print)`
A66	`01`			`@0 NLD`
C01	`01`		`ENG`	@0 Verification problems can often be encoded as first-order validity or satisfiability problems. The availability of efficient automated theorem provers is a crucial pre-requisite for automating various verification tasks as well as their cooperation with specialized decision procedures for selected theories, such as Presburger Arithmetic. In this paper, we investigate how automated provers based on a form of equational reasoning, called paramodulation, can be used in verification tools. More precisely, given a theory T axiomatizing some data structure, we devise a procedure to answer the following questions. Is the satisfiability problem of T decidable by paramodulation? Can a procedure based on paramodulation for T be efficiently combined with other specialized procedures by using the Nelson-Oppen schema? Finally, if paramodulation decides the satisfiability problem of two theories, does it decide satisfiability in their union? The procedure capable of answering all questions above is based on Schematic Saturation; an inference system capable of over-approximating the inferences of paramodulation when solving satisfiability problems in a given theory T. Clause schemas derived by Schematic Saturation describe all clauses derived by paramodulation so that the answers to the questions above are obtained by checking that only finitely many different clause schemas are derived or that certain clause schemas are not derived.
C02	`01`	`X`		`@0 001D02A08`
C02	`02`	`X`		`@0 001D02B09`
C02	`03`	`X`		`@0 001D02B07B`
C02	`04`	`X`		`@0 001A02E11`
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 Automatique @5 17`
C03	`02`	`X`	`ENG`	`@0 Automatic @5 17`
C03	`02`	`X`	`SPA`	`@0 Automático @5 17`
C03	`03`	`X`	`FRE`	`@0 Décidabilité @5 18`
C03	`03`	`X`	`ENG`	`@0 Decidability @5 18`
C03	`03`	`X`	`SPA`	`@0 Decidibilidad @5 18`
C03	`04`	`X`	`FRE`	`@0 Vérification @5 19`
C03	`04`	`X`	`ENG`	`@0 Verification @5 19`
C03	`04`	`X`	`SPA`	`@0 Verificación @5 19`
C03	`05`	`X`	`FRE`	`@0 Equation ordre 1 @5 20`
C03	`05`	`X`	`ENG`	`@0 First order equation @5 20`
C03	`05`	`X`	`SPA`	`@0 Ecuación orden 1 @5 20`
C03	`06`	`X`	`FRE`	`@0 Disponibilité @5 21`
C03	`06`	`X`	`ENG`	`@0 Availability @5 21`
C03	`06`	`X`	`SPA`	`@0 Disponibilidad @5 21`
C03	`07`	`X`	`FRE`	`@0 Coopération @5 22`
C03	`07`	`X`	`ENG`	`@0 Cooperation @5 22`
C03	`07`	`X`	`SPA`	`@0 Cooperación @5 22`
C03	`08`	`X`	`FRE`	`@0 Théorie décision @5 23`
C03	`08`	`X`	`ENG`	`@0 Decision theory @5 23`
C03	`08`	`X`	`SPA`	`@0 Teoría decisión @5 23`
C03	`09`	`X`	`FRE`	`@0 Arithmétique Presburger @5 24`
C03	`09`	`X`	`ENG`	`@0 Presburger arithmetic @5 24`
C03	`09`	`X`	`SPA`	`@0 Aritmético Presburger @5 24`
C03	`10`	`X`	`FRE`	`@0 Structure donnée @5 25`
C03	`10`	`X`	`ENG`	`@0 Data structure @5 25`
C03	`10`	`X`	`SPA`	`@0 Estructura datos @5 25`
C03	`11`	`X`	`FRE`	`@0 Problème satisfiabilité @5 26`
C03	`11`	`X`	`ENG`	`@0 Satisfiability problem @5 26`
C03	`11`	`X`	`SPA`	`@0 Problema satisfactibilidad @5 26`
C03	`12`	`X`	`FRE`	`@0 Question réponse @5 27`
C03	`12`	`X`	`ENG`	`@0 Question answering @5 27`
C03	`12`	`X`	`SPA`	`@0 Pregunta respuesta @5 27`
C03	`13`	`X`	`FRE`	`@0 Saturation @5 28`
C03	`13`	`X`	`ENG`	`@0 Saturation @5 28`
C03	`13`	`X`	`SPA`	`@0 Saturación @5 28`
C03	`14`	`X`	`FRE`	`@0 Résolution problème @5 29`
C03	`14`	`X`	`ENG`	`@0 Problem solving @5 29`
C03	`14`	`X`	`SPA`	`@0 Resolución problema @5 29`
C03	`15`	`X`	`FRE`	`@0 68Q60 @4 INC @5 70`
C03	`16`	`X`	`FRE`	`@0 Satisfiabilité @4 INC @5 71`
C03	`17`	`X`	`FRE`	`@0 Procédure décision @4 INC @5 72`
C03	`18`	`X`	`FRE`	`@0 Raisonnement équationnel @4 INC @5 73`
C03	`19`	`X`	`FRE`	`@0 68P05 @4 INC @5 74`
C03	`20`	`X`	`FRE`	`@0 Satisfiability problem @4 INC @5 75`
C03	`21`	`X`	`FRE`	`@0 41A40 @4 INC @5 76`
C03	`22`	`X`	`FRE`	`@0 68T20 @4 INC @5 77`
N21				`@1 227`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

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

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

Links to Exploration step

Pascal:11-0330330

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Automatic decidability and combinability</title>
<author><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Mathematics and Computer Science, P.O. Box 5815 Clarkson University</s1>
<s2>Potsdam, NY 13699-5815</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>États-Unis</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="02"><s1>FBK-Irst, Via Sommarive 18</s1>
<s2>38100 Povo, Trento</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Italie</country>
</affiliation>
</author>
<author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>LORIA - INRIA Lorraine, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-les-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Tran, Duc Khanh" sort="Tran, Duc Khanh" uniqKey="Tran D" first="Duc-Khanh" last="Tran">Duc-Khanh Tran</name>
<affiliation wicri:level="1"><inist:fA14 i1="04"><s1>School of Information and Communication Technology, Hanoi University of Science and Technology, 1 Dai Co Viet</s1>
<s2>Hanoi</s2>
<s3>NAM</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Namibie</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">11-0330330</idno>
<date when="2011">2011</date>
<idno type="stanalyst">PASCAL 11-0330330 INIST</idno>
<idno type="RBID">Pascal:11-0330330</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000142</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000871</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Automatic decidability and combinability</title>
<author><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Mathematics and Computer Science, P.O. Box 5815 Clarkson University</s1>
<s2>Potsdam, NY 13699-5815</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>États-Unis</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="02"><s1>FBK-Irst, Via Sommarive 18</s1>
<s2>38100 Povo, Trento</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Italie</country>
</affiliation>
</author>
<author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>LORIA - INRIA Lorraine, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-les-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Tran, Duc Khanh" sort="Tran, Duc Khanh" uniqKey="Tran D" first="Duc-Khanh" last="Tran">Duc-Khanh Tran</name>
<affiliation wicri:level="1"><inist:fA14 i1="04"><s1>School of Information and Communication Technology, Hanoi University of Science and Technology, 1 Dai Co Viet</s1>
<s2>Hanoi</s2>
<s3>NAM</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Namibie</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="2011">2011</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>Automatic</term>
<term>Availability</term>
<term>Computer theory</term>
<term>Cooperation</term>
<term>Data structure</term>
<term>Decidability</term>
<term>Decision theory</term>
<term>First order equation</term>
<term>Presburger arithmetic</term>
<term>Problem solving</term>
<term>Question answering</term>
<term>Satisfiability problem</term>
<term>Saturation</term>
<term>Verification</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Automatique</term>
<term>Décidabilité</term>
<term>Vérification</term>
<term>Equation ordre 1</term>
<term>Disponibilité</term>
<term>Coopération</term>
<term>Théorie décision</term>
<term>Arithmétique Presburger</term>
<term>Structure donnée</term>
<term>Problème satisfiabilité</term>
<term>Question réponse</term>
<term>Saturation</term>
<term>Résolution problème</term>
<term>68Q60</term>
<term>Satisfiabilité</term>
<term>Procédure décision</term>
<term>Raisonnement équationnel</term>
<term>68P05</term>
<term>Satisfiability problem</term>
<term>41A40</term>
<term>68T20</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Verification problems can often be encoded as first-order validity or satisfiability problems. The availability of efficient automated theorem provers is a crucial pre-requisite for automating various verification tasks as well as their cooperation with specialized decision procedures for selected theories, such as Presburger Arithmetic. In this paper, we investigate how automated provers based on a form of equational reasoning, called paramodulation, can be used in verification tools. More precisely, given a theory T axiomatizing some data structure, we devise a procedure to answer the following questions. Is the satisfiability problem of T decidable by paramodulation? Can a procedure based on paramodulation for T be efficiently combined with other specialized procedures by using the Nelson-Oppen schema? Finally, if paramodulation decides the satisfiability problem of two theories, does it decide satisfiability in their union? The procedure capable of answering all questions above is based on Schematic Saturation; an inference system capable of over-approximating the inferences of paramodulation when solving satisfiability problems in a given theory T. Clause schemas derived by Schematic Saturation describe all clauses derived by paramodulation so that the answers to the questions above are obtained by checking that only finitely many different clause schemas are derived or that certain clause schemas are not derived.</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>209</s2>
</fA05>
<fA06><s2>7</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Automatic decidability and combinability</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>LYNCH (Christopher)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>RANISE (Silvio)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>RINGEISSEN (Christophe)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>TRAN (Duc-Khanh)</s1>
</fA11>
<fA14 i1="01"><s1>Department of Mathematics and Computer Science, P.O. Box 5815 Clarkson University</s1>
<s2>Potsdam, NY 13699-5815</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>FBK-Irst, Via Sommarive 18</s1>
<s2>38100 Povo, Trento</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>LORIA - INRIA Lorraine, 615, rue du Jardin Botanique, BP 101</s1>
<s2>54602 Villers-les-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="04"><s1>School of Information and Communication Technology, Hanoi University of Science and Technology, 1 Dai Co Viet</s1>
<s2>Hanoi</s2>
<s3>NAM</s3>
<sZ>4 aut.</sZ>
</fA14>
<fA20><s1>1026-1047</s1>
</fA20>
<fA21><s1>2011</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>8341</s2>
<s5>354000509420520030</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2011 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>34 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>11-0330330</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>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Verification problems can often be encoded as first-order validity or satisfiability problems. The availability of efficient automated theorem provers is a crucial pre-requisite for automating various verification tasks as well as their cooperation with specialized decision procedures for selected theories, such as Presburger Arithmetic. In this paper, we investigate how automated provers based on a form of equational reasoning, called paramodulation, can be used in verification tools. More precisely, given a theory T axiomatizing some data structure, we devise a procedure to answer the following questions. Is the satisfiability problem of T decidable by paramodulation? Can a procedure based on paramodulation for T be efficiently combined with other specialized procedures by using the Nelson-Oppen schema? Finally, if paramodulation decides the satisfiability problem of two theories, does it decide satisfiability in their union? The procedure capable of answering all questions above is based on Schematic Saturation; an inference system capable of over-approximating the inferences of paramodulation when solving satisfiability problems in a given theory T. Clause schemas derived by Schematic Saturation describe all clauses derived by paramodulation so that the answers to the questions above are obtained by checking that only finitely many different clause schemas are derived or that certain clause schemas are not derived.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A08</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02B09</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001D02B07B</s0>
</fC02>
<fC02 i1="04" i2="X"><s0>001A02E11</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>Automatique</s0>
<s5>17</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Automatic</s0>
<s5>17</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Automático</s0>
<s5>17</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Décidabilité</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Decidability</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Decidibilidad</s0>
<s5>18</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Vérification</s0>
<s5>19</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Verification</s0>
<s5>19</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Verificación</s0>
<s5>19</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Equation ordre 1</s0>
<s5>20</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>First order equation</s0>
<s5>20</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Ecuación orden 1</s0>
<s5>20</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Disponibilité</s0>
<s5>21</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Availability</s0>
<s5>21</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Disponibilidad</s0>
<s5>21</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Coopération</s0>
<s5>22</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Cooperation</s0>
<s5>22</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Cooperación</s0>
<s5>22</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Théorie décision</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Decision theory</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Teoría decisión</s0>
<s5>23</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Arithmétique Presburger</s0>
<s5>24</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Presburger arithmetic</s0>
<s5>24</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Aritmético Presburger</s0>
<s5>24</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Structure donnée</s0>
<s5>25</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Data structure</s0>
<s5>25</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Estructura datos</s0>
<s5>25</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Problème satisfiabilité</s0>
<s5>26</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Satisfiability problem</s0>
<s5>26</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Problema satisfactibilidad</s0>
<s5>26</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Question réponse</s0>
<s5>27</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Question answering</s0>
<s5>27</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA"><s0>Pregunta respuesta</s0>
<s5>27</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Saturation</s0>
<s5>28</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Saturation</s0>
<s5>28</s5>
</fC03>
<fC03 i1="13" i2="X" l="SPA"><s0>Saturación</s0>
<s5>28</s5>
</fC03>
<fC03 i1="14" i2="X" l="FRE"><s0>Résolution problème</s0>
<s5>29</s5>
</fC03>
<fC03 i1="14" i2="X" l="ENG"><s0>Problem solving</s0>
<s5>29</s5>
</fC03>
<fC03 i1="14" i2="X" l="SPA"><s0>Resolución problema</s0>
<s5>29</s5>
</fC03>
<fC03 i1="15" i2="X" l="FRE"><s0>68Q60</s0>
<s4>INC</s4>
<s5>70</s5>
</fC03>
<fC03 i1="16" i2="X" l="FRE"><s0>Satisfiabilité</s0>
<s4>INC</s4>
<s5>71</s5>
</fC03>
<fC03 i1="17" i2="X" l="FRE"><s0>Procédure décision</s0>
<s4>INC</s4>
<s5>72</s5>
</fC03>
<fC03 i1="18" i2="X" l="FRE"><s0>Raisonnement équationnel</s0>
<s4>INC</s4>
<s5>73</s5>
</fC03>
<fC03 i1="19" i2="X" l="FRE"><s0>68P05</s0>
<s4>INC</s4>
<s5>74</s5>
</fC03>
<fC03 i1="20" i2="X" l="FRE"><s0>Satisfiability problem</s0>
<s4>INC</s4>
<s5>75</s5>
</fC03>
<fC03 i1="21" i2="X" l="FRE"><s0>41A40</s0>
<s4>INC</s4>
<s5>76</s5>
</fC03>
<fC03 i1="22" i2="X" l="FRE"><s0>68T20</s0>
<s4>INC</s4>
<s5>77</s5>
</fC03>
<fN21><s1>227</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</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 000871 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000871 | 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:11-0330330
   |texte=   Automatic decidability and combinability
}}

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

Automatic decidability and combinability

Automatic decidability and combinability

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