971 search results - page 54 / 195 » Approximate Satisfiability and Equivalence |
AISC
2006
Springer
14 years 1 months ago
2006
Springer
It is an essential step in decomposition algorithms for radical differential ideals to satisfy the so-called Rosenfeld property. Basically all approaches to achieve this step are ...
ACS
2010
13 years 10 months ago
2010
There are infinitely many variants of the notion of Kan fibration that, together with suitable choices of cofibrations and the usual notion of weak equivalence of simplicial sets, ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
ENTCS
2008
13 years 10 months ago
2008
Given a timed automaton with parametric timings, our objective is to describe a procedure for deriving constraints on the parametric timings in order to ensure that, for each valu...