3775 search results - page 177 / 755 » The Expression Problem Revisited |
140
click to vote
CPM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
148
click to vote
IDEAS
2002
IEEE
15 years 8 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
159
click to vote
DOOD
1991
Springer
15 years 7 months ago
1991
Springer
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the...
118
click to vote
ENTCS
2008
15 years 3 months ago
2008
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
126
click to vote
ML
2006
ACM
15 years 3 months ago
2006
ACM
The research presented in this paper is focused on global tempo transformations of music performances. We are investigating the problem of how a performance played at a particular...