OOIR: Observatory of International Research

Papers

(The TQCC of ACM Transactions on Computational Logic is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-07-01 to 2024-07-01.)

Article	Citations
First-Order Interpretations of Bounded Expansion Classes	16
Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic	14
Principles of KLM-style Defeasible Description Logics	11
A New Perspective on FO Model Checking of Dense Graph Classes	7
Action Logic is Undecidable	7
Unifying Operational Weak Memory Verification: An Axiomatic Approach	7
Verification of Distributed Quantum Programs	6
Slanted Canonicity of Analytic Inductive Inequalities	6
Strategy Logic with Imperfect Information	6
Syntactic Completeness of Proper Display Calculi	5
Applying Visible Strong Equivalence in Answer-Set Program Transformations	5
Non-well-founded Proof Theory of Transitive Closure Logic	5
A Meta-theory for Big-step Semantics	4
Logics with Multiteam Semantics	4
Beyond Uniform Equivalence between Answer-set Programs	3
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions	3
Witnesses for Answer Sets of Logic Programs	3
Testing using CSP Models: Time, Inputs, and Outputs	3
Generalized Realizability and Basic Logic	3
Logics for Temporal Information Systems in Rough Set Theory	3
Precise Subtyping for Asynchronous Multiparty Sessions	3
From 2-Sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics	3
Stratification in Approximation Fixpoint Theory and Its Application to Active Integrity Constraints	3
Modalities and Parametric Adjoints	2
O-Minimal Invariants for Discrete-Time Dynamical Systems	2

Small Circuits and Dual Weak PHP in the Universal Theory of p-time Algorithms	2
Canonisation and Definability for Graphs of Bounded Rank Width	2
Complete Abstractions for Checking Language Inclusion	2
MaxSAT Resolution and Subcube Sums	2
Asynchronous Announcements	2
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic	2
Inference from Visible Information and Background Knowledge	2
Linear Logic Properly Displayed	2
Precise Subtyping for Asynchronous Multiparty Sessions	2
A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types	2
SAT-Inspired Eliminations for Superposition	2
First-order Logic with Connectivity Operators	2
Graphs Identified by Logics with Counting	2
Tractability Frontier of Data Complexity in Team Semantics	2