Sciweavers

8768 search results - page 332 / 1754
» Generalizing the notion of support
Sort
View
DEXA
2009
Springer
109views Database» more  DEXA 2009»
16 years 2 months ago
Inclusion Dependencies in XML: Extending Relational Semantics
In this article we define a new type of integrity constraint in XML, called an XML inclusion constraint (XIND), and show that it extends the semantics of a relational inclusion de...
Michael Karlinger, Millist W. Vincent, Michael Sch...
IWOCA
2009
Springer
123views Algorithms» more  IWOCA 2009»
16 years 2 months ago
Computability of Width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
Petr Skoda
RTA
2009
Springer
16 years 2 months ago
Loops under Strategies
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...
René Thiemann, Christian Sternagel
AINA
2007
IEEE
16 years 1 months ago
The Community Stack: Concept and Prototype
Location awareness and mobility are main factors in pervasive computing. There is a lot of work focusing on develop location aware applications. Generalizing from location awarene...
Tuan Nguyen, Seng Wai Loke, Torab Torabi
RTA
2007
Springer
16 years 1 months ago
A Simple Proof That Super-Consistency Implies Cut Elimination
Abstract. We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-...
Gilles Dowek, Olivier Hermant