OOIR: Observatory of International Research

Papers

(The median citation count of ACM Transactions on Computational Logic is 0. 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 2022-06-01 to 2026-06-01.)

Article	Citations
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation	17
On Proof Complexity of Resolution over Polynomial Calculus	14
Reasoning about Quality and Fuzziness of Strategic Behaviors	9
Local Search For Satisfiability Modulo Integer Arithmetic Theories	9
Datalog-Expressibility for Monadic and Guarded Second-Order Logic	8
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions	7
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?	6
Good-for-Game QPTL: An Alternating Hodges Semantics	6
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator	6
Primal Logic of Information	6
Probabilistic Temporal Reasoning Using Superposition Semantics	6
An Abstract Fixed-Point Theorem for Horn Formula Equations	5
Dimensionality and Randomness	5
A Generalized Realizability and Intuitionistic Logic	4
On the Logical and Algebraic Aspects of Reasoning with Formal Contexts	4
Hypothetical Answers to Continuous Queries Over Data Streams	4
Testing using CSP Models: Time, Inputs, and Outputs	4
Counting of Teams in First-Order Team Logics	4
Interval Temporal Logic for Visibly Pushdown Systems	3
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic	3
An Axiomatic Theory for Reversible Computation	3
A Complete Finite Axiomatisation of the Equational Theory of Common Meadows	3
Equations over Finite Monoids with Infinite Promises	3
Precise Subtyping for Asynchronous Multiparty Sessions	3
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas	3

Semantic Analysis of a Linear Temporal Extension of Quantum Logic and Its Dynamic Aspect	3
Model and Program Repair via Group Actions and Structure Unwinding	3
Faster Property Testers in a Variation of the Bounded Degree Model	3
Closing Star-Free Closure	2
Inputs, Outputs, and Composition in the Logic of Information Flows	2
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations	2
Computationally Hard Problems for Logic Programs under Answer Set Semantics	2
Decidability of Graph Neural Networks via Logical Characterizations	2
Spectrum of FO Logic with Quantifier Depth 4 is Finite	2
Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework	2
Reasoning about Parameterized Recursive Quantum Programs with Ancilla Data and Probabilistic Control	2
First-Order Temporal Logic on Finite Traces: Semantic Properties, Decidable Fragments, and Applications	2
The Iteration Number of the Weisfeiler-Leman Algorithm	2
Logics for Temporal Information Systems in Rough Set Theory	2
Unifying Operational Weak Memory Verification: An Axiomatic Approach	1
Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics	1
First-order Logic with Connectivity Operators	1
One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus	1
Cyclic Implicit Complexity	1
Circular (Yet Sound) Proofs in Propositional Logic	1
Intuitionistic Gödel-Löb without Sharps	1
On the Complexity of Model Checking Knowledge and Time	1
On Monotonic Determinacy and Rewritability for Recursive Queries and Views	1
Products, Polynomials and Differential Equations in the Stream Calculus	1
Invariant Checking for SMT-Based Systems with Quantifiers	1
Reactive model-based testing of cyclic systems	1
Canonisation and Definability for Graphs of Bounded Rank Width	1
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity	1
A Reversible Perspective on Petri Nets and Event Structures	1
SAT Modulo Symmetries for Graph Generation and Enumeration	1
Generalizing Parikh’s Criterion for Relevance-Sensitive Belief Revision	0
Solving Promise Equations over Monoids and Groups	0
A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types	0
The Implication Problem for Functional Dependencies and Variants of Marginal Distribution Equivalences	0
Witnesses for Answer Sets of Logic Programs	0
Centralized vs. Decentralized Monitors for Hyperproperties	0
Eager Equality for Rational Number Arithmetic	0
Comparing the Expressiveness of the π-calculus and CCS	0
1 -in- 3 vs . N ot -A ll -E qual	0
Compound Logics for Modification Problems	0
Hypersequent Calculi for Propositional Default Logics	0
Extensions of HyperLTL for Asynchronous Hyperproperties	0
The Complexity of LTL Rational Synthesis	0
Linear Logic Properly Displayed	0
On Composing Finite Forests with Modal Logics	0
Computational Complexity of the Weisfeiler-Leman Dimension	0
Generating Extended Resolution Proofs with a BDD-Based SAT Solver	0
A Subatomic Proof System for Decision Trees	0
SAT-Inspired Eliminations for Superposition	0
MaxSAT Resolution and Subcube Sums	0

Maps between Different Kinds of Two-Level Credibility-Limited Revision Operators	0
Strong Backdoors for Default Logic	0
Syntactic Completeness of Proper Display Calculi	0
A Saturation-Based Unification Algorithm for Higher-Order Rational Patterns	0
Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions	0
History-Deterministic Parikh Automata	0
A Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals	0
Extensible Proof Systems for Infinite-State Systems	0
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution	0
Hybrid-Dynamic Ehrenfeucht-Fraïssé Games	0
Reducible Theories and Amalgamations of Models	0
The Complexity of Resilience Problems via Valued Constraint Satisfaction	0
The Intersection of Algorithmically Random Closed Sets and Effective Dimension	0
Perspective Games	0
The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games	0
The Complexity of Linear Temporal Verification for Continuous Counter Systems	0
Formalising Asynchronous Session Subtyping	0
Quantified Constraint Handling Rules	0
Dependently Typed Higher-Order Logic	0
Homomorphism Preservation Theorems for Many-Valued Structures	0
A Nominal Approach to Equational Problems in Languages with Binders	0
The Reachable Simulation Problem	0
Interpolation in Linear Logic and Related Systems	0
Model-checking Strategic Abilities in Information-sharing Systems	0
A Semantics for Modal Language Using a Rough Set Model Based on Subset Approximation Structure	0
Interpolation Results for Arrays with Length and MaxDiff	0
Mixed Iterated Revisions: Rationale, Algorithms, and Complexity	0
Stackelberg-Pareto Synthesis	0
Characterising Modal Formulas with Examples	0
Fundamental Logic Is Decidable	0
AGM Belief Revision, Semantically	0
Algebraic Proof Theory for LE-logics	0
Counting Reduced Ordered Binary Decision Diagrams with Respect to Size	0
Computing and Certifying Twin-Width Using Logic	0
Continuous One-counter Automata	0
Regular Representations of Uniform TC ⁰	0