Sciweavers

177 search results - page 15 / 36
» Logical complexity of graphs: a survey
Sort
View
LICS
2002
IEEE
14 years 19 days ago
Monadic Queries over Tree-Structured Data
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
Georg Gottlob, Christoph Koch
MST
2008
141views more  MST 2008»
13 years 7 months ago
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
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...
Johann A. Makowsky
ACID
2006
298views Algorithms» more  ACID 2006»
13 years 9 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
CONCUR
2004
Springer
14 years 1 months ago
Model Checking Restricted Sets of Timed Paths
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
Nicolas Markey, Jean-François Raskin
ML
2006
ACM
143views Machine Learning» more  ML 2006»
13 years 7 months ago
Mathematical applications of inductive logic programming
The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have dri...
Simon Colton, Stephen Muggleton