632 search results - page 42 / 127 » Proving Invariants of Functional Programs |
130
Voted
CONSTRAINTS
2008
15 years 20 days ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
89
Voted
AISC
2004
Springer
15 years 6 months ago
2004
Springer
Term equations involving individual and sequence variables and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A sequence variabl...
89
Voted
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
97
Voted
AAAI
2006
15 years 2 months ago
2006
While computers have defeated the best human players in many classic board games, progress in Go remains elusive. The large branching factor in the game makes traditional adversar...
126
click to vote
ECOOP
2010
Springer
15 years 3 months ago
2010
Springer
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...