<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>http://www.sc-square.org/CSA/workshop5.html</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>A liated with the</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>) Virtual (originally Paris</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>France)</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <fpage>29</fpage>
      <lpage>30</lpage>
      <kwd-group>
        <kwd>Fifth Workshop on</kwd>
        <kwd>Symbolic Computation and Satis</kwd>
        <kwd>ability Checking</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>http://www.eprover.org/EVENTS/PAAR-2020.html
This volume contains the papers presented at the Seventh Workshop on Practical Aspects of Automated
Reasoning (PAAR-2020) and at the Fifth Workshop on Satis ability Checking and Symbolic Computation (SC2-2020).
The workshops were held respectively on June 29{30, 2020, and on July 5, 2020, virtually, in association with
the Tenth International Joint Conference on Automated Reasoning (IJCAR-2020).</p>
      <p>PAAR provides a forum for developers of automated reasoning tools to discuss and compare di erent
implementation techniques, and for users to discuss and communicate their applications and requirements. The
workshop brings together di erent groups to concentrate on practical aspects of the implementation and
application of automated reasoning tools. It allows researchers to present work in progress, and to discuss current
trends, new implementation techniques and new applications. The purpose of PAAR is to help the community
understand how to build useful and powerful reasoning systems in practice, and how to apply existing systems
to real problems.</p>
      <p>PAAR received nineteen submissions. Each submission was reviewed by at least three program committee
members. Sixteen papers were accepted for presentation, and the workshop was extended from one day to two
days to accommodate for the unexpectedly high number of presentations. Thirteen papers were invited for the
proceedings; in the end, twelve papers could be included in the proceedings.</p>
      <p>The aim of the SC2 workshop is to provide an opportunity to discuss, share knowledge and experience across
two communities: symbolic computation and satis ability checking. Symbolic computation is concerned with
the e cient algorithmic determination of exact solutions to complicated mathematical problems. Satis
ability Checking has recently started to tackle similar problems but with di erent algorithmic and technological
solutions.</p>
      <p>SC2 received three papers, each of which received three reviews by the members of the programme committee.
We attribute low submission rate to disruptions caused by COVID-19. Nevertheless, all submitted papers were
of high quality and were accepted for presentation at the workshop and publication in this volume.</p>
      <p>The PAAR and SC2 workshop organizers would like to thank the authors and participants of both workshops
for making two very successful events possible, particularly in these special COVID-19 times. Our thanks also go
to the program committee members and the external reviewers for their considerable e ort to provide thorough
and constructive reviews. As in all years, we are indebted to the EasyChair team for the unfailing availability of
the EasyChair Conference System. We are grateful to the CEUR team for publishing our proceedings. The SC2
workshop organizers would like to thank the SMT-2020 workshop for accommodating a joint SC2/SMT session.</p>
      <p>Last but not least, the IJCAR organizers were extremely helpful in nding good solutions to still have the
workshops in spite of the 2020 sanitary crisis. The PAAR and SC2 workshop chairs are very grateful to them
for their support and for virtually hosting the workshops.</p>
      <p>November 2020</p>
      <p>Konstantin Korovin and Ilias S. Kotsireas (SC2 Chairs)
Pascal Fontaine, Philipp Rummer, Sophie Tourret (PAAR Chairs)</p>
      <p>III</p>
    </sec>
    <sec id="sec-2">
      <title>Workshop on Practical Aspects of Automated Reasoning 2020</title>
      <p>Learning Precedences from Simple Symbol Features : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 21</p>
      <p>Filip Bartek and Martin Suda
Give Reasoning a Trie : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 93</p>
      <p>Thomas Prokosch and Francois Bry</p>
    </sec>
    <sec id="sec-3">
      <title>Satis ability Checking and Symbolic Computation Workshop 2020</title>
      <p>Computing Tropical Prevarieties With Satis ability Modulo Theories (SMT) Solvers : : : : : : : : : : : : 189</p>
      <p>Christoph Luders
GeoGebra and the realgeom Reasoning Tool : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 204
Robert Vajda and Zoltan Kovacs</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Animated</given-names>
            <surname>Logic</surname>
          </string-name>
          : Correct Functional Conversion to Conjunctive Normal Form : : : : : : : : : : : : : : : : 1
          <string-name>
            <given-names>Pedro</given-names>
            <surname>Barroso</surname>
          </string-name>
          , Mario Pereira and Antonio Ravara
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <article-title>Layered Clause Selection for Saturation-Based Theorem Proving</article-title>
          : : : : : : : : : : : : : : : : : : : : : : : 34
          <string-name>
            <given-names>Bernhard</given-names>
            <surname>Gleiss</surname>
          </string-name>
          and Martin Suda
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Simplifying</given-names>
            <surname>Casts</surname>
          </string-name>
          and
          <string-name>
            <surname>Coercions (Extended Abstract</surname>
            ) : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 53 Robert
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Lewis</surname>
          </string-name>
          and Paul-Nicolas Madelaine
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Evaluation</surname>
            of Axiom Selection Techniques : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 63
            <given-names>Qinghua</given-names>
          </string-name>
          <string-name>
            <surname>Liu</surname>
            , Zishi Wu,
            <given-names>Zihao</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
          </string-name>
          and Geo Sutcli e
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>Equality Preprocessing in Connection Calculi : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 76 Benjamin E. Oliver and Jens Otten</mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <article-title>Directed Graph Networks for Logical Reasoning</article-title>
          (Extended Abstract) : : : : : : : : : : : : : : : : : : : : 109
          <string-name>
            <given-names>Michael</given-names>
            <surname>Rawson</surname>
          </string-name>
          and Giles Reger
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>E cient Implementation of</surname>
            Large-Scale Watchlists : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 120
            <given-names>Constantin</given-names>
          </string-name>
          <string-name>
            <surname>Ruhdorfer</surname>
          </string-name>
          and Stephan Schulz
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <article-title>Cutting Down the TPTP Language (</article-title>
          And Others) : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 134
          <string-name>
            <given-names>Nahku</given-names>
            <surname>Saidy</surname>
          </string-name>
          , Hanna Siegfried, Stephan Schulz and Geo Sutcli e
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <article-title>Boolean Reasoning in a Higher-Order Superposition Prover :</article-title>
          : : : : : : : : : : : : : : : : : : : : : : : : : 148
          <string-name>
            <given-names>Petar</given-names>
            <surname>Vukmirovic</surname>
          </string-name>
          and Visa Nummelin
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <article-title>Querying the Guarded Fragment via Resolution (Extended Abstract</article-title>
          ) : : : : : : : : : : : : : : : : : : : : 167
          <string-name>
            <given-names>Sen</given-names>
            <surname>Zheng</surname>
          </string-name>
          and
          <article-title>Renate A</article-title>
          . Schmidt
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>