4 citations · 5 across the 4 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.LO2023★ 1 cited
Ramsey Quantifiers in Linear Arithmetics
Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin +1
We study Satisfiability Modulo Theories (SMT) enriched with the so-called Ramsey quantifiers, which assert the existence of cliques (complete graphs) in the graph induced by some f…
cs.FL2023
Parikh's Theorem Made Symbolic
Matthew Hague, Artur Jeż, Anthony W. Lin
Parikh's Theorem is a fundamental result in automata theory with numerous applications in computer science: software verification (e.g. infinite-state verification, string constrai…