Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many realworld systems and in formalised mathematics. Wh...
Abstract. We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consi...
This research proposes a decision aid based on a novel type of preference relaxation, which enables consumers to easily make quality choices in online multiattribute choice scenari...
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...