585 search results - page 60 / 117 » Strategy Logic |
132
click to vote
CSL
2007
Springer
15 years 5 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
123
click to vote
FSKD
2006
Springer
15 years 5 months ago
2006
Springer
This paper argues about the deployment positions of Network-based Intrusion Detection System and suggests the "Distributed Network Security Sensors" distributed among the...
115
click to vote
FOIS
2006
15 years 3 months ago
2006
In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theor...
114
click to vote
AICOM
2010
15 years 2 months ago
2010
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
91
Voted
VLSID
2004
IEEE
16 years 2 months ago
2004
IEEE
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...