8 search results - page 2 / 2 » Tree Automata with Equality Constraints Modulo Equational Th... |
CSCLP
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
PEPM
2011
ACM
12 years 7 months ago
2011
ACM
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...