Automatic Combinability of Rewriting-Based Satisfiability Procedures
Identifieur interne : 005674 ( Main/Merge ); précédent : 005673; suivant : 005675Automatic Combinability of Rewriting-Based Satisfiability Procedures
Auteurs : Hélène Kirchner ; Silvio Ranise ; Christophe Ringeissen ; Duc-Khanh TranSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We address the problems of combining satisfiability procedures and consider two combination scenarios: (i) the combination within the class of rewriting-based satisfiability procedures and (ii) the Nelson-Oppen combination of rewriting-based satisfiability procedures and arbitrary satisfiability procedures. In each scenario, we use meta-saturation, which schematizes saturation of the set containing the axioms of a given theory and an arbitrary set of ground literals, to syntactically decide sufficient conditions for the combinability of rewriting-based satisfiability procedures. For (i), we give a sufficient condition for the modular termination of meta-saturation. When meta-saturation for the union of theories halts, it yields a rewriting-based satisfiability procedure for the union. For (ii), we use meta-saturation to prove the stable infiniteness of the component theories and deduction completeness of their rewriting-based satisfiability procedures. These properties are important to establish the correctness of the Nelson-Oppen combination method and to obtain an efficient implementation.
Url:
DOI: 10.1007/11916277_37
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001361
- to stream Istex, to step Curation: 001344
- to stream Istex, to step Checkpoint: 001381
Links to Exploration step
ISTEX:53CE0469381CC228FC42425B7B6186E6227A7A4BLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Automatic Combinability of Rewriting-Based Satisfiability Procedures</title><author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name></author><author><name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name></author><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name></author><author><name sortKey="Tran, Duc Khanh" sort="Tran, Duc Khanh" uniqKey="Tran D" first="Duc-Khanh" last="Tran">Duc-Khanh Tran</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:53CE0469381CC228FC42425B7B6186E6227A7A4B</idno><date when="2006" year="2006">2006</date><idno type="doi">10.1007/11916277_37</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-CLCJP2ZW-M/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001361</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001361</idno><idno type="wicri:Area/Istex/Curation">001344</idno><idno type="wicri:Area/Istex/Checkpoint">001381</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001381</idno><idno type="wicri:doubleKey">0302-9743:2006:Kirchner H:automatic:combinability:of</idno><idno type="wicri:Area/Main/Merge">005674</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Automatic Combinability of Rewriting-Based Satisfiability Procedures</title><author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name><affiliation><wicri:noCountry code="subField"> </wicri:noCountry></affiliation></author><author><name sortKey="Ranise, Silvio" sort="Ranise, Silvio" uniqKey="Ranise S" first="Silvio" last="Ranise">Silvio Ranise</name><affiliation></affiliation><affiliation><wicri:noCountry code="subField"> </wicri:noCountry></affiliation></author><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name><affiliation><wicri:noCountry code="subField"> </wicri:noCountry></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:noCountry code="subField"> </wicri:noCountry></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We address the problems of combining satisfiability procedures and consider two combination scenarios: (i) the combination within the class of rewriting-based satisfiability procedures and (ii) the Nelson-Oppen combination of rewriting-based satisfiability procedures and arbitrary satisfiability procedures. In each scenario, we use meta-saturation, which schematizes saturation of the set containing the axioms of a given theory and an arbitrary set of ground literals, to syntactically decide sufficient conditions for the combinability of rewriting-based satisfiability procedures. For (i), we give a sufficient condition for the modular termination of meta-saturation. When meta-saturation for the union of theories halts, it yields a rewriting-based satisfiability procedure for the union. For (ii), we use meta-saturation to prove the stable infiniteness of the component theories and deduction completeness of their rewriting-based satisfiability procedures. These properties are important to establish the correctness of the Nelson-Oppen combination method and to obtain an efficient implementation.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005674 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 005674 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:53CE0469381CC228FC42425B7B6186E6227A7A4B
|texte= Automatic Combinability of Rewriting-Based Satisfiability Procedures
}}
| This area was generated with Dilib version V0.6.33. |  |