Sciweavers

1000 search results - page 89 / 200
» Nominal rewriting systems
Sort
View
MST
2002
97views more  MST 2002»
13 years 8 months ago
Programmed Mutagenesis Is Universal
Programmed mutagenesis is a DNA computing system that uses cycles of DNA annealing, ligation, and polymerization to implement programatic rewriting of DNA sequences. We report that...
Julia Khodor, David K. Gifford
ESAW
2004
Springer
14 years 2 months ago
Cooperative Agent Model Instantiation to Collective Robotics
The general aim of our work is to provide tools, methods and models to adaptive multi-agent systems designers. These systems consist in several interacting agents and have to optim...
Gauthier Picard
SIGMOD
2005
ACM
228views Database» more  SIGMOD 2005»
14 years 9 months ago
ConQuer: Efficient Management of Inconsistent Databases
Although integrity constraints have long been used to maintain data consistency, there are situations in which they may not be enforced or satisfied. In this paper, we present Con...
Ariel Fuxman, Elham Fazli, Renée J. Miller
PPDP
2007
Springer
14 years 3 months ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
CADE
2010
Springer
13 years 8 months ago
Monotonicity Criteria for Polynomial Interpretations over the Naturals
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
Friedrich Neurauter, Aart Middeldorp, Harald Zankl