598 search results - page 49 / 120 » Procedure Based Program Compression |
SIAMJO
2000
13 years 9 months ago
2000
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
ICLP
2009
Springer
14 years 10 months ago
2009
Springer
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We present the basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming langua...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Previous studies on program comprehension were carried out largely in the context of procedural languages. Our purpose is to develop and evaluate a cognitive model of object-orient...
PEPM
2007
ACM
14 years 3 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...