1179 search results - page 160 / 236 » Programming in Hybrid Constraint Languages |
151
click to vote
JMLR
2012
13 years 3 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
188
click to vote
POPL
2011
ACM
14 years 4 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
134
click to vote
ICDCIT
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level du...
225
click to vote
ICLP
2009
Springer
16 years 2 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...
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...