9532 search results - page 267 / 1907 » Logic, Graphs, and Algorithms |
193
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
154
click to vote
FAC
2010
15 years 3 months ago
2010
Separation logic allows simple proofs of concurrent algorithms which use blocking mechanisms such as semaphores. It can even deal with non-blocking algorithms. With the addition of...
164
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
166
click to vote
DMDW
2001
15 years 7 months ago
2001
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...
184
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We present a novel approach to constraintbased causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about ca...