Sciweavers

45 search results - page 8 / 9
» An algorithm for the induction of defeasible logic theories ...
Sort
View
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 5 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
ICDT
2010
ACM
195views Database» more  ICDT 2010»
13 years 9 months ago
Answering Non-Monotonic Queries in Relational Data Exchange
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
André Hernich
SIGMOD
2008
ACM
123views Database» more  SIGMOD 2008»
14 years 5 months ago
SchemaScope: a system for inferring and cleaning XML schemas
We present SchemaScope, a system to derive Document Type Definitions and XML Schemas from corpora of sample XML documents. Tools are provided to visualize, clean, and refine exist...
Geert Jan Bex, Frank Neven, Stijn Vansummeren
PODS
2010
ACM
181views Database» more  PODS 2010»
13 years 10 months ago
Schema design for XML repositories: complexity and tractability
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...
Wim Martens, Matthias Niewerth, Thomas Schwentick
SAC
2008
ACM
13 years 4 months ago
Adding background knowledge to formal concept analysis via attribute dependency formulas
We present a way to add user's background knowledge to formal concept analysis. The type of background knowledge we deal with relates to relative importance of attributes in ...
Radim Belohlávek, Vilém Vychodil