8094 search results - page 33 / 1619 » Improvements in Formula Generalization |
163
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
AISC
2010
Springer
15 years 2 months ago
2010
Springer
We introduce a new OpenMath content dictionary named “tensor1” containing symbols for the expression of tensor formulas. These symbols support the expression of non-Cartesian ...
DAC
2010
ACM
15 years 1 months ago
2010
ACM
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which...
IWSM
2000
Springer
15 years 1 months ago
2000
Springer
: In this article we present a method for estimating the effort of software projects following an evolutionary, object-oriented development paradigm. Effort calculation is based on...
JCT
2011
14 years 4 months ago
2011
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....