Log. Methods Comput. sci 2022
Top Research Directions
The 2 research directions with Log. Methods Comput. sci 2022 papers, ranked by paper count. Share is the fraction of the edition’s papers in the direction.
| # | Direction | Papers | Share |
|---|---|---|---|
| 1 | Balancing Logical Expressivity and Computational Tractability | 1 | 50.0% |
| 2 | Conflict Directed Relaxation for Overconstrained Temporal Problems | 1 | 50.0% |
Download all directions as CSV
Institutions
Institutions credited by Log. Methods Comput. sci 2022 papers: a paper credits every institution named in its affiliations, once. 5 institutions share 2 credited papers.
| # | Institution | Papers | Share | 2021 | 2021 rank |
|---|---|---|---|---|---|
| 1 | Masaryk University | 1 | 50.0% | 0 | — |
| 2 | Max Planck Institute for Software Systems | 1 | 50.0% | 0 | — |
| 3 | Middle East Technical University | 1 | 50.0% | 0 | — |
| 4 | Open University of the Netherlands | 1 | 50.0% | 0 | — |
| 5 | The University of Western Australia | 1 | 50.0% | 0 | — |
Download all institutions as CSV
About this data
Papers. Log. Methods Comput. sci 2022 lists 2 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.
Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers.
Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 2 of 2 papers (100.0%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.
Data. Counts come from Lacuna’s data build of 2026-11-19 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “Log. Methods Comput. sci 2022”, https://lacuna.tiptreesystems.com/venue/log-methods-comput-sci-vj97/2022.
Top Authors
| Author | Papers |
|---|---|
| Ebru Aydin Gol | 1 |
Papers
| Title |
|---|
| Quantifying over Boolean announcements |
| Timed Automata Robustness Analysis via Model Checking |