<!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>
      <journal-title-group>
        <journal-title>Janiˇci´c P., Narboux J., Quaresma P., The area method, Journal of Auto-
mated Reasoning</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Marek Janasz UP Cracow Thesis: Automated theorem proving for elementary geometry. This study analyses automated proofs of theorems from Euclidean Ele- ments, book VI, using the area method. The theorems we will be discussing concern Euclidean field theory about equality of non-congruent figures and similarity of the figures [1]. The proofs are generated by the program WinGCLC. My proposed hypothesizes:</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>3. Chou S. C.</institution>
          ,
          <addr-line>Gao X. S., Zhang J. Z., Machine Proofs in Geometry, World Scientific</addr-line>
          ,
          <country country="SG">Singapore</country>
          <addr-line>1994</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2012</year>
      </pub-date>
      <volume>48</volume>
      <issue>4</issue>
      <abstract>
        <p>1. The way of modification of the elimination lemmas while adding the elementary constructions to extending the abilities of the area method in proving theorems from Euclidean Elements, book VI. 2. The method of extension of the axiomatic system from [5] to proving theorem for ordered geometry. I would like to use my results to implement the prover to the programming languages in logic (Prolog, Haskell) or to the applications like Coq. My dissertation plans contain the analysis of the automated proofs of segment's field from Cartesian arithmetic using the area method by the program WinGCLC. My study is concerned with proving equality of line segments using various methods of constructions corresponding with multiplication of line segments (uniqueness) and commutative property of multiplication of line segments.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Bibliography:</p>
    </sec>
  </body>
  <back>
    <ref-list />
  </back>
</article>