Civilization beyond the big pond: an overview of French computer science (prosopography)

an overview of French computer science (prosopography

Two Phase Description Logic Reasoning for Efficient Information Retrieval

Description Logics are used more and more frequently for knowledge representation, creating an increasing demand for efficient automated DL reasoning. However, the existing implementations are inefficient in the presence of large amounts of data. This paper summarizes the results in transforming DL axioms to a set of function-free clauses of first-order logic which can be used for efficient, query oriented data reasoning. The described method has been implemented in a module of the DLog reasoner openly available on SourceForge to download

Prolog, Mercury and the termination problem

This paper shortly introduces the two logic programming languages Prolog and Mercury. On this background we introduce the problem of analysing termination of programs. Then we present Mercury's termination analyser, that the authors of the language incorporated into its compiler. We will also discuss the proposition based on the same method analyser for Prolog's predicates

A Visual Notation for Declarative Behaviour Specification

Logical programming has many merits that should appeal to modellers. It enables declarative specifications that are free from implementation details and even (mostly) abstracts away from control flow specification. However, the textual syntax of, for example PROLOG, most likely represents a barrier to the adoption of such languages in the modelling community. The visual notation presented in this paper aims to facilitate the understanding of behaviour specifications based on logic programming. I anticipate that the dataflow-like nature of the resulting diagrams will appeal to modellers. I believe the visual notation to be an improvement over the traditional textual syntax for the purpose of specifying PROLOG programs as such, but the ultimate hope is to have found a vehicle to make declarative logic programming a commonplace activity in multi-paradigm modelling

Declarative phonology and suppletion: non-stratal, non-derivational models of phonology and morphological alternation

This draft aims at opening a discussion about the adequacy of non-stratal, non-derivational models of phonology, such as Declarative Phonology, to give appropriate accounts of any kind of phonological variation of morphemes. Refuting the assumption that all variants of one single morpheme correspond to a unique underlying form consecutively respecified through ordered adjustments of phonological shape, Declarative Phonology seems able to integrate explanations of both suppletive and non-suppletive alternation. A rough application of this model to suppletive alternation in Portuguese will be sketched out