778 search results - page 48 / 156 » Expressiveness and complexity of graph logic |
101
click to vote
MST
2008
15 years 14 days ago
2008
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...
104
click to vote
PLILP
1997
Springer
15 years 4 months ago
1997
Springer
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
104
Voted
JOLLI
2006
15 years 14 days ago
2006
We propose a novel interpretation of natural-language questions using a modal predicate logic of knowledge. Our approach brings standard model-theoretic and proof-theoretic techniq...
108
Voted
AAAI
2007
15 years 2 months ago
2007
We propose a framework for multi-issue bilateral negotiation, where issues are expressed and related to each other via Description Logics. Agents’ goals are expressed through (c...
216
click to vote
ICDE
2002
IEEE
16 years 1 months ago
2002
IEEE
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...