886 search results - page 68 / 178 » Reasoning with contextual graphs |
121
click to vote
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
144
Voted
ENTCS
2006
15 years 4 months ago
2006
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
169
click to vote
ASP
2003
Springer
15 years 9 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
118
click to vote
ECEASST
2008
15 years 4 months ago
2008
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...
139
click to vote
FLAIRS
2007
15 years 6 months ago
2007
We are working on a project aimed at building next generation analyst support tools that focus analysts’ attention on the most critical and novel information found within the da...