We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...
Background: Translational research requires taking basic science observations and developing them into clinically useful tests and therapeutics. We have developed a process to dev...
Robert Kim, Francesca Demichelis, Jeffery Tang, Al...
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...