30 search results - page 4 / 6 » Extensions of Constraint Solving for Proof Planning |
INFOCOM
2007
IEEE
14 years 2 days ago
2007
IEEE
— We consider the problem of broadcasting a live stream of data in an unstructured network. Broadcasting has been studied extensively for networks with capacity constraints at th...
CAV
2007
Springer
13 years 9 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...
UAI
1998
13 years 7 months ago
1998
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
CRV
2011
IEEE
12 years 5 months ago
2011
IEEE
— Algorithmic problem reduction is a fundamental approach to problem solving in many fields, including robotics. To solve a problem using this scheme, we must reduce the problem...
LICS
2010
IEEE
13 years 4 months ago
2010
IEEE
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...