Expressiveness and Complexity of Full First-Order Constraints in the Algebra of Trees
- 217 Downloads
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.