Sciweavers

846 search results - page 25 / 170
» On the Computational Complexity of Spatio-Temporal Logics
Sort
View
100
Voted
CIE
2006
Springer
15 years 1 months ago
From a Zoo to a Zoology: Descriptive Complexity for 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
ACL
2010
14 years 7 months ago
Complexity Assumptions in Ontology Verbalisation
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...
Richard Power
MKWI
2008
190views Business» more  MKWI 2008»
14 years 11 months ago
Partial Matchmaking for complex Product and Service Descriptions
: 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...
Heiner Stuckenschmidt, Martin Kolb
TCS
2008
14 years 9 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
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...
Victor L. Selivanov
COORDINATION
2006
Springer
15 years 1 months ago
A Logical View of Choreography
Abstract. We present a model for choreography `a la WS-CDL and formalize it in DSTL(x), a spatio
Carlo Montangero, Laura Semini