Sciweavers

48 search results - page 2 / 10
» Interpolant-Based Transition Relation Approximation
Sort
View
DLT
2007
13 years 6 months ago
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
Hermann Gruber, Markus Holzer
CAV
2012
Springer
222views Hardware» more  CAV 2012»
11 years 7 months ago
Leveraging Interpolant Strength in Model Checking
Craig interpolation is a well known method of abstraction successfully used in both hardware and software model checking. The logical strength of interpolants can affect the quali...
Simone Fulvio Rollini, Ondrej Sery, Natasha Sharyg...
EUSFLAT
2007
175views Fuzzy Logic» more  EUSFLAT 2007»
13 years 6 months ago
Finding Close T-indistinguishability Operators to a Given Proximity
Two ways to approximate a proximity relation R (i.e. a reflexive and symmetric fuzzy relation) by a T-transitive one where T is a continuous archimedean t-norm are given. The fi...
Luis Garmendia, Jordi Recasens
EUSFLAT
2001
108views Fuzzy Logic» more  EUSFLAT 2001»
13 years 6 months ago
Approximate equality is no fuzzy equality
We argue that fuzzy equivalences, and in particular fuzzy equalities, in general are not suitable to model approximate equality due to the notion of transitivity. Using them for t...
Martine De Cock, Etienne E. Kerre
CISS
2010
IEEE
12 years 8 months ago
Turbo reconstruction of structured sparse signals
—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by h...
Philip Schniter