55 search results - page 8 / 11 » Abduction of Linear Arithmetic Constraints |
CP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
ECP
1999
Springer
13 years 11 months ago
1999
Springer
We extend a planning algorithm to cover simple forms of arithmetics. The operator preconditions can refer to the values of numeric variables and the operator postconditions can mod...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
PPDP
2010
Springer
13 years 5 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...