Sciweavers

955 search results - page 95 / 191
» Tractable Temporal Reasoning
Sort
View
227
Voted
CP
2009
Springer
16 years 4 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
100
Voted
AFRICACRYPT
2008
Springer
15 years 9 months ago
Cryptanalysis of the TRMS Signature Scheme of PKC'05
In this paper, we investigate the security of the Tractable Rationale Maps Signature (TRMS) signature scheme [9] proposed at PKC’05. To do so, we present a hybrid approach for so...
Luk Bettale, Jean-Charles Faugère, Ludovic ...
LICS
2007
IEEE
15 years 9 months ago
Locally Excluding a Minor
We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph clas...
Anuj Dawar, Martin Grohe, Stephan Kreutzer
157
Voted
WWW
2011
ACM
14 years 10 months ago
A better uncle for OWL: nominal schemas for integrating rules and ontologies
We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like“variable nominal classes”within axioms. This feature allows ontology langua...
Markus Krötzsch, Frederick Maier, Adila Krisn...
144
Voted
JACM
2010
116views more  JACM 2010»
15 years 1 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára