778 search results - page 36 / 156 » Expressiveness and complexity of graph logic |
90
Voted
COMBINATORICS
2002
15 years 9 days ago
2002
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...
133
Voted
CONCUR
2011
Springer
14 years 9 days ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
121
click to vote
CORR
2010
Springer
15 years 18 days ago
2010
Springer
Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-d...
113
click to vote
IJCAI
2003
15 years 1 months ago
2003
Motivated by medical terminology applications, we investigate the decidability of the well known expressive DL, SHIQ, extended with role inclusion axioms (RIAs) of the form R ◦ ...
182
click to vote
ARC
2011
Springer
14 years 7 months ago
2011
Springer
In this paper, we propose a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert regular expr...