We show that the relational theory of intersection types known as BCD has the finite model property; that is, BCD is complete for its finite models. Our proof uses rewriting techniques which have as an immediate by-product the polynomial time decidability of the preorder ⊆ (although this also follows from the so called beta soundness of BCD). BCD is the relational theory of intersection types p...

The relation between process algebra and I/O au-tomata models is investigated in a general setting of structured operational semantics (SOS). For a series of (approximations of) key properties of I/O au-tomata, syntactic constraints on inference rules are proposed which guarantee these properties. A rst result is that, in a setting without assumptions about actions, the well-known trace and fai...

Coherence-based approaches are quite popular to reason under inconsistency. Most of them are defined with respect to totally preordered belief bases such as the lexicographic inference which is known to have desirable properties from theoretical, practical and psychological points of view. However, partially preordered belief bases offer much more flexibility to represent efficiently incomplete...

1. MOTIVATION Merging information provided by several sources is an important issue and merging techniques have been extensively studied. When the reliability of the sources is not known, one can apply merging techniques such as majority or arbitration merging or distancebased merging for solving conflicts between information. At the opposite, if the reliability of the sources is known, either ...

In this note we streamline an earlier algorithm for constructing a binary tree from its inorder and preorder traversals. The new algorithm is conceptually simpler than the earlier algorithms and its time complexity has a smaller constant factor.

A method of construction an inverse system finite compacta, indexed with positive reals, from a compact ultrapseudometric, is proposed. It proved that homeomorphisms and natural preorder on the class ultrapseudometrics correspond to strict isomorphisms morphisms respective systems. Properties poset obtained "gluing together" isomorphic systems, are discussed.

We provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results regarding the axiomatizability of BCCS modulo weak impossible futures semantics.