1071 search results - page 76 / 215 » Programming with enumerable sets of structures |
177
Voted
CP
2009
Springer
16 years 1 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
104
Voted
ENTCS
2007
15 years 17 days ago
2007
Strategies are a powerful mechanism to control rule application in rule-based systems. For instance, different transition relations can be defined and then combined by means of ...
79
Voted
PLDI
2010
ACM
15 years 5 months ago
2010
ACM
Traditional data-oriented programming languages such as dataflow s and stream languages provide a natural abstraction for parallel programming. In these languages, a developer fo...
104
Voted
FOSSACS
2010
Springer
15 years 7 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
153
Voted
WFLP
2009
Springer
15 years 7 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...