nt an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive...
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
We present an approach to spatial inference which is based on the procedural semantics of spatial relations. In contrast to qualitative reasoning, we do not use discrete symbolic m...
Sylvia Wiebrock, Lars Wittenburg, Ute Schmid, Frit...
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...