778 search results - page 101 / 156 » Expressiveness and complexity of graph logic |
98
Voted
UAI
2008
15 years 1 months ago
2008
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabi...
124
click to vote
SIGSOFT
2007
ACM
16 years 1 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
170
click to vote
SIGMOD
2008
ACM
16 years 18 days ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
143
Voted
CI
2000
15 years 8 days ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
76
Voted
DAC
2009
ACM
16 years 1 months ago
2009
ACM
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...