This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from ...
We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combi...
Abstract. In this paper, we propose an approach to translating any ALC ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules. We achieve thi...
Abstract. We study a quantitative model of traces, i.e. trace series which assign to every trace an element from a semiring. We show the coincidence of recognizable trace series wi...