This paper presents a theory of dynamic slicing, which reveals that the relationship between static and dynamic slicing is more subtle than previously thought. The definitions of dynamic slicing are formulated in terms of the projection theory of slicing. This shows that existing forms of dynamic slicing contain three orthogonal dimensions in their slicing criteria and allows for a lattice-theo...

We outline a model of dimensional reasoning on time and space scales which integrates quantitative and qualitative knowledge about distances. At the core of this model lie constraints on interval boundaries, partial ordering and subsumption relations on interval relations and interval boundary constraints, as well as the transformation of interval relations to interval boundary constraints and ...

Finite model reasoning in expressive DLs such as ALCQI and SHIQ requires non-trivial algorithmic approaches that are substantially differerent from algorithms used for reasoning about unrestricted models. In contrast, finite model reasoning in the inexpressive fragment DL-LiteF of ALCQI and SHIQ is algorithmically rather simple: using a TBox completion procedure that reverses certain terminolog...

To align representations of law, of implementations of law and of concrete behaviours, we designed a common ground representational model for the three domains, based on the notion of position, building upon Petri nets. This paper reports on work to define subsumption between positional models.

We investigate a rst-order extension of the Theory of Primitive Objects of 5] that supports method extension in presence of object subsumption. Extension is the ability of modifying the behavior of an object by adding new methods (and inheriting the existing ones). Object subsumption allows to use objects with a bigger interface in a context expecting another object with a smaller interface. Th...

We propose to use the visual denotations of linguistic expressions (i.e. the set of images they describe) to define novel denotational similarity metrics, which we show to be at least as beneficial as distributional similarities for two tasks that require semantic inference. To compute these denotational similarities, we construct a denotation graph, i.e. a subsumption hierarchy over constituen...

We prove the completeness of the regular strategy of derivations for superposition-based calculi. The regular strategy was pioneered by Kanger in (Kan63), who proposed that all equality inferences take place before all other steps in the proof. We show that the strategy is complete with the redundancy notions of tautology elimination and subsumption. The implication of our result is the complet...