Expressiveness and Complexity of Full First-Order Constraints in the Algebra of Trees

  • Alain Colmerauer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2385)


What can be expressed by constraints, in the algebra of trees, if quantifiers and all the logical connectors are allowed? What is the complexity of algorithms for solving such general first-order constraints? This talk answers these two questions.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Alain Colmerauer
    • 1
  1. 1.Laboratoire d’Informatique Fondamentale de MarseilleUniversité Aix-Marseille IIFrance

Personalised recommendations