778 search results - page 43 / 156 » Expressiveness and complexity of graph logic |
141
click to vote
TACAS
1997
Springer
15 years 8 months ago
1997
Springer
We present a highly polymorphic tool for the construction, synthesis, structuring, manipulation, investigation, and (symbolic) execution of graphs. The exibility of this tool, whic...
125
click to vote
PODS
1999
ACM
15 years 9 months ago
1999
ACM
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
125
click to vote
ICCS
2005
Springer
15 years 10 months ago
2005
Springer
A main feature of many logics used in computer science is a means to express quantification. Usually, syntactical devices like variables and quantifiers are used for this purpose...
137
click to vote
JCSS
2000
15 years 4 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
117
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...