4 citations
3 papers
cs.LO2026
Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
Isolde Adler, Eva Fluck, Tim Seppelt +1
We study the expressive power of first-order logic with counting quantifiers, especially the -variable and quantifier-rank- fragment, using homomorphism indistinguishability.…
cs.DL2026★ 4 cited
Generative Artificial Intelligence for Literature Reviews
Gerit Wagner, Julian Prester, Reza Mousavi +2
Generative artificial intelligence (GenAI), based on large-language models (LLMs), such as ChatGPT, has taken organizations, academia, and the public by storm. In particular, impre…
cs.PL2026
Determinacy with Priorities up to Clocks
Luigi Liquori, Michael Mendler, Claude Stolze
In Milner's seminal book on communication and concurrency introducing CCS, a process algebra inherently non-deterministic, chapter 11 was completely devoted to introduce the notion…