778 search results - page 70 / 156 » Expressiveness and complexity of graph logic |
148
Voted
ICWE
2005
Springer
15 years 10 months ago
2005
Springer
As the Web becomes a platform for implementing complex B2C and B2B applications, there is a need to extend Web conceptual modeling to process-centric applications. In this context,...
162
Voted
WOLLIC
2009
Springer
15 years 11 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
146
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
133
click to vote
LICS
2002
IEEE
15 years 9 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
132
click to vote
TASE
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...