We present a novel approach to constraintbased causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about causal relations that are derived directly from observed (in)dependencies. It is both sound and complete, in the sense that all invariant features of the corresponding partial ancestral graph (PAG) are identified, even i...

This paper improves several well-known results concerning the descriptional complexity of grammars regulated by context conditions. Specifically, it proves that every recursively enumerable language is generated (A) by a context-conditional grammar of degree (2, 1) with no more than seven conditional productions and eight nonterminals, (B) by a generalized forbidding grammar of degree two with ...

Weighted labelled transition systems (WLTSs) are an established (meta-)model aiming to provide general results and tools for a wide range of systems such as non-deterministic, stochastic, and probabilistic systems. In order to encompass processes combining several quantitative aspects, extensions of the WLTS framework have been further proposed, state-to-function transition systems (FuTSs) and ...

The presence of deterministic relations pose problems for current algorithms that learn the causal structure of a system based on the observed conditional independencies. Deterministic variables lead to information equivalences; two sets of variables have the same information about a third variable. Based on information content, one cannot decide on the direct causes. Several edges model equall...

0

Résumé. Cet article1 porte sur l’analyse de parcours de vie représentés sous forme de séquences d’événements. Plus spécifiquement, on examine les possibilités d’exploiter des codages de type n-grammes de ces séquences pour en extraire des connaissances. En fait, compte tenu de la simultanéité de certains événements, une procédure stricte de n-grammes comme on peut par exemple l’appliquer sur de...

Les systèmes d’Extraction de Réponses (ER) récupèrent dans des documents des expressions qui répondent directement à des questions du langage courant. L’ER pour des manuels techniques exige un haut niveau de rappel et de précision ; pourtant, ce sont de petites unités de texte qui doivent être récupérées. C’est pourquoi il est important d’effectuer une analyse linguistique détaillée. Nous prése...

Present virtual heritage projects are mostly focused either on ‘process’ or ‘product’ but rarely consider ‘user’ (end user’s perception of the content) with project contents predominantly developed with an ‘ocular-centric’ tendency. There is no signifi cant interpretation method or principles for interpreting digital heritage unlike other disciplines such as archaeology. This paper argues that,...

We present a new tree based approach to composing expressive image descriptions that makes use of naturally occuring web images with captions. We investigate two related tasks: image caption generalization and generation, where the former is an optional subtask of the latter. The high-level idea of our approach is to harvest expressive phrases (as tree fragments) from existing image description...

In this paper we survey results related to homomorphism dualities for graphs, and more generally, for finite structures. This is related to some of the classical combinatorial problems, such as colorings of graphs and hypergraphs, and also to recently intensively studied Constraint Satisfaction Problems. On the other side dualities are related to the descriptive complexity and First Order defin...