Sciweavers

6 search results - page 1 / 2
» Covering of ordinals
Sort
View
FSTTCS
2009
Springer
13 years 11 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
ICALP
2007
Springer
13 years 11 months ago
Succinct Ordinal Trees Based on Tree Covering
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
Meng He, J. Ian Munro, S. Srinivasa Rao
FOSSACS
2011
Springer
12 years 8 months ago
Ordinal Theory for Expressiveness of Well Structured Transition Systems
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
Rémi Bonnet, Alain Finkel, Serge Haddad, Fe...
IWINAC
2005
Springer
13 years 10 months ago
Interval-Valued Neural Multi-adjoint Logic Programs
The framework of multi-adjoint logic programming has shown to cover a number of approaches to reason under uncertainty, imprecise data or incomplete information. In previous works,...
Jesús Medina, Enrique Mérida Caserme...
EOR
2002
96views more  EOR 2002»
13 years 4 months ago
Multicriteria classification and sorting methods: A literature review
The assignment of alternatives (observations/objects) into predefined homogenous groups is a problem of major practical and research interest. This type of problem is referred to ...
Constantin Zopounidis, Michael Doumpos