Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Effectively Monadic Predicates

Margus Veanes, Nikolaj Bjorner, Lev Nachmanson, and Sergey Bereg


Monadic predicates play a prominent role in many decidable cases, including decision procedures for symbolic automata. We are here interested in discovering whether a formula can be rewritten into a Boolean combination of monadic predicates. Our setting is quantifier-free formulas over a decidable background theory, such as arithmetic and we here develop a semi-decision procedure for extracting a monadic decomposition of a formula when it exists.


Publication typeInproceedings
Published inLPAR-19
> Publications > Effectively Monadic Predicates