2911 search results - page 128 / 583 » A Logic of Graph Constraints |
107
Voted
FSTTCS
2003
Springer
15 years 5 months ago
2003
Springer
For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products. Furthermore...
105
Voted
ACL
2010
14 years 10 months ago
2010
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
112
Voted
JDA
2010
14 years 7 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
145
click to vote
FUIN
2007
15 years 19 days ago
2007
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
120
Voted
EMMCVPR
2001
Springer
15 years 5 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...