Bern Martens
Impact in
- Software top 5%
- Software Testing and Debugging Techniques
-
- Formal Methods in Verification
- semigroups and automata theory
Papers in
-
- Logic, programming, and type systems 25
- Logic, Reasoning, and Knowledge 22
- Semantic Web and Ontologies 7
-
- Formal Methods in Verification 18
- Co-authors
- Danny De Schreye (21 shared papers)Michaël Leuschel (9 shared papers)Maurice Bruynooghe (7 shared papers)John P. Gallagher (1 shared paper)Jesper Jørgensen (3 shared papers)Robert Glück (3 shared papers)Morten Heine Sørensen (3 shared papers)Konstantinos Sagonas (3 shared papers)
In The Last Decade
Bern Martens
41 papers receiving 569 citations
Peers
Comparison fields: 5 of 34
- Software 158
- Computational Theory and Mathematics 435
- Artificial Intelligence 557
- Hardware and Architecture 55
- Information Systems 65
Countries citing papers authored by Bern Martens
This map shows the geographic impact of Bern Martens'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 Bern Martens with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bern Martens more than expected).
Fields of papers citing papers by Bern Martens
This network shows the impact of papers produced by Bern Martens. 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 Bern Martens. The network helps show where Bern Martens may publish in the future.
Co-authors
The 18 scholars most cited alongside Bern Martens, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 42 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1998 | 77 | |
| 2 | 1999 | 72 | |
| 3 | 1995 | 59 | |
| 4 | 1992 | 58 | |
| 5 | 1996 | 46 | |
| 6 | 1996 | 32 | |
| 7 | Controlling conjunctive partial deduction of definite logic programs | 1996 | 29 |
| 8 | 1997 | 25 | |
| 9 | 1996 | 24 | |
| 10 | 1995 | 20 | |
| 11 | 1998 | 17 | |
| 12 | 1992 | 17 | |
| 13 | A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs. | 1991 | 14 |
| 14 | 1998 | 13 | |
| 15 | Two semantics for definite meta-programs, using the non-ground representation | 1995 | 12 |
| 16 | Preserving termination of tabled logic programs while unfolding | 1997 | 11 |
| 17 | 1992 | 9 | |
| 18 | 1994 | 8 | |
| 19 | Integrity constraint checking in deductive databases using a rule/goal graph | 1988 | 8 |
| 20 | 1991 | 6 |
About Bern Martens
Bern Martens is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Information Systems, Computer Science Applications and Software, having authored 42 papers that have together received 619 indexed citations. Recurring topics across this work include Logic, programming, and type systems (25 papers), Logic, Reasoning, and Knowledge (22 papers), Formal Methods in Verification (18 papers), Semantic Web and Ontologies (7 papers), Software Testing and Debugging Techniques (4 papers), Teaching and Learning Programming (4 papers), Educational Games and Gamification (3 papers) and Software Engineering Research (3 papers). The work is most often cited by research in Software (158 citations), Computational Theory and Mathematics (435 citations), Artificial Intelligence (557 citations), Hardware and Architecture (55 citations) and Information Systems (65 citations). Bern Martens has collaborated with scholars based in Belgium and Denmark. Frequent co-authors include Danny De Schreye, Michaël Leuschel, Maurice Bruynooghe, John P. Gallagher, Jesper Jørgensen, Robert Glück, Morten Heine Sørensen, Konstantinos Sagonas, Wim Vanhoof and Rainer Manthey. Their work appears in journals such as The Journal of Logic Programming, Lecture notes in computer science, Theoretical Computer Science, ACM Transactions on Programming Languages and Systems and Journal of Automated Reasoning.
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.