<!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>Locality Properties of Extensions of First-Order Logic and their Use in Algorithms (Abstract of Invited Talk)?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Nicole Schweikardt</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Humboldt University of Berlin</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>This talk will give an overview of first-order logic with counting FOC and the
weight aggregation logic FOWA. I will provide examples demonstrating the
expressiveness of these logics, as well as an overview of locality properties of these
logics. The latter allow for efficient model checking algorithms and algorithms
for learning concepts describable in these logics.
? Copyright © 2021 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).</p>
    </sec>
  </body>
  <back>
    <ref-list />
  </back>
</article>