700 search results - page 96 / 140 » On Termination of Constraint Logic Programs |
PPDP
2007
Springer
15 years 5 months ago
2007
Springer
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
117
click to vote
COCOS
2003
Springer
15 years 4 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
170
Voted
CC
2009
Springer
15 years 11 months ago
2009
Springer
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...
ENTCS
2000
14 years 11 months ago
2000
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
ACL
2004
15 years 16 days ago
2004
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...