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...

We define the direction of knowledge, and what it means to extend that direction. A special case is function inversion, and we give three algorithms for function inversion. Their performance on non-trivial problems and their shortcomings are demonstrated. All algorithms are implemented in Prolog

The role of parents-in-law according to Erik Erikson’s theory, has been analyzed in this paper. Erikson claims that a man develops throughout his whole life, solving subsequently appearing crises. The proper solution of these crises enables the achievement of integration. The results of research, carried out by Menelaos Apostolou, regarding the influence of parents on the choice of a son or dau...

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.

pology hypotheses. The output of this stage is in the form of histograms and n-tuples. Finally the display and fit stage displays statistical data accumulated in the preceding stages in the form of histograms, scatter plots, etc. Fitting the data to known functions is also done in this stage. The remainder of this paper will consider what analysis tools are available today, and what one might e...