Andrea Calı̀

Computer Science · Physical Sciences

27h-index3.7kcitations165works2.42yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Semantic Web and Ontologies(117), Advanced Database Systems and Queries(99), Data Management and Algorithms(59), Logic, Reasoning, and Knowledge(30), Service-Oriented Architecture and Web Services(18)

Publications165 total

Efficient Ontology-Mediated Query Answering: Extending DL-liteR and Linear ELH
Journal of Artificial Intelligence Research·2025Open Access
Keyword Search in the Deep Web
arXiv (Cornell University)·2025· 2 citedOpen Access
On complexity of restricted fragments of Decision DNNF
arXiv (Cornell University)·2025Open Access
NOTE: non-parametric oversampling technique for explainable credit scoring
Scientific Reports·2024· 8 citedOpen Access
On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF
arXiv (Cornell University)·2024· 2 citedOpen Access
Optimisation Techniques for Flexible SPARQL Queries
ACM Transactions on the Web·2022· 2 cited
“Managing, Mining and Learning in the Legal Data Domain”
Information Systems·2022· 2 cited
Impact of Load Control on Optimal Sizing of Stand-Alone PV Systems
2020
Dynamic Query Optimization under Access Limitations and Dependencies
BIROn (Birkbeck, University of London)·2020· 27 citedOpen Access
Regular resolution for CNFs with almost bounded one-sided treewidth
arXiv (Cornell University)·2019Open Access
Regular resolution for CNF of bounded incidence treewidth with few long clauses.
arXiv (Cornell University)·2019Open Access
Efficient Ontological Query Answering by Rewriting into Graph Queries
Lecture notes in computer science·2019· 4 cited
A Simple Data Structure for Optimal Two-Sided 2D Orthogonal Range Queries
Lecture notes in computer science·2019· 1 cited
Mathematical Theories in the Era of Big Data
Mathematical Problems in Engineering·2019Open Access
Processing SPARQL Queries on Deep Web Sources.
2018
Accessing the Deep Web with Keywords: A Foundational Approach
Lecture notes in computer science·2018· 1 cited
On the complexity of query answering under access limitations: A computational formalism
Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)·2018· 2 cited
IL TAPING NEUROMUSCOLARE NEL TRATTAMENTO DELLA CERVICALGIA DA SPONDILOARTROSI
2018
Non-FPT lower bounds for structural restrictions of decision DNNF
arXiv (Cornell University)·2017· 3 citedOpen Access
Querying and searching the deep web
2017· 2 cited
page 1 of 9Next →

Frequent Co-authors

Georg Gottlob(20), Thomas Lukasiewicz(15), Andréas Pieris(13), Diego Calvanese(11), Giuseppe De Giacomo(8), Maurizio Lenzerini(8), Davide Martinenghi(5), Livia Predoiu(4), Heiner Stuckenschmidt(4), Domenico Lembo(3), Riccardo Rosati(2), Michael Kifer(2), Sauro Succi(2), Roberto Benzi(2), Simona Colucci(2), Tommaso Di Noia(2), Francesco M. Donini(2), Riccardo Frosini(2), Alexandra Poulovassilis(2), Peter T. Wood(2)