Abstract

We report on successfully porting and making available online Tarski, a system for computing with Tarski formulas (Boolean combinations of polynomial sign conditions over the real numbers). Tarski provides operations like formula simplification and quantifier elimination, and is able to read and write SMT-LIB syntax. The web version of Tarski was created by using the Emscripten C++ to JavaScript/WebAssembly compiler. A terminal-based interpreter is provided via jquery.terminal. Tarski is also available as a JavaScript library. We report on an experimental use in the dynamic geometry software GeoGebra.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call