395 search results - page 16 / 79 » Decision Problems for Convex Languages |
FMOODS
2007
13 years 9 months ago
2007
Rewriting logic provides a powerful, flexible mechanism for language definition and analysis. This flexibility in design can lead to problems during analysis, as different desi...
IJCAI
1989
13 years 8 months ago
1989
The set of partially interdependent lexical and syntactic decisions that have to be made in the process of natural language generation are best seen as a complex planning and sear...
TAPSOFT
1995
Springer
13 years 11 months ago
1995
Springer
Starting from the process algebra for Concurrent ML we develop two program analyses that facilitate the intelligent placement of processes on processors. Both analyses are obtaine...
CP
2007
Springer
14 years 1 months ago
2007
Springer
The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-w...
CP
2003
Springer
14 years 21 days ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...