This map shows the geographic impact of Sergio Greco's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Sergio Greco with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sergio Greco more than expected).
This network shows the impact of papers produced by Sergio Greco. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Sergio Greco. The network helps show where Sergio Greco may publish in the future.
Co-authorship network of co-authors of Sergio Greco
This figure shows the co-authorship network connecting the top 25 collaborators of Sergio Greco.
A scholar is included among the top collaborators of Sergio Greco based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Sergio Greco. Sergio Greco is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Greco, Sergio, et al.. (2018). An Incremental Approach to Structured Argumentation over Dynamic Knowledge Bases.. Principles of Knowledge Representation and Reasoning. 78–87.12 indexed citations
Greco, Sergio, et al.. (2015). Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015. International Joint Conference on Artificial Intelligence.50 indexed citations
6.
Greco, Sergio, et al.. (2015). Checking Termination of Datalog with Function Symbols Through Linear Constraints.. Edinburgh Research Explorer (University of Edinburgh). 192–199.1 indexed citations
7.
Greco, Sergio, et al.. (2015). Rewriting-based Check of Chase Termination. Institutional Research Information System (Università degli Studi di Trento).
8.
Greco, Sergio, et al.. (2015). Logic program termination analysis using atom sizes. Institutional Research Information System (Università degli Studi di Trento). 2833–2839.2 indexed citations
9.
Greco, Sergio, Cristian Molinaro, & Irina Trubitsyna. (2013). Bounded programs: a new decidable class of logic programs with function symbols. International Joint Conference on Artificial Intelligence. 926–931.5 indexed citations
Garro, Alfredo, et al.. (2008). Smart Agents and Smart Environments: a Predictive Approach to Replanning. 8. 7–12.1 indexed citations
12.
Gullo, Francesco, Giovanni Ponti, Andrea Tagarelli, & Sergio Greco. (2007). Accurate and Fast Similarity Detection in Time Series.. SEBD. 172–183.1 indexed citations
13.
Caroprese, Luciano, Sergio Greco, & Ester Zumpano. (2006). A Logic Programming Approach to Querying and Integrating P2P Deductive Databases.. The Florida AI Research Society. 31–36.10 indexed citations
Greco, Sergio, Elio Masciari, & Luigi Pontieri. (2001). Combining inductive and deductive tools for data analysis. AI Communications. 14(2). 69–82.10 indexed citations
17.
Greco, Sergio. (1998). Binding Propagation in Disjunctive Databases. Very Large Data Bases. 287–298.4 indexed citations
18.
Greco, Sergio. (1996). Extending Datalog with Choice and Weak Constraints.. 329–340.2 indexed citations
19.
Greco, Sergio, Domenico Saccà, & Carlo Zaniolo. (1993). Dynamic programming optimization for logic queries with aggregates. International Conference on Logic Programming. 575–589.2 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.