778 search results - page 73 / 156 » Expressiveness and complexity of graph logic |
114
Voted
EUSFLAT
2009
14 years 10 months ago
2009
This paper demonstrates that several known sequence kernels can be expressed in a unified framework in which the position specificity is modeled by fuzzy equivalence relations. In ...
99
Voted
FORTE
1994
15 years 1 months ago
1994
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...
120
Voted
CONCUR
2006
Springer
15 years 4 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
121
Voted
FOCS
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
110
Voted
WOLLIC
2010
Springer
15 years 5 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...