Sciweavers

234 search results - page 6 / 47
» The Complexity of Global Cardinality Constraints
Sort
View
VMCAI
2010
Springer
15 years 7 months ago
Collections, Cardinalities, and Relations
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
Kuat Yessenov, Ruzica Piskac, Viktor Kuncak
SIGMOD
2011
ACM
222views Database» more  SIGMOD 2011»
14 years 19 days ago
Data generation using declarative constraints
We study the problem of generating synthetic databases having declaratively specified characteristics. This problem is motivated by database system and application testing, data ...
Arvind Arasu, Raghav Kaushik, Jian Li
AAAI
2008
15 years 4 days ago
Reasoning with Cardinal Directions: An Efficient Algorithm
Direction relations between extended spatial objects are important commonsense knowledge. Recently, Goyal and Egenhofer proposed a formal model, called Cardinal Direction Calculus...
Xiaotong Zhang, Weiming Liu, Sanjiang Li, Mingshen...
90
Voted
CSFW
2004
IEEE
15 years 1 months ago
The Consistency of Task-Based Authorization Constraints in Workflow Systems
Workflow management systems (WFMSs) have attracted a lot of interest both in academia and the business community. A workflow consists of a collection of tasks that are organized t...
Kaijun Tan, Jason Crampton, Carl A. Gunter
LICS
2010
IEEE
14 years 8 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...