778 search results - page 31 / 156 » Expressiveness and complexity of graph logic |
108
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
106
Voted
AAAI
2007
15 years 2 months ago
2007
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large a...
135
Voted
AIML
2008
15 years 1 months ago
2008
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...
STOC
2009
ACM
16 years 1 months ago
2009
ACM
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
124
Voted
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...