Pascal Bercher

1.3k total citations
70 papers, 730 citations indexed

About

Pascal Bercher is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Pascal Bercher has authored 70 papers receiving a total of 730 indexed citations (citations by other indexed papers that have themselves been cited), including 64 papers in Artificial Intelligence, 13 papers in Computer Networks and Communications and 10 papers in Computational Theory and Mathematics. Recurrent topics in Pascal Bercher's work include AI-based Problem Solving and Planning (52 papers), Logic, Reasoning, and Knowledge (31 papers) and Semantic Web and Ontologies (24 papers). Pascal Bercher is often cited by papers focused on AI-based Problem Solving and Planning (52 papers), Logic, Reasoning, and Knowledge (31 papers) and Semantic Web and Ontologies (24 papers). Pascal Bercher collaborates with scholars based in Australia, Germany and United States. Pascal Bercher's co-authors include Susanne Biundo, Daniel Höller, Gregor Behnke, Ron Alford, David W. Aha, Bernd Schattenberg, Wolfgang Minker, Florian Nothdurft, Birte Glimm and Felix Richter and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of Artificial Intelligence Research and AI Magazine.

In The Last Decade

Pascal Bercher

66 papers receiving 632 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Pascal Bercher Australia 15 652 115 94 90 84 70 730
Gregor Behnke Germany 15 534 0.8× 105 0.9× 91 1.0× 73 0.8× 73 0.9× 53 591
Daniel Höller Germany 16 496 0.8× 115 1.0× 79 0.8× 69 0.8× 70 0.8× 39 558
Aaron Wilson United States 9 250 0.4× 33 0.3× 48 0.5× 49 0.5× 91 1.1× 16 427
Richard B. Scherl United States 10 955 1.5× 132 1.1× 120 1.3× 48 0.5× 11 0.1× 24 1.0k
Steve Reeves New Zealand 12 303 0.5× 112 1.0× 181 1.9× 21 0.2× 143 1.7× 86 571
Assaf Marron Israel 10 229 0.4× 70 0.6× 105 1.1× 21 0.2× 121 1.4× 47 375
Robert M. Fuhrer United States 14 240 0.4× 129 1.1× 83 0.9× 26 0.3× 174 2.1× 34 597
Steven A. Vere United States 10 513 0.8× 177 1.5× 93 1.0× 50 0.6× 33 0.4× 15 614
Mingwei Tang China 12 274 0.4× 90 0.8× 13 0.1× 216 2.4× 23 0.3× 48 566
Charles Gretton Australia 11 259 0.4× 50 0.4× 65 0.7× 78 0.9× 20 0.2× 30 359

Countries citing papers authored by Pascal Bercher

Since Specialization
Citations

This map shows the geographic impact of Pascal Bercher'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 Pascal Bercher with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pascal Bercher more than expected).

Fields of papers citing papers by Pascal Bercher

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Pascal Bercher. 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 Pascal Bercher. The network helps show where Pascal Bercher may publish in the future.

Co-authorship network of co-authors of Pascal Bercher

This figure shows the co-authorship network connecting the top 25 collaborators of Pascal Bercher. A scholar is included among the top collaborators of Pascal Bercher 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 Pascal Bercher. Pascal Bercher is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bercher, Pascal, et al.. (2024). A Priori Estimation of the Approximation, Optimization and Generalization Errors of Random Neural Networks for Solving Partial Differential Equations. ANU Open Research (Australian National University). 6749–6757. 1 indexed citations
2.
Helmert, Malte, et al.. (2024). On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence. Proceedings of the AAAI Conference on Artificial Intelligence. 38(18). 20203–20211. 1 indexed citations
3.
Bercher, Pascal, et al.. (2023). Can They Come Together? A Computational Complexity Analysis of Conjunctive Possible Effects of Compound HTN Planning Tasks. Proceedings of the International Conference on Automated Planning and Scheduling. 33(1). 314–323. 1 indexed citations
4.
Bercher, Pascal, et al.. (2023). A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements. Proceedings of the International Symposium on Combinatorial Search. 16(1). 65–73. 1 indexed citations
5.
Behnke, Gregor, et al.. (2023). On Total-Order HTN Plan Verification with Method Preconditions – An Extension of the CYK Parsing Algorithm. Proceedings of the AAAI Conference on Artificial Intelligence. 37(10). 12041–12048. 2 indexed citations
6.
Barták, Roman, et al.. (2023). Lessons Learned from the CYK Algorithm for Parsing-based Verification of Hierarchical Plans. SHILAP Revista de lepidopterología. 36.
7.
Barták, Roman, et al.. (2023). On the Impact of Grounding on HTN Plan Verification via Parsing. UvA-DARE (University of Amsterdam). 92–99. 1 indexed citations
8.
Bercher, Pascal, et al.. (2022). Flexible FOND HTN Planning: A Complexity Analysis. Proceedings of the International Conference on Automated Planning and Scheduling. 32. 26–34. 3 indexed citations
9.
Bercher, Pascal. (2021). A Closer Look at Causal Links: Complexity Results for Delete-Relaxation in Partial Order Causal Link (POCL) Planning. Proceedings of the International Conference on Automated Planning and Scheduling. 31. 36–45. 3 indexed citations
10.
Höller, Daniel & Pascal Bercher. (2021). Landmark Generation in HTN Planning. Proceedings of the AAAI Conference on Artificial Intelligence. 35(13). 11826–11834. 6 indexed citations
11.
Bercher, Pascal, et al.. (2021). Hybrid Planning Heuristics Based on Task Decomposition Graphs. Proceedings of the International Symposium on Combinatorial Search. 5(1). 35–43. 10 indexed citations
12.
Höller, Daniel, Gregor Behnke, Pascal Bercher, & Susanne Biundo. (2018). Plan and Goal Recognition as HTN Planning. National Conference on Artificial Intelligence. 21. 466–473. 13 indexed citations
13.
Behnke, Gregor, Benedikt Leichtmann, Pascal Bercher, et al.. (2017). Help me make a dinner! Challenges when assisting humans in action planning. 1–6. 5 indexed citations
14.
Bercher, Pascal, Gregor Behnke, Daniel Höller, & Susanne Biundo. (2017). An Admissible HTN Planning Heuristic. 480–488. 31 indexed citations
15.
Behnke, Gregor, Pascal Bercher, Matthias Kraus, et al.. (2017). Sloth — The interactive workout planner. OPUS (Augsburg University). 1–6. 2 indexed citations
16.
Behnke, Gregor, Pascal Bercher, Matthias Kraus, et al.. (2017). A paradigm for coupling procedural and conceptual knowledge in companion systems. OPUS (Augsburg University). 1819. 1–6. 5 indexed citations
17.
Höller, Daniel, Gregor Behnke, Pascal Bercher, & Susanne Biundo. (2016). Assessing the Expressivity of Planning Formalisms through the Comparison to Formal Languages. Proceedings of the International Conference on Automated Planning and Scheduling. 26. 158–165. 32 indexed citations
18.
Behnke, Gregor, et al.. (2015). Integrating Ontologies and Planning for Cognitive Systems.. Description Logics. 5 indexed citations
19.
Bercher, Pascal & Susanne Biundo. (2012). A Heuristic for Hybrid Planning with Preferences.. The Florida AI Research Society.
20.
Biundo, Susanne, et al.. (2010). Advanced user assistance based on AI planning. Cognitive Systems Research. 12(3-4). 219–236. 27 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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Gregor Behnke Breakdown of academic impact, for papers by Daniel Höller Breakdown of academic impact, for papers by Aaron Wilson Breakdown of academic impact, for papers by Richard B. Scherl Breakdown of academic impact, for papers by Steve Reeves Breakdown of academic impact, for papers by Assaf Marron Breakdown of academic impact, for papers by Robert M. Fuhrer Breakdown of academic impact, for papers by Steven A. Vere Breakdown of academic impact, for papers by Mingwei Tang Breakdown of academic impact, for papers by Charles Gretton
Rankless by CCL
2026