Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
counting logic
Description:
A formal logic extended with operators that express how many elements satisfy a property, used to study structures such as graphs.
Primary topic:
Advanced Graph Theory Research (21%)
Related topics:
Advanced Graph Theory Research (21%),
Logic, Reasoning, and Knowledge (16%),
Advanced Topology and Set Theory (14%)
OpenAlex ID:
keywords/counting-logic
Bounded Variable Logics and Counting
1997
·
Martin Otto
·
Lecture notes in logic
·
193
Sherali--Adams Relaxations and Indistinguishability in Counting Logics
2013
·
Albert Atserias
, Elitza Maneva
·
SIAM Journal on Computing
·
128
Affine systems of equations and counting infinitary logic
2009
·
Albert Atserias
, Andrei Bulatov
, et al.
·
Theoretical Computer Science
·
113
Fixed-point logics on planar graphs
2002
·
M. Grohe
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
86
Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits
2022
·
Simon Ståhlberg
, Blai Bonet
, et al.
·
Proceedings of the International Conference on Automated Planning and Scheduling
·
83
PDF
Logics with aggregate operators
2001
·
Lauri Hella
, Leonid Libkin
, et al.
·
Journal of the ACM
·
83
Inductive definability with counting on finite structures
1993
·
Erich Grädel
, Martin Otto
·
Lecture notes in computer science
·
74
First-order logic with counting
2017
·
Dietrich Kuske
, Nicole Schweikardt
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
53
Counting LTL
2010
·
Francois Laroussinie
, Antoine Meyer
, et al.
·
International Symposium on Temporal Representation and Reasoning
·
45
PDF
Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs
2008
·
Anuj Dawar
, David Richerby
, et al.
·
Annals of Pure and Applied Logic
·
43
Logics with counting and local properties
2000
·
Leonid Libkin
·
ACM Transactions on Computational Logic
·
43
PDF
On the Expressive Power of Linear Algebra on Graphs
2020
·
Floris Geerts
·
Theory of Computing Systems
·
38
PDF
On the forms of locality over finite models
2002
·
L. Libkin
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
38
Dynamic tree isomorphism via first-order updates to a relational database
1998
·
Kousha Etessami
·
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)
·
36
PDF
First-order and counting theories ofω-automatic structures
2008
·
Dietrich Kuske
, Markus Lohrey
·
Journal of Symbolic Logic
·
35
Is Polynomial Time Choiceless?
2015
·
Erich Grädel
, Martin Grohe
·
Lecture notes in computer science
·
27
Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
2026
·
Isolde Adler
, Eva Fluck
, et al.
·
Logical Methods in Computer Science
·
25
PDF
Sherali-Adams relaxations and indistinguishability in counting logics
2012
·
Albert Atserias
, Elitza Maneva
·
Conference on Innovations in Theoretical Computer Science
·
25
On the Expressive Power of Homomorphism Counts
2021
·
Albert Atserias
, Phokion G. Kolaitis
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
24
On the Weisfeiler-Leman Dimension of Finite Groups
2020
·
Jendrik Brachter
, Pascal Schweitzer
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
24
PDF
Pebble Games with Algebraic Rules*
2017
·
Anuj Dawar
, Bjarki Holm
·
Fundamenta Informaticae
·
21
PDF
On counting logics and local properties
2002
·
L. Libkin
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
21
Logics with aggregate operators
2003
·
L. Hella
, L. Libkin
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
20
Stärken und Grenzen des Weisfeiler-Leman-Algorithmus
2020
·
Kiefer, Sandra
·
RWTH Publications (RWTH Aachen)
·
18
Pebble Games with Algebraic Rules
2012
·
Anuj Dawar
, Bjarki Holm
·
Lecture notes in computer science
·
18
Show more works
View as search
Works count:
133
Citation count:
1,692
Year
Topic
Type