778 search results - page 37 / 156 » Expressiveness and complexity of graph logic |
132
click to vote
VLDB
1989
ACM
15 years 8 months ago
1989
ACM
Graphical Direct Manipulation (GrDM) query languagesare characterized and positioned with respect to traditional textual query languages. After a brief survey of the current state...
133
Voted
ICALP
1995
Springer
15 years 8 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
152
click to vote
ACSC
2006
IEEE
15 years 10 months ago
2006
IEEE
Trust networks consist of transitive trust relationships between people, organisations and software agents connected through a medium for communication and interaction. By formali...
122
Voted
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
114
click to vote
LICS
2008
IEEE
15 years 11 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...