148 search results - page 3 / 30 » Data Structures with Arithmetic Constraints: A Non-disjoint ... |
CPAIOR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
ESORICS
2010
Springer
13 years 6 months ago
2010
Springer
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...
CP
2008
Springer
13 years 7 months ago
2008
Springer
This paper presents a global constraint that enforces rules written in a language based on arithmetic and first-order logic to hold among a set of objects. In a first step, the rul...
ECIR
2009
Springer
13 years 3 months ago
2009
Springer
Abstract. The structural heterogeneity and complexity of XML repositories makes query formulation challenging for users who have little knowledge of XML. To assist its users, an XM...
FROCOS
2009
Springer
14 years 10 days ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...