778 search results - page 33 / 156 » Expressiveness and complexity of graph logic |
FSTTCS
2007
Springer
15 years 6 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
102
Voted
CSL
2008
Springer
15 years 2 months ago
2008
Springer
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
105
Voted
CSFW
2008
IEEE
15 years 7 months ago
2008
IEEE
We present an authorization logic that permits reasoning with explicit time. Following a proof-theoretic approach, we study the meta-theory of the logic, including cut elimination...
96
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
CORR
2006
Springer
15 years 15 days ago
2006
Springer
In this paper we present the derivation details, logic, and motivation for the three loop calculus introduced in Chertkov and Chernyak (2006 Phys. Rev. E 73 065102(R)). Generating ...