Web ontology representation and reasoning via fragments of set theory

In this paper we use results from Computable Set Theory as a means to represent and reason about description logics and rule languages for the semantic web. Specifically, we introduce the description logic \mathcal{DL}\langle 4LQS^R\rangle(\D)--admitting features such as min/max cardinality constructs on the left-hand/right-hand side of inclusion axioms, role chain axioms, and datatypes--which turns out to be quite expressive if compared with \mathcal{SROIQ}(\D), the description logic underpinning the Web Ontology Language OWL. Then we show that the consistency problem for \mathcal{DL}\langle 4LQS^R\rangle(\D)-knowledge bases is decidable by reducing it, through a suitable translation process, to the satisfiability problem of the stratified fragment $4LQS^R$ of set theory, involving variables of four sorts and a restricted form of quantification. We prove also that, under suitable not very restrictive constraints, the consistency problem for \mathcal{DL}\langle 4LQS^R\rangle(\D)-knowledge bases is \textbf{NP}-complete. Finally, we provide a $4LQS^R$-translation of rules belonging to the Semantic Web Rule Language (SWRL)

‘Movement as disclosive of being’ Merleau-Ponty: from the psychology of gestalt to the analysis of movement

In this essay we seek to clarify the meaning and theoretical implications of the statement by Merleau-Ponty contained in his 1953 course, Le Monde Sensible et le Monde de l’Expression, according to which movement is ‘revealing of being’. This analysis takes up and comments on chapter 7 of Koffka’s Principles of Gestalt Psychology (dedicated to the issue of movement) and related experiments in particular. We will show that Merleau-Ponty’s idea of ontology of movement emerges from his examination of several exemplary cases. This method of analysis brings to light an idea of similar phenomenology compatible with an experimental phenomenolog

The Train dynamics of wheel rail contact and longitudinal lateral interaction between vehicles

This paper is focused on the vehicle dynamics caused by the forces exchanged, through buffers and draw gears, by consecutive vehicles on a curve. The results have been obtained by adding a buffers/draw gears contact model on an existing multibody code, previously developed by the authors. The multibody code manages rigid bodies connected by elastic and rigid constraints; the wheel/rail contact model is three dimensional and employs an elastic constraint among wheel and rail. The wheel/rail contact is managed by means of a numerical model called TOAM (third order approximation method). Numerical tests and experimental validations of the proposed model are here presented, considering a train made by three vehicles, running on an S shaped curve, subjected to parametric compressive forces

Documenting design decision rationale to improve individual and team design decision making: An experimental evaluation

Individual and team decision-making have crucial influence on the level of success of every software project. Even though several studies were already conducted, which concerned design decision rationale documentation approaches, a few of them focused on performances and evaluated them in laboratory. This paper proposes a technique to document design decision rationale, and evaluates experimentally the impact such a technique has on effectiveness and efficiency of individual/team decision-making in presence of requirement changes. The study was conducted as a controlled experiment. Fifty post-graduate Master students performed in the role of experiment subjects. Documented design decisions regarding the Ambient Intelligence paradigm constituted the experiment objects. Main results of the experiment show that, for both individual and team-based decision-making, effectiveness significantly improves, while efficiency remains unaltered, when decision-makers are allowed to use, rather not use, the proposed design rationale documentation technique. Copyright 2006 ACM

Value-based design decision rationale documentation: Principles and empirical feasibility study

The explicit documentation of the rationale of design decisions is a practice generally encouraged, but rarely implemented in industry because of a variety of inhibitors. Methods proposed in the past for Design Decisions Rationale Documentation (DDRD) aimed to maximize benefits for the DDRD consumer by imposing on the producer of DDRD the burden to document all the potentially useful information. We propose here a compromise which consists in tailoring DDRD, based on its intended use or purpose. In our view, the adoption of a tailored DDRD, consisting only of the required set of information, would mitigate the effects of DDRD inhibitors. The aim of this paper is twofold: i) to discuss the application of Value-Based Software Engineering principles to DDRD, ii) to describe a controlled experiment to empirically analyze the feasibility of the proposed method. Results show that the level of utility related to the same category of DDRD information significantly changes depending on its purpose; such result is novel and it demonstrates the feasibility of the proposed value-based DDRD

Decidability results for classes of purely universal formulae and quantifiers elimination in Set Theory

A general mechanism to extend decision algorithms to deal with additional predicates is described. The only conditions imposed on the predicates is stability with respect to some transitive relations

The Automation of Syllogistic II. Optimization and Complexity Issues

In the first paper of this series it was shown that any unquantified formula p in the collection MLSSF (multilevel syllogistic extended with the singleton operator and the predicate Finite) can be decomposed as a disjunction of set-theoretic formulae called syllogistic schemes. The syllogistic schemes are satisfiable and no two of them have a model in common, therefore the previous result already implied the decidability of the class MLSSF by simply checking if the set of syllogistic schemes associated with the given formula is empty. In the first section of this paper a new and improved searching algorithm for syllogistic schemes is introduced, based on a proof of existence of a 'minimum effort' scheme for any given satisfiable formula in MLSF. The algorithm addressed above can be piloted quite effectively even though it involves backtracking. In the second part of the paper, complexity issues are studied by showing that the class of ( 00)o1-simple prenex formulae (an extension of MLS) has a decision problem which is NP-complete. The decision algorithm that proves the membership of this decision problem to NP can be seen as a different decision algorithm for ML