96 search results - page 4 / 20 » Testing Monotonicity |
MFCS
2005
Springer
14 years 28 days ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
APPROX
2004
Springer
14 years 26 days ago
2004
Springer
In standard property testing, the task is to distinguish between objects that have a property P and those that are ε-far from P, for some ε > 0. In this setting, it is perfec...
ICESS
2004
Springer
14 years 25 days ago
2004
Springer
An integrated solution to guarantee real-time requirements in embedded real-time monitor and control systems is presented in this paper. First l task model is abstracted from such ...
FLAIRS
2006
13 years 8 months ago
2006
The inherent vagueness and ambiguity of non-monotonic reasoning makes it impossible to formulate detailed specifications to validate KBS performance by using traditional test-case...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...