Open AccessWrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT
Author(s) -
Pascal Fontaine,
Mizuhito Ogawa,
Thomas Sturm,
Van Khanh To,
Xuan Tung Vu
Publication year - 2018
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - symbolic computation , quantifier elimination , satisfiability modulo theories , computer science , algebra over a field , satisfiability , linear algebra , modulo , computation , theoretical computer science , constraint satisfaction problem , two element boolean algebra , implementation , key (lock) , constraint (computer aided design) , heuristic , algorithm , programming language , mathematics , discrete mathematics , algebra representation , artificial intelligence , pure mathematics , geometry , mathematical analysis , computer security , probabilistic logic