We develop an extensible description logic for stating the content of optimalitytheoretic constraints in phonology, and specify a class of structures for interpreting it. The aim is a transparent formalisation of OT. We show how to state a wide range of constraints, including markedness, input–output faithfulness and base–reduplicant faithfulness. However, output–output correspondence and ‘inte...

This paper concentrates on comparing the relative expressive power of ve non-monotonic logics that have appeared in the literature. The results on the computational complexity of these logics suggest that these logics have very similar expressive power that exceeds that of classical monotonic logic. A reened classiication of non-monotonic logics by their expressive power can be obtained using t...

This paper presents the motivation expressions of Smart Walker, which is intended for use during rehabilitation exercise for the recovery of walking ability. Smart Walker is the application of a robotic system for the elderly. Its main purposes are to improve mobility and maintain balance, though it can also be used as a rehabilitation assistant for patients who have trouble walking as a result...

Languages often single out prominent positions for special consideration, allowing certain elements to appear only in those positions. Often material in the prominent position surfaces faithfully but neutralizes elsewhere (preservation systems), but other systems involve the spreading or migration of features to the prominent position to comply with the positional restriction (overwrite systems...

It is well-known that intuitionistic propositional logic Int may be faithfully embedded not just into the modal logic S4 but also into the provability logics GL and Grz of Gödel-Löb and Grzegorczyk, and also that there is a similar embedding of Grz into GL. Known proofs of these faithfulness results are short but model-theoretic and thus non-constructive. Here a labelled sequent system Grz for ...

This paper presents two sufficient conditions to ensure a faithful evaluation of polynomial in IEEE-754 floating point arithmetic. Faithfulness means that the computed value is one of the two floating point neighbours of the exact result; it can be satisfied using a more accurate algorithm than the classic Horner scheme. One condition here provided is an a priori bound of the polynomial conditi...