3229 search results - page 280 / 646 » The Theory of Timed Automata |
197
click to vote
AAAI
2008
15 years 9 months ago
2008
Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain...
211
click to vote
ENTCS
2008
15 years 6 months ago
2008
The type theory P corresponds to the logical framework LF. In this paper we present H, a variant of P where convertibility is not implemented by means of the customary conversion ...
172
click to vote
FORMATS
2010
Springer
15 years 4 months ago
2010
Springer
SMT solvers have traditionally been based on the DPLL(T) algorithm, where the driving force behind the procedure is a DPLL search over truth valuations. This traditional framework ...
252
click to vote
AAAI
2012
13 years 9 months ago
2012
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
150
click to vote
TON
2002
15 years 6 months ago
2002
The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket cont...