Effectively Monadic Predicates

7 pages•Published: July 28, 2014

Margus Veanes, Nikolaj Bjorner, Lev Nachmanson and Sergey Bereg

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.

Keyphrases: monadic decomposition, monadic predicates, satisfiability modulo theories, symbolic automata

In: Ken 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.

Links:	https://easychair.org/publications/paper/5
	https://doi.org/10.29007/drll

BibTeX entry

@inproceedings{LPAR-19:Effectively_Monadic_Predicates,
  author    = {Margus Veanes and Nikolaj Bjorner and Lev Nachmanson and Sergey Bereg},
  title     = {Effectively Monadic Predicates},
  booktitle = {LPAR-19. 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Ken Mcmillan and Aart Middeldorp and Geoff Sutcliffe and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {26},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/5},
  doi       = {10.29007/drll},
  pages     = {97-103},
  year      = {2014}}

Download PDF Open PDF in browser