We present new insights and algorithms for converting reasoning problems in monadic First-Order Logic (includes only 1place predicates) into equivalent problems in propositional logic. Our algorithms improve over earlier approaches in two ways. First, they are applicable even without the unique-names and domain-closure assumptions, and for possibly infinite domains. Therefore, they apply for ma...
