Monadic decomposition
From MaRDI portal
Publication:4640286
DOI10.1145/3040488zbMATH Open1426.03026OpenAlexW2623287016WikidataQ131136077 ScholiaQ131136077MaRDI QIDQ4640286FDOQ4640286
Authors: Margus Veanes, Nikolaj Bjørner, Lev Nachmanson, Sergey Bereg 
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
Recommendations
- Synthesizing Monadic Predicates
- On decidability of monadic logic of order over the naturals extended by monadic predicates
- A decidable fragment of predicate calculus
- Decidability of the monadic shallow linear first-order fragment with straight dismatching constraints
- Monadic Second-Order Logic with Arbitrary Monadic Predicates
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Cited In (10)
- Quantifier elimination for counting extensions of Presburger arithmetic
- Learning union of integer hypercubes with queries (with applications to monadic decomposition)
- Monoids and decay
- Monoidal multiplexing
- Monotonicity inference for higher-order formulas
- Extended symbolic finite automata and transducers
- Monadic decomposition in integer linear arithmetic
- Ramsey quantifiers over automatic structures: complexity and applications to verification
- A layered algorithm for quantifier elimination from linear modular constraints
- Title not available (Why is that?)
This page was built for publication: Monadic decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640286)
