OOIR: Observatory of International Research

Papers

(The median citation count of ACM Transactions on Computational Logic is 1. 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-04-01 to 2024-04-01.)

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

Precise Subtyping for Asynchronous Multiparty Sessions	2
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic	2
Small Circuits and Dual Weak PHP in the Universal Theory of p-time Algorithms	2
Stratification in Approximation Fixpoint Theory and Its Application to Active Integrity Constraints	2
Asynchronous Announcements	2
SAT-Inspired Eliminations for Superposition	2
Complete Abstractions for Checking Language Inclusion	2
Tractability Frontier of Data Complexity in Team Semantics	2
Linear Logic Properly Displayed	1
EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces	1
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics	1
Strategic Knowledge Acquisition	1
QCSP on Reflexive Tournaments	1
The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic	1
Good-for-Game QPTL: An Alternating Hodges Semantics	1
Local Belief Dynamics in Network Knowledge Bases	1
A Subatomic Proof System for Decision Trees	1
Graphs Identified by Logics with Counting	1
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions	1
MaxSAT Resolution and Subcube Sums	1
Metric Temporal Description Logics with Interval-Rigid Names	1
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution	1
A Formal System for the Universal Quantification of Schematic Variables	1
Display to Labeled Proofs and Back Again for Tense Logics	1
Reducible Theories and Amalgamations of Models	1
Satisfiability Problems on Sums of Kripke Frames	1
Generalizing Parikh’s Criterion for Relevance-Sensitive Belief Revision	1
First-order Logic with Connectivity Operators	1
Logics for Temporal Information Systems in Rough Set Theory	1
Eager Equality for Rational Number Arithmetic	1
Reasoning about Quality and Fuzziness of Strategic Behaviors	1
The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games	1
Parameterized Complexity of Elimination Distance to First-Order Logic Properties	1
A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types	1
Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties	1
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator	1