Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
It is well-known that knowledgebases may contain inconsistencies. We provide a framework of measures, based on a first-order four-valued logic, to quantify the inconsistency of a ...
We present a novel framework for recognizing repetitive
sequential events performed by human actors with strong
temporal dependencies and potential parallel overlap. Our
solutio...
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
We propose a subpixel registration algorithm to deal with the motion induced by breathing for renal perfusion MR image sequences. Our approach minimizes an energy functional that ...