778 search results - page 74 / 156 » Expressiveness and complexity of graph logic |
88
Voted
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
101
click to vote
ICALP
2009
Springer
15 years 5 months ago
2009
Springer
We consider an extension of the guarded fragment in which one can guard quanti ers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
100
click to vote
ACSAC
2003
IEEE
15 years 5 months ago
2003
IEEE
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
106
Voted
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
106
Voted
LICS
1994
IEEE
15 years 4 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...