220 search results - page 22 / 44 » Coq Modulo Theory |
FROCOS
2007
Springer
15 years 1 months ago
2007
Springer
In the last two decades we have witnessed an impressive advance in the efficiency of propositional satisfiability techniques (SAT), which has brought large and previously-intractab...
66
Voted
ENTCS
2008
14 years 9 months ago
2008
We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in so...
JCP
2007
14 years 9 months ago
2007
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
66
Voted
AISC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the desirable functionality of future mathem...
71
Voted
POPL
2010
ACM
15 years 7 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...