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-11-01 to 2024-11-01.)

Article	Citations
Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic	15
Principles of KLM-style Defeasible Description Logics	12
Unifying Operational Weak Memory Verification: An Axiomatic Approach	10
Action Logic is Undecidable	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
Precise Subtyping for Asynchronous Multiparty Sessions	5
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions	4
Testing using CSP Models: Time, Inputs, and Outputs	4
Logics with Multiteam Semantics	4
A Meta-theory for Big-step Semantics	4
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
First-order Logic with Connectivity Operators	3
Linear Logic Properly Displayed	3
Tractability Frontier of Data Complexity in Team Semantics	3
Beyond Uniform Equivalence between Answer-set Programs	3
Logics for Temporal Information Systems in Rough Set Theory	3
Witnesses for Answer Sets of Logic Programs	3
Display to Labeled Proofs and Back Again for Tense Logics	3
Generalized Realizability and Basic Logic	3
An Axiomatic Theory for Reversible Computation	2
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic	2

O-Minimal Invariants for Discrete-Time Dynamical Systems	2
Canonisation and Definability for Graphs of Bounded Rank Width	2
Local Search For Satisfiability Modulo Integer Arithmetic Theories	2
Modalities and Parametric Adjoints	2
SAT-Inspired Eliminations for Superposition	2
Small Circuits and Dual Weak PHP in the Universal Theory of p-time Algorithms	2
Graphs Identified by Logics with Counting	2
MaxSAT Resolution and Subcube Sums	2
Parameterized Complexity of Elimination Distance to First-Order Logic Properties	2
Asynchronous Announcements	2
A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types	2
Inference from Visible Information and Background Knowledge	2
Complete Abstractions for Checking Language Inclusion	2
Satisfiability Problems on Sums of Kripke Frames	1
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas	1
On Proof Complexity of Resolution over Polynomial Calculus	1
Strategic Knowledge Acquisition	1
Mixed Iterated Revisions: Rationale, Algorithms, and Complexity	1
The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games	1
Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions	1
Good-for-Game QPTL: An Alternating Hodges Semantics	1
Algebraic Proof Theory for LE-logics	1
A Subatomic Proof System for Decision Trees	1
Generalizing Parikh’s Criterion for Relevance-Sensitive Belief Revision	1
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics	1
Symmetric Circuits for Rank Logic	1
Eager Equality for Rational Number Arithmetic	1
Extensible Proof Systems for Infinite-State Systems	1
A Formal System for the Universal Quantification of Schematic Variables	1
The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic	1
Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties	1
Local Belief Dynamics in Network Knowledge Bases	1
EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces	1
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation	1
Interpolation in Linear Logic and Related Systems	1
Reasoning about Quality and Fuzziness of Strategic Behaviors	1
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution	1
QCSP on Reflexive Tournaments	1
Reducible Theories and Amalgamations of Models	1
The Complexity of Counting Problems Over Incomplete Databases	1
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator	1