Serveur d'exploration sur l'opéra

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.

Proving formulas through reduction to decidable classes

Identifieur interne : 002F58 ( Main/Curation ); précédent : 002F57; suivant : 002F59

Proving formulas through reduction to decidable classes

Auteurs : Mauro Di Manzo [Italie] ; Enrico Giunchiglia [Italie] ; Alessandro Armando [Italie] ; Paolo Pecchiari [Italie]

Source :

RBID : ISTEX:581F1F9EB2479D034B487DC561FC0308505190FC

Abstract

Abstract: As it is well known, it is important to enrich the basic deductive machinery of an interactive theorem prover with complex decision procedures. In the GETFOL system we have implemented a hierarchical and modular structure of procedures which can be either invoked individually or jointly with the others. At the top of the hierarchy there is a decision procedure for a set of formulas which can be reduced to the class of prenex universal-existential formulas via finitely many application of rewriting rules. In this paper we give a formal account of such a reduction process, arguing that (i) it greatly enlarges the set of formulas which can proven through a decision process and (ii) in some cases makes the resulting formula easier to prove. We also provide an extensional characterization of a class of formulas which can be reduced and thus decided. The implementation of such reducing procedure in GETFOL is also sketched.

Url:
DOI: 10.1007/3-540-57292-9_36

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


Links to Exploration step

ISTEX:581F1F9EB2479D034B487DC561FC0308505190FC

Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Proving formulas through reduction to decidable classes</title>
<author>
<name sortKey="Di Manzo, Mauro" sort="Di Manzo, Mauro" uniqKey="Di Manzo M" first="Mauro" last="Di Manzo">Mauro Di Manzo</name>
</author>
<author>
<name sortKey="Giunchiglia, Enrico" sort="Giunchiglia, Enrico" uniqKey="Giunchiglia E" first="Enrico" last="Giunchiglia">Enrico Giunchiglia</name>
</author>
<author>
<name sortKey="Armando, Alessandro" sort="Armando, Alessandro" uniqKey="Armando A" first="Alessandro" last="Armando">Alessandro Armando</name>
</author>
<author>
<name sortKey="Pecchiari, Paolo" sort="Pecchiari, Paolo" uniqKey="Pecchiari P" first="Paolo" last="Pecchiari">Paolo Pecchiari</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:581F1F9EB2479D034B487DC561FC0308505190FC</idno>
<date when="1993" year="1993">1993</date>
<idno type="doi">10.1007/3-540-57292-9_36</idno>
<idno type="url">https://api.istex.fr/document/581F1F9EB2479D034B487DC561FC0308505190FC/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001A66</idno>
<idno type="wicri:Area/Istex/Curation">001A66</idno>
<idno type="wicri:Area/Istex/Checkpoint">001067</idno>
<idno type="wicri:doubleKey">0302-9743:1993:Di Manzo M:proving:formulas:through</idno>
<idno type="wicri:Area/Main/Merge">003095</idno>
<idno type="wicri:Area/Main/Curation">002F58</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">Proving formulas through reduction to decidable classes</title>
<author>
<name sortKey="Di Manzo, Mauro" sort="Di Manzo, Mauro" uniqKey="Di Manzo M" first="Mauro" last="Di Manzo">Mauro Di Manzo</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Italie</country>
<wicri:regionArea>Mechanized Reasoning Group, DIST - University of Genoa, Via Opera Pia 11A, 16145, Genoa</wicri:regionArea>
<wicri:noRegion>Genoa</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Italie</country>
</affiliation>
</author>
<author>
<name sortKey="Giunchiglia, Enrico" sort="Giunchiglia, Enrico" uniqKey="Giunchiglia E" first="Enrico" last="Giunchiglia">Enrico Giunchiglia</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Italie</country>
<wicri:regionArea>Mechanized Reasoning Group, DIST - University of Genoa, Via Opera Pia 11A, 16145, Genoa</wicri:regionArea>
<wicri:noRegion>Genoa</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Italie</country>
</affiliation>
</author>
<author>
<name sortKey="Armando, Alessandro" sort="Armando, Alessandro" uniqKey="Armando A" first="Alessandro" last="Armando">Alessandro Armando</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Italie</country>
<wicri:regionArea>Mechanized Reasoning Group, DIST - University of Genoa, Via Opera Pia 11A, 16145, Genoa</wicri:regionArea>
<wicri:noRegion>Genoa</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Italie</country>
</affiliation>
</author>
<author>
<name sortKey="Pecchiari, Paolo" sort="Pecchiari, Paolo" uniqKey="Pecchiari P" first="Paolo" last="Pecchiari">Paolo Pecchiari</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Italie</country>
<wicri:regionArea>Mechanized Reasoning Group, DIST - University of Genoa, Via Opera Pia 11A, 16145, Genoa</wicri:regionArea>
<wicri:noRegion>Genoa</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Italie</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="s">Lecture Notes in Computer Science</title>
<title level="s" type="sub">Lecture Notes in Artificial Intelligence</title>
<imprint>
<date>1993</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">581F1F9EB2479D034B487DC561FC0308505190FC</idno>
<idno type="DOI">10.1007/3-540-57292-9_36</idno>
<idno type="ChapterID">Chap1</idno>
<idno type="ChapterID">1</idno>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass></textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Abstract: As it is well known, it is important to enrich the basic deductive machinery of an interactive theorem prover with complex decision procedures. In the GETFOL system we have implemented a hierarchical and modular structure of procedures which can be either invoked individually or jointly with the others. At the top of the hierarchy there is a decision procedure for a set of formulas which can be reduced to the class of prenex universal-existential formulas via finitely many application of rewriting rules. In this paper we give a formal account of such a reduction process, arguing that (i) it greatly enlarges the set of formulas which can proven through a decision process and (ii) in some cases makes the resulting formula easier to prove. We also provide an extensional characterization of a class of formulas which can be reduced and thus decided. The implementation of such reducing procedure in GETFOL is also sketched.</div>
</front>
</TEI>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/OperaV1/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002F58 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 002F58 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Musique
   |area=    OperaV1
   |flux=    Main
   |étape=   Curation
   |type=    RBID
   |clé=     ISTEX:581F1F9EB2479D034B487DC561FC0308505190FC
   |texte=   Proving formulas through reduction to decidable classes
}}

Wicri

This area was generated with Dilib version V0.6.21.
Data generation: Thu Apr 14 14:59:05 2016. Site generation: Thu Oct 8 06:48:41 2020