The present paper deals with the relationship between sense ordering and the primary function of the dictionary, arguing that the former should reflect the latter. I give suggestions as to how this could be achieved in practice, and which sense ordering would best serve the different functions. Given that lexicography appears to be at an important crossroads, I claim that lexicographers should ...

An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general Mezei-Wright type result, algebraic linear orderings are exactly those isomorphic to the linear ordering of the leaves of an algebraic tree. Using Courcelle...

Giving a semantics to an inheritance hierarchy, or more generally to a set of prioritized defaults, can be done using the lexicographic ordering, rst used by 5] for circumscription. The technique can be extended to any preferential logic, as noted in 2], where it is dubbed generalized prioritization. It has also been used independently in 9, 12]. In this paper we examine how important propertie...

Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision making with limited resources. Take-the-best searches for a sufficiently good ordering of cues (or features) in a task where objects are to be compared lexicographically. We investigate the computational complexity of fin...

We show, under some assumption on the signature, that the 9 8 fragment of the theory of a lexicographic path ordering is undecidable, both in the partial and in the total precedence cases. Our result implies in particular that the simpliication rule of ordered completion is undecidable.

We give a notion of measure on P that overcomes some limitations of earlier formulations. In the process, we investigate the significance for resource-bounded measure of the choice of the lexicographic ordering of the words. Disciplines Theory and Algorithms This article is available at Iowa State University Digital Repository: http://lib.dr.iastate.edu/cs_techreports/169 Measure on P: Strength...

We present an arc-consistency algorithm for a chain of lexicographic ordering constraints on m vectors of n variables each. The algorithm maintains arc-consistency and runs in O(nmd) time per invocation, where d is the cost of certain domain operations.

We present in this paper a new procedure to saturate a set of clauses with respect to a well-founded ordering on ground atoms such that A ≺ B implies V arA ⊆ Var(B) for every atoms A and B. This condition is satisfied by any atom ordering compatible with a lexicographic, recursive, or multiset path ordering on terms. Our saturation procedure is based on a priori ordered resolution and its main ...

Many constraint satisfaction problems (such as scheduling, assignment, and configuration) can be modelled as constraint programs based on matrices of decision variables. In such matrix models, symmetry is an important feature. We study and generalise symmetry-breaking techniques, such as lexicographic ordering, and propose a labelling technique achieving the same effect.

This paper deals with decision making under uncertainty when the worth of acts is evaluated by means of Sugeno integral. One limitation of this approach is the coarse ranking of acts it produces. In order to refine this ordering, a mapping from the common qualitative utility and uncertainty scale to the reals is proposed, whereby Sugeno integral is changed into a Choquet integral. This work rel...