29 search results - page 2 / 6 » Tree Automata with Memory, Visibility and Structural Constra... |
IS
2010
13 years 7 months ago
2010
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
ICALP
1998
Springer
14 years 22 days ago
1998
Springer
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
SBBD
2007
13 years 10 months ago
2007
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
RTA
2000
Springer
14 years 2 days ago
2000
Springer
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...