Monadic Decomposition [chapter]

Margus Veanes, Nikolaj Bjørner, Lev Nachmanson, Sergey Bereg
2014 Lecture Notes in Computer Science  
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 quantifierfree 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.
doi:10.1007/978-3-319-08867-9_42 fatcat:hewaxiaawbbixoyunxpe4zncvi