778 search results - page 30 / 156 » Expressiveness and complexity of graph logic |
173
click to vote
SIGMOD
2005
ACM
16 years 19 days ago
2005
ACM
The description, composition, and execution of even logically simple scientific workflows are often complicated by the need to deal with "messy" issues like heterogeneou...
121
click to vote
IANDC
2011
14 years 7 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
ESWS
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we propose an approach to semantic matchmaking that exploits various knowledge representation technologies to find most promising partners in peer-to-peer e-marketpl...
CIE
2008
Springer
15 years 17 days ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
125
Voted
DALT
2009
Springer
15 years 3 months ago
2009
Springer
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...