ACM Transactions on Computational Logic

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-11-01 to 2024-11-01.)
ArticleCitations
Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic15
Principles of KLM-style Defeasible Description Logics12
Unifying Operational Weak Memory Verification: An Axiomatic Approach10
Action Logic is Undecidable7
Strategy Logic with Imperfect Information6
Verification of Distributed Quantum Programs6
Slanted Canonicity of Analytic Inductive Inequalities6
Precise Subtyping for Asynchronous Multiparty Sessions5
Syntactic Completeness of Proper Display Calculi5
A Meta-theory for Big-step Semantics4
A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions4
Testing using CSP Models: Time, Inputs, and Outputs4
Logics with Multiteam Semantics4
Beyond Uniform Equivalence between Answer-set Programs3
Logics for Temporal Information Systems in Rough Set Theory3
Witnesses for Answer Sets of Logic Programs3
Display to Labeled Proofs and Back Again for Tense Logics3
Generalized Realizability and Basic Logic3
From 2-Sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics3
Stratification in Approximation Fixpoint Theory and Its Application to Active Integrity Constraints3
First-order Logic with Connectivity Operators3
Linear Logic Properly Displayed3
Tractability Frontier of Data Complexity in Team Semantics3
Parameterized Complexity of Elimination Distance to First-Order Logic Properties2
Asynchronous Announcements2
A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types2
Inference from Visible Information and Background Knowledge2
Complete Abstractions for Checking Language Inclusion2
An Axiomatic Theory for Reversible Computation2
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic2
O-Minimal Invariants for Discrete-Time Dynamical Systems2
Canonisation and Definability for Graphs of Bounded Rank Width2
Local Search For Satisfiability Modulo Integer Arithmetic Theories2
Modalities and Parametric Adjoints2
SAT-Inspired Eliminations for Superposition2
Small Circuits and Dual Weak PHP in the Universal Theory of p-time Algorithms2
Graphs Identified by Logics with Counting2
MaxSAT Resolution and Subcube Sums2
0.026058912277222