74 search results - page 5 / 15 » The Emptiness Problem for Tree Automata with Global Constrai... |
FSTTCS
2006
Springer
14 years 7 days ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
CPAIOR
2009
Springer
14 years 3 months ago
2009
Springer
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
LPAR
2005
Springer
14 years 2 months ago
2005
Springer
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...
ANOR
2011
13 years 3 months ago
2011
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
AI
2008
Springer
13 years 8 months ago
2008
Springer
It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it ...