Paper Review Records
All Paper Review Records
12 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.
Refining Gelfond’s Rationality Principle: Towards More Comprehensive Foundational Principles for Answer Set Semantics
Yi-Dong Shen; Thomas EiterShow moreShow less
1. Institute of Software, Chinese Academy of Sciences, Beijing, China; 2. Institute of Logic and Computation, Vienna University of Technology (TU Wien), Vienna, AustriaShow moreShow less
Synchronous Team Semantics for Temporal Logics
Andreas Krebs; Arne Meier; Jonni Virtema; Martin ZimmermannShow moreShow less
1. University of Tübingen, Tübingen, Germany; 2. Institut für Theoretische Informatik, Leibniz Universität Hannover, Hannover, Germany; 3. University of Glasgow, Glasgow, UK; 4. Aalborg University, Aalborg, DenmarkShow moreShow less
Model Checking Probabilistic Operator Precedence Automata
Francesco Pontiggia; Ezio Bartocci; Michele ChiariShow moreShow less
1. Institute of Computer Engineering (E191-01), TU Wien, Vienna, Austria; 2. Institute of Computer Engineering (E191-01), TU Wien, Vienna, Austria and Center for Digital Safety and Security, AIT Austrian Institute of Technology, Vienna, AustriaShow moreShow less
Foundations for an Abstract Proof Theory in the Context of Horn Rules
Tim S. Lyon; Piotr Ostropolski-NalewajaShow moreShow less
1. Technische Universität Dresden, Dresden, Germany; 2. University of Wrocław, Wroclaw, PolandShow moreShow less
A Two-Level Linear Dependent Type Theory
Qiancheng Fu; Hongwei XiShow moreShow less
1. Boston University, Boston, Massachusetts, USAShow moreShow less
Reasoning about Parameterized Recursive Quantum Programs with Ancilla Data and Probabilistic Control
Dominique Unruh; Benoît Valiron; Mingsheng YingShow moreShow less
1. RWTH Aachen University, Aachen, Germany and University of Tartu, Tartu, Estonia; 2. Université Paris-Saclay, CentraleSupélec, Inria, CNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles, Gif-sur-Yvette, France; 3. Centre for Quantum Software and Information, University of Technology Sydney, Broadway, AustraliaShow moreShow less
FAQ
How long does ACM Transactions on Computational Logic take to review a manuscript?
As of 2026-11-16, CrushSCI has 12 complete review records for ACM Transactions on Computational Logic. The fastest paper went from submission to acceptance in 97 days (Refining Gelfond’s Rationality Principle: Towards More Comprehensive Foundational Principles for Answer Set Semantics, received 2026-05-05, accepted 2026-08-10); the slowest took 1114 days. The average is 560.4 days and the median is 556 days.
Expert Matching · Case Demo
Turn Your Submission Goalsinto a Verifiable Journal Plan
Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.
