846 search results - page 25 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
123
Voted
CIE
2006
Springer
15 years 4 months ago
2006
Springer
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...
106
Voted
ACL
2010
14 years 10 months ago
2010
We describe the strategy currently pursued for verbalising OWL ontologies by sentences in Controlled Natural Language (i.e., combining generic rules for realising logical patterns...
120
click to vote
MKWI
2008
15 years 2 months ago
2008
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
TCS
2008
15 years 14 days ago
2008
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
83
Voted
COORDINATION
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We present a model for choreography `a la WS-CDL and formalize it in DSTL(x), a spatio