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.
Back to Program