2911 search results - page 336 / 583 » A Logic of Graph Constraints |
187
click to vote
ENTCS
2008
15 years 6 months ago
2008
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting tha...
163
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We define a multivariate polynomial that generalizes in a unified way the twovariable interlace polynomial defined by Arratia, Bollob´as and Sorkin on the one hand, and a one-...
166
click to vote
JODS
2007
15 years 6 months ago
2007
This paper describes a theoretical framework for inducing knowledge from incomplete data sets. The general framework can be used with any formalism based on a lattice structure. It...
187
click to vote
ECCC
2010
15 years 5 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
189
Voted
TCS
2010
15 years 5 months ago
2010
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...