Jia-Huai You
About
In The Last Decade
Jia-Huai You
67 papers receiving 440 citations
Peers
Comparison fields: 5 of 41
- Artificial Intelligence 412
- Computational Theory and Mathematics 162
- Computer Networks and Communications 87
- Information Systems 61
- Signal Processing 27
Countries citing papers authored by Jia-Huai You
This map shows the geographic impact of Jia-Huai You'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 Jia-Huai You with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jia-Huai You more than expected).
Fields of papers citing papers by Jia-Huai You
This network shows the impact of papers produced by Jia-Huai You. 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 Jia-Huai You. The network helps show where Jia-Huai You may publish in the future.
Co-authorship network of co-authors of Jia-Huai You
This figure shows the co-authorship network connecting the top 25 collaborators of Jia-Huai You. A scholar is included among the top collaborators of Jia-Huai You 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 Jia-Huai You. Jia-Huai You is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 2 | |
| 3 | On forgetting postulates in answer set programming | 2 |
| 4 | 2 | |
| 5 | 2 | |
| 6 | Loop formulas for logic programs with arbitrary constraint atoms | 6 |
| 7 | Abductive logic programming by nonground rewrite systems | 1 |
| 8 | A generalized gelfond-lifschitz transformation for logic programs with abstract constraints | 9 |
| 9 | 5 | |
| 10 | On the equivalence between answer sets and models of completion for nested logic programs | 6 |
| 11 | 6 | |
| 12 | 9 | |
| 13 | Regular extension semantics and disjunctive Eshghi-Kowalski procedure | 3 |
| 14 | A default interpretation of defeasible network | 4 |
| 15 | 2 | |
| 16 | 5 | |
| 17 | 35 | |
| 18 | Tractable argumentation semantics via iterative belief revision | 2 |
| 19 | Finding the Shortest Path in ESMSS Network. | 0 |
| 20 | 10 |
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.