Download PDFOpen PDF in browserEffectively Monadic Predicates7 pages•Published: July 28, 2014AbstractMonadic 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.Keyphrases: monadic decomposition, Monadic predicates, Satisfiability Modulo Theories, symbolic automata In: Kenneth L. McMillan, Aart Middeldorp, Geoff Sutcliffe and Andrei Voronkov (editors). LPAR-19. 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 26, pages 97--103
|