736 search results - page 103 / 148 » Algorithms for Ordinal Arithmetic |
104
click to vote
ICCAD
1994
IEEE
15 years 4 months ago
1994
IEEE
-- We describe a new high-level compiler called Integral fordesigning system interface modules. The inputis a high-levelconcurrent algorithmic specification that can model complex ...
ICLP
1994
Springer
15 years 3 months ago
1994
Springer
Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by antimonotone FD constraints. We also provide a...
126
click to vote
CAV
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
COCOA
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
126
click to vote
HYBRID
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...