815 search results - page 87 / 163 » Algebraic Recognizability of Languages |
190
click to vote
CSR
2007
Springer
16 years 9 days ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
271
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper, we are concerned with the distributed monitoring of P2P systems. We introduce the P2P Monitor system and a new declarative language, namely P2PML, for specifying mo...
158
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
162
click to vote
OOPSLA
2001
Springer
15 years 10 months ago
2001
Springer
The ability to extend a language with new syntactic forms is a powerful tool. A sufficiently flexible macro system allows programmers to build from a common base towards a langua...
171
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The annotation of the results of database transformations was shown to be very effective for various applications. Until recently, most works in this context focused on positive q...