The Logic of Counting Query Answers
Logic in Computer Science
2017-04-21 v3 Computational Complexity
Abstract
We consider the problem of counting the number of answers to a first-order formula on a finite structure. We present and study an extension of first-order logic in which algorithms for this counting problem can be naturally and conveniently expressed, in senses that are made precise and that are motivated by the wish to understand tractable cases of the counting problem.
Keywords
Cite
@article{arxiv.1501.07195,
title = {The Logic of Counting Query Answers},
author = {Hubie Chen and Stefan Mengel},
journal= {arXiv preprint arXiv:1501.07195},
year = {2017}
}