Sciweavers

903 search results - page 99 / 181
» Completeness Results for Memory Logics
Sort
View
SCL
2010
114views more  SCL 2010»
13 years 3 months ago
Input-state incidence matrix of Boolean control networks and its applications
The input-state incidence matrix of control Boolean network is proposed. It is shown that this matrix contains complete information of the input-state mapping. Using it, an easily...
Yin Zhao, Hongsheng Qi, Daizhan Cheng
CALCO
2009
Springer
133views Mathematics» more  CALCO 2009»
14 years 3 months ago
Stone Duality and the Recognisable Languages over an Algebra
Abstract. This is a theoretical paper giving the extended Stone duality perspective on the recently discovered connection between duality theory as studied in non-classical logic a...
Mai Gehrke
SFM
2007
Springer
107views Formal Methods» more  SFM 2007»
14 years 3 months ago
A Survey of Markovian Behavioral Equivalences
Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches ...
Marco Bernardo
AAAI
1990
13 years 10 months ago
The Complexity of Closed World Reasoning and Circumscription
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
Marco Cadoli, Maurizio Lenzerini
VISUALIZATION
1997
IEEE
14 years 1 months ago
Application-controlled demand paging for out-of-core visualization
In the area of scientific visualization, input data sets are often very large. In visualization of Computational Fluid Dynamics (CFD) in particular, input data sets today can surp...
Michael Cox, David Ellsworth