106 articles – 48 references  [version française]
 HAL: hal-00144931, version 1
 Constraints 8, 3 (2003) 283-302
 Expressiveness of Full First-Order Constraints in the Algebra of Finite or Infinite Trees
 (2003-07)
 We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infinite set F. The chosen domain is the set of trees whose nodes, in possibly infinite number, are labelled by elements of F. The operation linked to each element f of F is the mapping (a 1,..., a n ) map b, where b is the tree whose initial node is labelled f and whose sequence of daughters is a 1,..., a n . We first consider tree constraints involving long alternated sequences of quantifiers existforallexistforall.... We show how to express winning positions of two-person games with such constraints and apply our results to two examples. We then construct a family of strongly expressive tree constraints, inspired by a constructive proof of a complexity result by Pawel Mielniczuk. This family involves the huge number agr(k), obtained by top down evaluating a power tower of 2's, of height k. By a tree constraint of size proportional to k, it is then possible to define a tree having exactly agr(k) nodes or to express the multiplication table computed by a Prolog machine executing up to agr(k) instructions. By replacing the Prolog machine with a Turing machine we show the quasi-universality of tree constraints, that is to say, the ability to concisely describe trees which the most powerful machine will never have time to compute. We also rediscover the following result of Sergei Vorobyov: the complexity of an algorithm, deciding whether a tree constraint without free variables is true, cannot be bounded above by a function obtained from finite composition of simple functions including exponentiation. Finally, taking advantage of the fact that we have at our disposal an algorithm for solving such constraints in all their generalities, we produce a set of benchmarks for separating feasible examples from purely speculative ones. Among others we notice that it is possible to solve a constraint of 5000 symbols involving 160 alternating quantifiers.
 1: Laboratoire d'informatique Fondamentale de Marseille (LIF) CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I 2: Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges
 Subject : Computer Science/Artificial Intelligence
 Keyword(s): first order logic – trees – constraints – expressiveness – complexity
Attached file list to this document:
 PDF
 exppower.pdf(376 KB)
 hal-00144931, version 1 http://hal.archives-ouvertes.fr/hal-00144931 oai:hal.archives-ouvertes.fr:hal-00144931 From: Thi-Bich-Hanh Dao <> Submitted on: Friday, 12 March 2010 11:13:31 Updated on: Friday, 12 March 2010 14:08:08