Efficient Term-ITE Conversion for Satisfiability Modulo Theories

@inproceedings{Kim2009EfficientTC,
  title={Efficient Term-ITE Conversion for Satisfiability Modulo Theories},
  author={Hyondeuk Kim and Fabio Somenzi and HoonSang Jin},
  booktitle={SAT},
  year={2009}
}
This paper describes how term-if-then-else(term-ITE) is handled in Satisfiability Modulo Theories (SMT) and to decide Linear Arithmetic Logic(LA) in particular. Term-ITEs allow one to conveniently express verification co ditions; hence, they are very common in practice. However, the theory pr vers of SMT solvers are usually designed to work on conjunctions of literals; there for , the input formulae are rewritten so as to eliminate term-ITEs. The challenge in rewriting is to avoid introducing… CONTINUE READING