232 citations · 250 across the 9 of their papers we have counts for
9 papers
Keyword Search in the Deep Web
Andrea Calì, Davide Martinenghi, Riccardo Torlone
The Deep Web is constituted by data that are accessible through Web pages, but not readily indexable by search engines as they are returned in dynamic pages. In this paper we propo…
On complexity of restricted fragments of Decision DNNF
Andrea Calí, Igor Razgon
Decision \textsc{dnnf} (a.k.a. -\textsc{fbdd}) is an important special case of Decomposable Negation Normal Form (\textsc{dnnf}), a landmark knowledge compilation model.…
Regular resolution for CNFs with almost bounded one-sided treewidth
Andrea Cali, Igor Razgon
We introduce a one-sided incidence tree decomposition of a CNF . This is a tree decomposition of the incidence graph of where the underlying tree is rooted and the set of ba…
Non-FPT lower bounds for structural restrictions of decision DNNF
Andrea Calì, Florent Capelli, Igor Razgon
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…
A Hybrid Approach to Query Answering under Expressive Datalog+/-
Mostafa Milani, Andrea Cali, Leopoldo Bertossi
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 relev…
Deep Separability of Ontological Constraints
Andrea Calì, Marco Console, Riccardo Frosini
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 con…
Containment of Schema Mappings for Data Exchange (Preliminary Report)
Andrea Calì, Riccardo Torlone
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 sc…
Taming the Infinite Chase: Query Answering under Expressive Integrity Constraints
Andrea Cali, Georg Gottlob, Michael Kifer
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 (TG…
Querying Incomplete Data over Extended ER Schemata
Andrea Cali, Davide Martinenghi
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…