6456 search results - page 61 / 1292 » Constraint Solving on Terms |
111
click to vote
CADE
2008
Springer
16 years 1 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
129
Voted
AIPS
2010
15 years 1 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
94
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
We introduce the patch transform, where an image is broken into non-overlapping patches, and modifications or constraints are applied in the "patch domain". A modified i...
138
Voted
IJCNN
2006
IEEE
15 years 6 months ago
2006
IEEE
— We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there...
104
Voted
CADE
2001
Springer
15 years 5 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...