218 search results - page 12 / 44 » Finite Trees as Ordinals |
TPLP
2008
14 years 9 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
CP
2003
Springer
15 years 3 months ago
2003
Springer
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
COMBINATORICS
2007
14 years 10 months ago
2007
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...
101
click to vote
LPAR
2001
Springer
15 years 2 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
CSL
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...