Monadic Decomposition

From MaRDI portal

Revision as of 15:47, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4640286

Jump to:navigation, search

DOI10.1145/3040488zbMath1426.03026OpenAlexW2623287016MaRDI QIDQ4640286

Sergey Bereg, Margus Veanes, Nikolaj Bjørner, Lev Nachmanson

Publication date: 17 May 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3040488

zbMATH Keywords

satisfiability modulo theories symbolic automata monadic logic variable independence

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (6)

A layered algorithm for quantifier elimination from linear modular constraints ⋮ Learning union of integer hypercubes with queries (with applications to monadic decomposition) ⋮ Quantifier elimination for counting extensions of Presburger arithmetic ⋮ Unnamed Item ⋮ Extended symbolic finite automata and transducers ⋮ Monadic decomposition in integer linear arithmetic

This page was built for publication: Monadic Decomposition

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4640286&oldid=18827913"