8094 search results - page 2 / 1619 » Improvements in Formula Generalization |
AMAI
2005
Springer
13 years 4 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
IWSEC
2010
Springer
13 years 2 months ago
2010
Springer
We use two parametrizations of points on elliptic curves in generalized Edwards form x2 + y2 = c2 (1 + dx2 y2 ) that omit the xcoordinate. The first parametrization leads to a diff...
VMCAI
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present an analysis to verify abstract set specifications for programs that use object field values to determine the membership of objects in abstract sets. In our a...
CAV
2010
Springer
13 years 7 months ago
2010
Springer
Systems ought to behave reasonably even in circumstances that are not anticipated in their specifications. We propose a definition of robustness for liveness specifications which p...
AMAI
2006
Springer
13 years 4 months ago
2006
Springer
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...