6456 search results - page 64 / 1292 » Constraint Solving on Terms |
103
Voted
JGO
2010
14 years 7 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
124
click to vote
AGP
1999
IEEE
15 years 5 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
112
Voted
GLVLSI
2002
IEEE
15 years 5 months ago
2002
IEEE
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...
94
Voted
PPDP
2005
Springer
15 years 6 months ago
2005
Springer
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformati...
107
click to vote
WADT
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...