783 search results - page 140 / 157 » Compositional Reasoning in Model Checking |
154
Voted
ICUIMC
2009
ACM
16 years 27 days ago
2009
ACM
Although documents have hundreds of thousands of unique words, only a small number of words are significantly useful for intelligent services. For this reason, feature extraction ...
173
Voted
LICS
2008
IEEE
16 years 23 days ago
2008
IEEE
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
138
Voted
CSL
2007
Springer
16 years 16 days ago
2007
Springer
Existing definitions of the relativizations of NC1 , L and NL do not preserve the inclusions NC1 ⊆ L, NL ⊆ AC1 . We start by giving the first definitions that preserve them....
196
Voted
LPAR
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...
180
Voted
OTM
2007
Springer
16 years 15 days ago
2007
Springer
Semantic Business Process Management (SBPM) has been proposed as an extension of BPM with Semantic Web and Semantic Web Services (SWS) technologies in order to increase and enhance...