Let ? be a finite, undirected, connected, simple graph. We say that matching M is permutable m -matching if contains edges and the subgroup of Aut ( ) fixes setwise allows to permuted in any fashion. A 2-transitive stabilizer can map ordered pair distinct other . provide constructions graphs with matching; we show that, an arc-transitive graph for ? 4 , then degree at least ; and, when sufficie...

6 International Conference TABLEAUX’97 – Short Papers, Technical Report CRIN 97-R-030, Université de Nancy II, 1997 Abstract. We present a refutation system for intuitionistic logic which allows to locate situations where constructive reasoning is unnecessary. In many subgoals of a derivation this property makes it possible to reduce the set of relevant reduction rules to a confluent one. As a ...

A permutation phrase is a sequence of elements (possibly of different types) in which each element occurs exactly once and the order is irrelevant. Some of the permutable elements may be optional. We show a way to extend a parser combinator library with support for parsing such free-order constructs. A user of the library can easily write parsers for permutation phrases and does not need to car...

This paper presents an integration of centering theory ([GJW95]) into incremental dynamic logic. The formalism is based on an idea found in [vE00a], where contexts are permutable in order to model salience. Building on this idea, centering theory is restated as a formalism on contexts. Subsequently the system is used to consider some problems centering theory has once plurality is taken into ac...

In the framework of fully permutable loops tiling has been extensively studied as a source to source program transformation However little work has been devoted to the mapping and scheduling of the tiles on physical processors Moreover targeting hetero geneous computing platforms has to the best of our knowledge never been considered In this paper we extend tiling techniques to the context of l...

In the framework of fully permutable loops, tiling has been extensively studied as a sourceto-source program transformation. However, little work has been devoted to the mapping and scheduling of the tiles on physical processors. Moreover, targeting heterogeneous computing platforms has to the best of our knowledge, never been considered. In this paper we extend static tiling techniques to the ...