Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another. For example, if a specification asks that every request is followed by a response, one may prefer an implementation that generates responses quickly but does not generate unnecessary responses. We use quantitative properties t...

In this paper LexikoNet, a large lexical ontology of German nouns is presented. Unlike GermaNet and the PrincetonWordNet, LexikoNet has distinguished type and role hypernyms right from the outset and organizes those lexemes in a parallel, independent hierarchy. In addition to roles and types, LexikoNet uses meronymic and holonymic relations as well as the instance relation. LexikoNet is based o...

The paper concerns the use of the lexicographic rule for combining preference relations with diierent priorities. We use it to interpret defaults with priorities. We present four kinds of results. We show that the lexicographic rule is the only way of combining preference relations which satisses conditions proposed by Arrow 1. We show in what circumstances the lexicographic rule propagates var...

This paper proposes a dynamic lexicographic approach to tackle multi-objective optimization problems. In this method, the ordering of objectives, which reflects their relative preferences, is changed in a dynamic fashion during the search. This approach eliminates the need for the decision-maker to establish fixed preferences among the competing objectives, which is often difficult. At the same...

Location problems with Q (in general connicting) criteria are considered. After reviewing previous results of the authors dealing with lexicographic and Pareto location the main focus of the paper is on max-ordering locations. In these location problems the worst of the single objectives is minimized. After discussing some general results (including reductions to single criterion problems and t...

We first give a fast algorithm to compute the maximal Lyndon word (with respect to lexicographic order) ofLy (A) for every given multidegree in N . We then give an algorithm to compute all the words living in Ly (A) for any given in N . The best known method for generating Lyndon words is that of Duval [1], which gives a way to go from every Lyndon word of length n to its successor (with respec...

The project Linguistic Portrait of Georgia envisages various aspects of documentation of Georgian linguistic reality by means of corpus methodologies. This title is an umbrella for three large-scale projects within the framework of which The Georgian Dialect Corpus – GDC (http://corpora.co) was developed. Presently, the architecture and text base of the corpus have been designed, being permanen...

In this paper, we introduce a concise representation, called right-distance sequences (or RD-sequences for short), to describe all t-ary trees with n internal nodes. A result reveals that there exists a close relationship between the representation and the well-formed sequences suggested by Zaks [Lexicographic generation of ordered trees, Theoretical Computer Science 10 (1980) 63–82]. Using a c...

This article describes the structure, features and usage of a specialized lexicographic workstation, named PRALED, developed by the Faculty of Informatics, Masaryk University for the purpose of development of new modern lexical database of the Czech language at the Institute of Czech Language, Czech Academy of Sciences. The PRALED system is based on the Dictionary Editor and Browser (DEB) devel...

A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. In this paper improved lower and upper bounds for ψk of the Cartesian and the direct product of paths are derived. It is shown that for ψ3 those bounds are tight. For the lexicographic produc...