2911 search results - page 175 / 583 » A Logic of Graph Constraints |
ICCS
2005
Springer
15 years 6 months ago
2005
Springer
A main feature of many logics used in computer science is a means to express quantification. Usually, syntactical devices like variables and quantifiers are used for this purpose...
98
Voted
CORR
2007
Springer
15 years 24 days ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
103
click to vote
IPMU
2010
Springer
15 years 2 months ago
2010
Springer
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
CP
2000
Springer
15 years 5 months ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
125
click to vote
CONSTRAINTS
2006
15 years 26 days ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...