Optimal satisfiability checking for arithmetic \(\mu\)-calculi

DOI10.1007/978-3-030-17127-8_16OpenAlexW2964046005MaRDI QIDQ2289080

Daniel Hausmann, Lutz Schröder

Publication date: 28 January 2020

Full work available at URL: https://arxiv.org/abs/1901.04893

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (3)

Universal algorithms for parity games and nested fixpoints ⋮ Unnamed Item ⋮ Quasipolynomial computation of nested fixpoints

This page was built for publication: Optimal satisfiability checking for arithmetic \(\mu\)-calculi