Zobrazeno 1 - 10
of 192
pro vyhledávání: '"CALI', Andrea"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Cali, Andrea, Razgon, Igor
We introduce a one-sided incidence tree decomposition of a CNF $\varphi$. This is a tree decomposition of the incidence graph of $\varphi$ where the underlying tree is rooted and the set of bags containing each clause induces a directed path in the t
Externí odkaz:
http://arxiv.org/abs/1905.10867
We give a non-FPT lower bound on the size of structured decision DNNF and OBDD with decomposable AND-nodes representing CNF-formulas of bounded incidence treewidth. Both models are known to be of FPT size for CNFs of bounded primal treewidth. To the
Externí odkaz:
http://arxiv.org/abs/1708.07767
Datalog+/- is a family of ontology languages that combine good computational properties with high expressive power. Datalog+/- languages are provably able to capture the most relevant Semantic Web languages. In this paper we consider the class of wea
Externí odkaz:
http://arxiv.org/abs/1604.06770
When data schemata are enriched with expressive constraints that aim at representing the domain of interest, in order to answer queries one needs to consider the logical theory consisting of both the data and the constraints. Query answering in such
Externí odkaz:
http://arxiv.org/abs/1312.5914
Autor:
Calì, Andrea, Torlone, Riccardo
In data exchange, data are materialised from a source schema to a target schema, according to suitable source-to-target constraints. Constraints are also expressed on the target schema to represent the domain of interest. A schema mapping is the unio
Externí odkaz:
http://arxiv.org/abs/1312.5912
Publikováno v:
Journal of Artificial Intelligence Research, vol. 48, pp. 115-174, 2013
The chase algorithm is a fundamental tool for query evaluation and query containment under constraints, where the constraints are (sub-classes of) tuple-generating dependencies (TGDs) and equality generating depencies (EGDs). So far, most of the rese
Externí odkaz:
http://arxiv.org/abs/1212.3357
Autor:
Cali, Andrea, Martinenghi, Davide
Since Chen's Entity-Relationship (ER) model, conceptual modeling has been playing a fundamental role in relational data design. In this paper we consider an extended ER (EER) model enriched with cardinality constraints, disjointness assertions, and i
Externí odkaz:
http://arxiv.org/abs/1003.3139
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Artificial Intelligence December 2012 193:87-128
