450 search results - page 40 / 90 » Algorithmic uses of the Feferman-Vaught Theorem |
CADE
2005
Springer
14 years 7 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
RTSS
1998
IEEE
13 years 11 months ago
1998
IEEE
In this paper, we derive a statistical delay guarantee of the generalized Virtual Clock scheduling algorithm. We define the concept of an equivalent fluid and packet source and pr...
SARA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
ERSHOV
1989
Springer
13 years 11 months ago
1989
Springer
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...