DocuGuru
ACM

ACM Transactions on Computational Logic Template

Write in a clean editor, then format for ACM Transactions on Computational Logic in one click — DocuGuru applies the official ACM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.

Use this template

About the ACM Transactions on Computational Logic format

ACM Transactions on Computational Logic is a peer-reviewed journal published by ACM, covering Logic, Reasoning, and Knowledge, Logic, programming, and type systems, Formal Methods in Verification. Over its lifetime it has published 806 papers, which have received 19,687 citations.

PublisherACM
Reference styleNumbered (ACM)
Numbered — [1], [2] in the text
[1] Ada Smith, Ben Jones, and Cara Lee. 2023. A representative article title. ACM Transactions on Computational Logic 12, 3, Article 45 (2023).

Formats any DOI in ACM Transactions on Computational Logic style. No sign-up.

Publishes research inLogic, Reasoning, and Knowledge Logic, programming, and type systems Formal Methods in Verification semigroups and automata theory Semantic Web and Ontologies
ISSN1529-3785
Citation impact (2-yr)0.89
h-index70
i10-index366
Top institutions publishing hereCentre National de la Recherche Scientifique
Journal websitetocl.acm.org
You getA submission-ready PDF and the editable LaTeX source — ready to submit.

Papers published in ACM Transactions on Computational Logic per year

44
2014
47
2015
25
2016
37
2017
37
2018
40
2019
25
2020
30
2021
38
2022
24
2023
23
2024
26
2025

Citation impact of ACM Transactions on Computational Logic by publication year

904
2014
614
2015
295
2016
380
2017
256
2018
279
2019
161
2020
71
2021
187
2022
72
2023
41
2024
14
2025

Citations each year’s papers have accumulated so far — the most recent years are still building up.

Most-cited papers in ACM Transactions on Computational Logic

The DLV system for knowledge representation and reasoning

Nicola Leone, Gerald Pfeifer, Wolfgang Faber et al. · 1 Jul 2006

Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows one to express every property of finite structures that is decidable in the complexity class Σ P 2 (NP NP ). Thus, under widely believed assumptions, DLP is strictly more expressive…

1,172 citations Cite SaveGo to paper →
Strongly equivalent logic programs

Vladimir Lifschitz, David Pearce, Agustín Valverde · 1 Oct 2001

A logic program Π 1 is said to be equivalent to a logic program Π 2 in the sense of the answer set semantics if Π 1 and Π 2 have the same answer sets. We are interested in the following stronger condition: for every logic program, Π, Π 1 , ∪ Π has the…

536 citations Cite SaveGo to paper →
Sequential abstract-state machines capture sequential algorithms

Yuri Gurevich · 1 Jul 2000

We examine sequential algorithms and formulate a sequential-time postulate, an abstract-state postulate, and a bounded-exploration postulate . Analysis of the postulates leads us to the notion of sequential abstract-state machine and to the theorem in the title. First we treat sequential algorithms that are deterministic and noninteractive. Then we consider sequential algorithms that may be…

465 citations Cite SaveGo to paper →
Model-checking continuous-time Markov chains

Adnan Aziz, Kumud Sanwal, Vigyan Singhal et al. · 1 Jul 2000

We present a logical formalism for expressing properties of continuous-time Markov chains. The semantics for such properties arise as a natural extension of previous work on discrete-time Markov chains to continuous time. The major result is that the verification problem is decidable; this is shown using results in algebraic and transcendental number theory.

415 citations Cite SaveGo to paper →
Representation results for defeasible logic

Grigoris Antoniou, David P. Billington, Guido Governatori et al. · 1 Apr 2001

The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but efficient formalism for nonmonotonic reasoning based on rules and priorities. The transformations described in this paper have two main benefits: on…

372 citations Cite SaveGo to paper →

ACM Transactions on Computational Logic template — frequently asked questions

How do I write a paper in the ACM Transactions on Computational Logic format?
In DocuGuru you write your manuscript in a normal editor — no LaTeX setup required — and select the ACM Transactions on Computational Logic template. When you export, DocuGuru compiles the paper into the official ACM format and hands you a submission-ready PDF along with the editable LaTeX source.
What reference style does ACM Transactions on Computational Logic use?
ACM Transactions on Computational Logic uses Numbered (ACM) references, shown as numbered [1], [2] markers in the text. DocuGuru formats every in-text citation and the reference list in this exact style automatically. A reference appears like this: [1] Ada Smith, Ben Jones, and Cara Lee. 2023. A representative article title. ACM Transactions on Computational Logic 12, 3, Article 45 (2023).
Do I need to know LaTeX to submit to ACM Transactions on Computational Logic?
No. DocuGuru generates the acmart LaTeX class and compiles the PDF for you in the background, so you get a ACM-ready ACM Transactions on Computational Logic document without writing any LaTeX. If you do want it, the LaTeX source is included in the export.
Can I import an existing draft into the ACM Transactions on Computational Logic template?
Yes. Paste or upload your current manuscript — Word, LaTeX, Markdown, or plain text — and DocuGuru reflows it into the ACM Transactions on Computational Logic format with correct headings, figures, tables, and numbered citations.
What is ACM Transactions on Computational Logic?
ACM journal. It is a engineering and computer science journal, published by ACM.
Can I export a submission-ready ACM Transactions on Computational Logic PDF?
Yes — DocuGuru produces a PDF built with the official ACM Transactions on Computational Logic template (the acmart class) that is ready to submit to ACM, together with the matching LaTeX source files.
How much does the ACM Transactions on Computational Logic template cost?
You can start writing in the ACM Transactions on Computational Logic template for free. Exporting the final submission-ready ACM Transactions on Computational Logic PDF and LaTeX source is part of DocuGuru's paid plans — see the app for current pricing.
Use the ACM Transactions on Computational Logic template