4524 search results - page 158 / 905 » The Complexity of Global Constraints |
109
click to vote
TCS
2010
14 years 11 months ago
2010
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This paper focus...
186
click to vote
ICDE
2005
IEEE
16 years 2 months ago
2005
IEEE
The SQL queries produced in XML-to-SQL query translation are often unnecessarily complex, even for simple input XML queries. In this paper we argue that relational systems can do ...
CP
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
84
Voted
CAV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
133
Voted
CONSTRAINTS
2010
14 years 10 months ago
2010
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...