Sciweavers

11740 search results - page 60 / 2348
» More Problems in Rewriting
Sort
View
LICS
1994
IEEE
14 years 2 months ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 4 months ago
Self-modifying cartesian genetic programming
In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is su...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
MPC
2010
Springer
147views Mathematics» more  MPC 2010»
14 years 2 months ago
Designing an Algorithmic Proof of the Two-Squares Theorem
We show a new and constructive proof of the two-squares theorem, based on a somewhat unusual, but very effective, way of rewriting the so-called extended Euclid’s algorithm. Rat...
João F. Ferreira
WWW
2008
ACM
14 years 10 months ago
Dissemination of heterogeneous xml data
A lot of recent research has focused on the content-based dissemination of XML data. However, due to the heterogeneous data schemas used by different data publishers even for data...
Yuan Ni, Chee Yong Chan
ACL2
2006
ACM
14 years 4 months ago
Parameterized congruences in ACL2
Support for congruence-based rewriting is built into ACL2. This capability allows ACL2 to treat certain predicate relations ”just like equality” under appropriate conditions a...
David Greve