9 citations · 12 across the 2 of their papers we have counts for
3 papers
cs.DB2025★ 9 cited
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…
cs.CC2025
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.…
cs.AI2017★ 3 cited
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…