8094 search results - page 4 / 1619 » Improvements in Formula Generalization |
DAS
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, a reliable and efficient structural analysis method for mathematical formulae is proposed for practical mathematical OCR. The proposed method consists of three steps...
IPL
2006
13 years 5 months ago
2006
Valiant (1979) proved that every polynomial of formula size e is a projection of the (e + 2)
SAT
2004
Springer
13 years 10 months ago
2004
Springer
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
TACAS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized B¨uchi automaton for the negation of the formula ...
LCTRTS
2007
Springer
13 years 11 months ago
2007
Springer
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...