6562 search results - page 57 / 1313 » Noetherianity and Combination Problems |
95
Voted
ICCAD
2006
IEEE
15 years 9 months ago
2006
IEEE
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
141
Voted
FROCOS
2009
Springer
15 years 7 months 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...
AIRS
2008
Springer
15 years 7 months ago
2008
Springer
We present a novel approach that transforms the weighting task to a typical coarse-grained classification problem, aiming to assign appropriate weights for candidate expansion term...
101
Voted
CICLING
2007
Springer
15 years 7 months ago
2007
Springer
One major problem of state-of-the-art Cross Language Question Answering systems is the translation of user questions. This paper proposes combining the potential of multiple transl...
111
Voted
VMCAI
2007
Springer
15 years 6 months ago
2007
Springer
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...