Beagle – A Hierarchic Superposition Prover
Identifieur interne : 001208 ( Hal/Corpus ); précédent : 001207; suivant : 001209Beagle – A Hierarchic Superposition Prover
Auteurs : Peter Baumgartner ; Joshua Bax ; Uwe WaldmannSource :
Abstract
Beagle is an automated theorem prover for first-order logic modulo built-in theories. It implements a refined version of the hierarchic superposition calculus. This system description focuses on Beagle ’s proof procedure, background reasoning facilities, implementation, and experimental results.
Url:
DOI: 10.1007/978-3-319-21401-6_25
Links to Exploration step
Hal:hal-01251377Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Beagle – A Hierarchic Superposition Prover</title>
<author><name sortKey="Baumgartner, Peter" sort="Baumgartner, Peter" uniqKey="Baumgartner P" first="Peter" last="Baumgartner">Peter Baumgartner</name>
<affiliation><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>
</affiliation>
</author>
<author><name sortKey="Bax, Joshua" sort="Bax, Joshua" uniqKey="Bax J" first="Joshua" last="Bax">Joshua Bax</name>
<affiliation><hal:affiliation type="institution" xml:id="struct-74662" status="VALID"><orgName>Australian National University</orgName>
<orgName type="acronym">ANU</orgName>
<desc><address><addrLine>The Australian National University Canberra ACT 0200 Australia</addrLine>
<country key="AU"></country>
</address>
<ref type="url">http://www.anu.edu.au/index.php</ref>
</desc>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Waldmann, Uwe" sort="Waldmann, Uwe" uniqKey="Waldmann U" first="Uwe" last="Waldmann">Uwe Waldmann</name>
<affiliation><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>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-01251377</idno>
<idno type="halId">hal-01251377</idno>
<idno type="halUri">https://hal.inria.fr/hal-01251377</idno>
<idno type="url">https://hal.inria.fr/hal-01251377</idno>
<idno type="doi">10.1007/978-3-319-21401-6_25</idno>
<date when="2015-08">2015-08</date>
<idno type="wicri:Area/Hal/Corpus">001208</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Beagle – A Hierarchic Superposition Prover</title>
<author><name sortKey="Baumgartner, Peter" sort="Baumgartner, Peter" uniqKey="Baumgartner P" first="Peter" last="Baumgartner">Peter Baumgartner</name>
<affiliation><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>
</affiliation>
</author>
<author><name sortKey="Bax, Joshua" sort="Bax, Joshua" uniqKey="Bax J" first="Joshua" last="Bax">Joshua Bax</name>
<affiliation><hal:affiliation type="institution" xml:id="struct-74662" status="VALID"><orgName>Australian National University</orgName>
<orgName type="acronym">ANU</orgName>
<desc><address><addrLine>The Australian National University Canberra ACT 0200 Australia</addrLine>
<country key="AU"></country>
</address>
<ref type="url">http://www.anu.edu.au/index.php</ref>
</desc>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Waldmann, Uwe" sort="Waldmann, Uwe" uniqKey="Waldmann U" first="Uwe" last="Waldmann">Uwe Waldmann</name>
<affiliation><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>
</affiliation>
</author>
</analytic>
<idno type="DOI">10.1007/978-3-319-21401-6_25</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Beagle is an automated theorem prover for first-order logic modulo built-in theories. It implements a refined version of the hierarchic superposition calculus. This system description focuses on Beagle ’s proof procedure, background reasoning facilities, implementation, and experimental results.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Beagle – A Hierarchic Superposition Prover</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">Joshua</forename>
<surname>Bax</surname>
</persName>
<email></email>
<idno type="halauthor">1101482</idno>
<affiliation ref="#struct-74662"></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">2016-01-06 10:12:33</date>
<date type="whenModified">2016-01-21 13:07:32</date>
<date type="whenReleased">2016-01-06 10:12:33</date>
<date type="whenProduced">2015-08</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-01251377</idno>
<idno type="halUri">https://hal.inria.fr/hal-01251377</idno>
<idno type="halBibtex">baumgartner:hal-01251377</idno>
<idno type="halRefHtml">Amy P. Felty and Aart Middeldorp. 25th International Conference on Automated Deduction (CADE-25), Aug 2015, Berlin, Germany. Springer, 9195, pp.367-377, 2015, Lecture Notes in Computer Science. <10.1007/978-3-319-21401-6_25></idno>
<idno type="halRef">Amy P. Felty and Aart Middeldorp. 25th International Conference on Automated Deduction (CADE-25), Aug 2015, Berlin, Germany. Springer, 9195, pp.367-377, 2015, Lecture Notes in Computer Science. <10.1007/978-3-319-21401-6_25></idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</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>
<idno type="stamp" n="INRIA2">INRIA 2</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">Beagle – A Hierarchic Superposition Prover</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">Joshua</forename>
<surname>Bax</surname>
</persName>
<idno type="halAuthorId">1101482</idno>
<affiliation ref="#struct-74662"></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>25th International Conference on Automated Deduction (CADE-25)</title>
<date type="start">2015-08</date>
<settlement>Berlin</settlement>
<country key="DE">Germany</country>
</meeting>
<editor>Amy P. Felty and Aart Middeldorp</editor>
<imprint><publisher>Springer</publisher>
<biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
<biblScope unit="volume">9195</biblScope>
<biblScope unit="pp">367-377</biblScope>
<date type="datePub">2015-08</date>
</imprint>
</monogr>
<idno type="doi">10.1007/978-3-319-21401-6_25</idno>
</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">Beagle is an automated theorem prover for first-order logic modulo built-in theories. It implements a refined version of the hierarchic superposition calculus. This system description focuses on Beagle ’s proof procedure, background reasoning facilities, implementation, and experimental results.</abstract>
</profileDesc>
</hal>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001208 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 001208 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Hal |étape= Corpus |type= RBID |clé= Hal:hal-01251377 |texte= Beagle – A Hierarchic Superposition Prover }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |