778 search results - page 121 / 156 » Expressiveness and complexity of graph logic |
AI
2008
Springer
15 years 17 days ago
2008
Springer
It is well known that classical set theory is not expressive enough to adequately model categorization and prototype theory. Recent work on compositionality and concept determinat...
BMCBI
2008
15 years 16 days ago
2008
Background: Microarray experiments generate vast amounts of data. The functional context of differentially expressed genes can be assessed by querying the Gene Ontology (GO) datab...
104
click to vote
ICSE
2008
IEEE-ACM
16 years 15 days ago
2008
IEEE-ACM
This paper examines the suitability and use of runtime verification as means for monitoring security protocols and their properties. In particular, we employ the runtime verificat...
112
Voted
PAPM
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. This paper reports on the implementation and the experiments with symbolic model checking of continuous-time Markov chains using multi-terminal binary decision diagrams (...
114
click to vote
ISSTA
2000
ACM
15 years 4 months ago
2000
ACM
—Network protocols are often analyzed using simulations. We demonstrate how to extend such simulations to check propositions expressing safety properties of network event traces ...