Sciweavers

360 search results - page 8 / 72
» Constraint Checking with Partial Information
Sort
View
AMAI
2004
Springer
14 years 29 days ago
Symmetry Breaking in Constraint Satisfaction with Graph-Isomorphism: Comma-Free Codes
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
Justin Pearson
CMS
2006
150views Communications» more  CMS 2006»
13 years 9 months ago
Attribute Delegation Based on Ontologies and Context Information
This paper presents a model for delegation based on partial orders, proposing the subclass relation in OWL as a way to represent the partial orders. Delegation and authorization de...
Isaac Agudo, Javier Lopez, José A. Monteneg...
VLDB
2005
ACM
133views Database» more  VLDB 2005»
14 years 1 months ago
Caching with 'Good Enough' Currency, Consistency, and Completeness
SQL extensions that allow queries to explicitly specify data quality requirements in terms of currency and consistency were proposed in an earlier paper. This paper develops a dat...
Hongfei Guo, Per-Åke Larson, Raghu Ramakrish...
CONCUR
2009
Springer
14 years 2 months ago
Compositional Control Synthesis for Partially Observable Systems
We present a compositional method for deriving control constraints on a network of interconnected, partially observable and partially controllable plant components. The constraint ...
Wouter Kuijper, Jaco van de Pol
SDB
1995
178views Database» more  SDB 1995»
13 years 11 months ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin