InforLorV4, Hal, Checkpoint, bibRecord, 000D96

Hierarchic Superposition: Completeness without Compactness

Identifieur interne : 000D96 ( Hal/Checkpoint ); précédent : 000D95; suivant : 000D97

Hierarchic Superposition: Completeness without Compactness

Auteurs : Peter Baumgartner [Australie] ; Uwe Waldmann [Allemagne]

Source :

RBID : Hal:hal-01087872

Abstract

Many applications of automated deduction and verification require reasoning in combinations of theories, such as, on the one hand (some fragment of) first-order logic, and on, the other hand a background theory, such as some form of arithmetic. Unfortunately, due to the high expressivity of the full logic, complete reasoning is impossible in general. It is a realistic goal, however, to devise theorem provers that are "reasonably complete" in practice, and the hierarchic superposition calculus has been designed as a theoretical basis for that. In a recent paper we introduced an extension of hierarchic superposition and proved its completeness for the fragment where every term of the background sort is ground. In this paper, we extend this result and obtain completeness for a larger fragment that admits variables in certain places.

Url:

https://hal.inria.fr/hal-01087872

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

to stream Hal, to step Corpus: 002773
to stream Hal, to step Curation: 002773

Links to Exploration step

Hal:hal-01087872

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Hierarchic Superposition: Completeness without Compactness</title>
<author><name sortKey="Baumgartner, Peter" sort="Baumgartner, Peter" uniqKey="Baumgartner P" first="Peter" last="Baumgartner">Peter Baumgartner</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-397678" status="INCOMING"><orgName>Software Systems Research Group</orgName>
<desc><address><country key="AU"></country>
</address>
</desc>
<listRelation><relation active="#struct-227648" type="direct"></relation>
<relation active="#struct-300765" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-227648" type="direct"><org type="laboratory" xml:id="struct-227648" status="VALID"><orgName>NICTA [Eveleigh]</orgName>
<desc><address><addrLine>Australian Technology Park Level 5, 13 Garden Street Eveleigh NSW 2015</addrLine>
<country key="AU"></country>
</address>
<ref type="url">http://nicta.com.au/</ref>
</desc>
<listRelation><relation active="#struct-300765" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300765" type="indirect"><org type="institution" xml:id="struct-300765" status="VALID"><orgName>National ICT Australia - NICTA</orgName>
<desc><address><addrLine>Australian Technology Park - Level 5, 13 Garden Street - Eveleigh NSW 2015</addrLine>
<country key="AU"></country>
</address>
<ref type="url">https://www.nicta.com.au</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Australie</country>
</affiliation>
</author>
<author><name sortKey="Waldmann, Uwe" sort="Waldmann, Uwe" uniqKey="Waldmann U" first="Uwe" last="Waldmann">Uwe Waldmann</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-54489" status="VALID"><orgName>Max Planck Institut für Informatik</orgName>
<orgName type="acronym">MPII</orgName>
<desc><address><addrLine>Max Planck Institut für Informatik Campus E-1 4 66123 Saarbrücken Germany</addrLine>
<country key="DE"></country>
</address>
<ref type="url">http://www.mpi-inf.mpg.de/</ref>
</desc>
<listRelation><relation active="#struct-300044" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300044" type="direct"><org type="institution" xml:id="struct-300044" status="VALID"><orgName>Max-Planck-Institut</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Allemagne</country>
<orgName type="university">Société Max-Planck</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-01087872</idno>
<idno type="halId">hal-01087872</idno>
<idno type="halUri">https://hal.inria.fr/hal-01087872</idno>
<idno type="url">https://hal.inria.fr/hal-01087872</idno>
<date when="2013-12-11">2013-12-11</date>
<idno type="wicri:Area/Hal/Corpus">002773</idno>
<idno type="wicri:Area/Hal/Curation">002773</idno>
<idno type="wicri:Area/Hal/Checkpoint">000D96</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000D96</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Hierarchic Superposition: Completeness without Compactness</title>
<author><name sortKey="Baumgartner, Peter" sort="Baumgartner, Peter" uniqKey="Baumgartner P" first="Peter" last="Baumgartner">Peter Baumgartner</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-397678" status="INCOMING"><orgName>Software Systems Research Group</orgName>
<desc><address><country key="AU"></country>
</address>
</desc>
<listRelation><relation active="#struct-227648" type="direct"></relation>
<relation active="#struct-300765" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-227648" type="direct"><org type="laboratory" xml:id="struct-227648" status="VALID"><orgName>NICTA [Eveleigh]</orgName>
<desc><address><addrLine>Australian Technology Park Level 5, 13 Garden Street Eveleigh NSW 2015</addrLine>
<country key="AU"></country>
</address>
<ref type="url">http://nicta.com.au/</ref>
</desc>
<listRelation><relation active="#struct-300765" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300765" type="indirect"><org type="institution" xml:id="struct-300765" status="VALID"><orgName>National ICT Australia - NICTA</orgName>
<desc><address><addrLine>Australian Technology Park - Level 5, 13 Garden Street - Eveleigh NSW 2015</addrLine>
<country key="AU"></country>
</address>
<ref type="url">https://www.nicta.com.au</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Australie</country>
</affiliation>
</author>
<author><name sortKey="Waldmann, Uwe" sort="Waldmann, Uwe" uniqKey="Waldmann U" first="Uwe" last="Waldmann">Uwe Waldmann</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-54489" status="VALID"><orgName>Max Planck Institut für Informatik</orgName>
<orgName type="acronym">MPII</orgName>
<desc><address><addrLine>Max Planck Institut für Informatik Campus E-1 4 66123 Saarbrücken Germany</addrLine>
<country key="DE"></country>
</address>
<ref type="url">http://www.mpi-inf.mpg.de/</ref>
</desc>
<listRelation><relation active="#struct-300044" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300044" type="direct"><org type="institution" xml:id="struct-300044" status="VALID"><orgName>Max-Planck-Institut</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Allemagne</country>
<orgName type="university">Société Max-Planck</orgName>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Many applications of automated deduction and verification require reasoning in combinations of theories, such as, on the one hand (some fragment of) first-order logic, and on, the other hand a background theory, such as some form of arithmetic. Unfortunately, due to the high expressivity of the full logic, complete reasoning is impossible in general. It is a realistic goal, however, to devise theorem provers that are "reasonably complete" in practice, and the hierarchic superposition calculus has been designed as a theoretical basis for that. In a recent paper we introduced an extension of hierarchic superposition and proved its completeness for the fragment where every term of the background sort is ground. In this paper, we extend this result and obtain completeness for a larger fragment that admits variables in certain places.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Hierarchic Superposition: Completeness without Compactness</title>
<author role="aut"><persName><forename type="first">Peter</forename>
<surname>Baumgartner</surname>
</persName>
<email></email>
<idno type="halauthor">1101480</idno>
<affiliation ref="#struct-397678"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Uwe</forename>
<surname>Waldmann</surname>
</persName>
<email></email>
<idno type="halauthor">1101481</idno>
<affiliation ref="#struct-54489"></affiliation>
<affiliation ref="#struct-107895"></affiliation>
</author>
<editor role="depositor"><persName><forename>Stephan</forename>
<surname>Merz</surname>
</persName>
<email>Stephan.Merz@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2014-11-27 02:54:40</date>
<date type="whenModified">2015-09-21 11:13:18</date>
<date type="whenReleased">2014-11-27 02:54:40</date>
<date type="whenProduced">2013-12-11</date>
</edition>
<respStmt><resp>contributor</resp>
<name key="104076"><persName><forename>Stephan</forename>
<surname>Merz</surname>
</persName>
<email>Stephan.Merz@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-01087872</idno>
<idno type="halUri">https://hal.inria.fr/hal-01087872</idno>
<idno type="halBibtex">baumgartner:hal-01087872</idno>
<idno type="halRefHtml">Marek Kosta and Thomas Sturm. MACIS 2013 - Fifth International Conference on Mathematical Aspects of Computer and Information Sciences, Dec 2013, Nanning, China. pp.8-12, <http://resources.mpi-inf.mpg.de/conferences/macis2013/program.html></idno>
<idno type="halRef">Marek Kosta and Thomas Sturm. MACIS 2013 - Fifth International Conference on Mathematical Aspects of Computer and Information Sciences, Dec 2013, Nanning, China. pp.8-12, <http://resources.mpi-inf.mpg.de/conferences/macis2013/program.html></idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Hierarchic Superposition: Completeness without Compactness</title>
<author role="aut"><persName><forename type="first">Peter</forename>
<surname>Baumgartner</surname>
</persName>
<idno type="halAuthorId">1101480</idno>
<affiliation ref="#struct-397678"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Uwe</forename>
<surname>Waldmann</surname>
</persName>
<idno type="halAuthorId">1101481</idno>
<affiliation ref="#struct-54489"></affiliation>
<affiliation ref="#struct-107895"></affiliation>
</author>
</analytic>
<monogr><meeting><title>MACIS 2013 - Fifth International Conference on Mathematical Aspects of Computer and Information Sciences</title>
<date type="start">2013-12-11</date>
<date type="end">2013-12-13</date>
<settlement>Nanning</settlement>
<country key="CN">China</country>
</meeting>
<editor>Marek Kosta and Thomas Sturm</editor>
<imprint><biblScope unit="pp">8-12</biblScope>
</imprint>
</monogr>
<ref type="publisher">http://resources.mpi-inf.mpg.de/conferences/macis2013/program.html</ref>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">Many applications of automated deduction and verification require reasoning in combinations of theories, such as, on the one hand (some fragment of) first-order logic, and on, the other hand a background theory, such as some form of arithmetic. Unfortunately, due to the high expressivity of the full logic, complete reasoning is impossible in general. It is a realistic goal, however, to devise theorem provers that are "reasonably complete" in practice, and the hierarchic superposition calculus has been designed as a theoretical basis for that. In a recent paper we introduced an extension of hierarchic superposition and proved its completeness for the fragment where every term of the background sort is ground. In this paper, we extend this result and obtain completeness for a larger fragment that admits variables in certain places.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Checkpoint

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

HfdSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd -nk 000D96 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Hal:hal-01087872
   |texte=   Hierarchic Superposition: Completeness without Compactness
}}

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

Hierarchic Superposition: Completeness without Compactness

Hierarchic Superposition: Completeness without Compactness

Source :

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