@inproceedings{veanes2013effectively,
author = {Veanes, Margus and Bjørner, Nikolaj and Nachmanson, Lev and Bereg, Sergey},
title = {Effectively Monadic Predicates},
booktitle = {LPAR-19},
year = {2013},
month = {December},
abstract = {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.},
publisher = {Easychair},
url = {http://approjects.co.za/?big=en-us/research/publication/effectively-monadic-predicates/},
edition = {LPAR-19},
}