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. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Veanes, M., Bjørner, N., Nachmanson, L., & Bereg, S. (2014). Monadic decomposition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8559 LNCS, pp. 628–645). Springer Verlag. https://doi.org/10.1007/978-3-319-08867-9_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
