Sciweavers

15 search results - page 1 / 3
» Comparing expressiveness of set constructor symbols
Sort
View
AGP
1999
IEEE
13 years 9 months ago
Comparing expressiveness of set constructor symbols
In this paper we consider the relative expressive power of two very common operators applicable to sets and multisets: the with and the union operators. For such operators we prove...
Agostino Dovier, Carla Piazza, Alberto Policriti
JACM
2007
84views more  JACM 2007»
13 years 4 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
GECCO
2008
Springer
133views Optimization» more  GECCO 2008»
13 years 6 months ago
Using feature-based fitness evaluation in symbolic regression with added noise
Symbolic regression is a popular genetic programming (GP) application. Typically, the fitness function for this task is based on a sum-of-errors, involving the values of the depe...
Janine H. Imada, Brian J. Ross
JLP
2006
138views more  JLP 2006»
13 years 4 months ago
Algebraic-coalgebraic specification in CoCasl
We introduce CoCasl as a light-weight but expressive coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatype...
Till Mossakowski, Lutz Schröder, Markus Rogge...
DAC
2004
ACM
14 years 5 months ago
A SAT-based algorithm for reparameterization in symbolic simulation
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening