295 search results - page 8 / 59 » Approximating the Expressive Power of Logics in Finite Model... |
197
click to vote
ANCS
2009
ACM
15 years 4 months ago
2009
ACM
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
133
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
This paper presents advances in Set Attributive Logic and its application to develop tabular rule-based systems within the XTT framework. The primary goal is to extend the expressi...
221
click to vote
AIML
2008
15 years 8 months ago
2008
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...
156
click to vote
KBSE
2008
IEEE
16 years 1 months ago
2008
IEEE
Finite state machine-based abstractions of software behaviour are popular because they can be used as the basis for a wide range of (semi-) automated verification and validation ...
166
click to vote
CAAP
1990
15 years 10 months ago
1990
The chief purpose of this paper is to appraise the feasibility of Girard’s linear logic as a specification language for parallel processes. To this end we propose an interpreta...