ISSN: 1529-3785

Journal Home

Journal Guideline

ACM Transactions on Computational Logic Q1 Unclaimed

Association for Computing Machinery (ACM) United States

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

ACM Transactions on Computational Logic is a journal indexed in SJR in Computational Mathematics and Computer Science (miscellaneous) with an H index of 51. It has an SJR impact factor of 0,618 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 0,618.

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy:

Type of publications:

Publication frecuency: -

Categories: Logic (Q1) Computational Mathematics (Q2) Computer Science (miscellaneous) (Q2) Theoretical Computer Science (Q2)

Price

- €

Inmediate OA

NPD

Embargoed OA

- €

Non OA

Metrics

0,618

SJR Impact factor

51

H Index

27

Total Docs (Last Year)

76

Total Docs (3 years)

1031

Total Refs

106

Total Cites (3 years)

76

Citable Docs (3 years)

1.4

Cites/Doc (2 years)

38.19

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

SIAM Review Q1
Bioinformatics Q1
Wiley Interdisciplinary Reviews: Computational Molecular Science Q1
Genomics, Proteomics and Bioinformatics Q1
SIAM Journal on Mathematical Analysis Q1

Compare this journals

Aims and Scope

Best articles by citations

The Probability of a Computable Output from a Random Oracle

Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting andlambda-calculus

Reasoning with recursive loops under the PLP framework

First-order queries on structures of bounded degree are computable with constant delay

Horn Fragments of the Halpern-Shoham Interval Temporal Logic

Three syntactic theories for combinatory graph reduction

The axiomatic translation principle for modal logic

Bounds on the automata size for Presburger arithmetic

Limiting Until in Ordered Tree Query Languages

A First-order Logic for Reasoning about Knowledge and Probability

Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic

DL-Lite Ontology Revision Based on An Alternative Semantic Characterization

SHOW MORE ARTICLES

Probabilistic interval XML

Editorial

A sequent calculus and a theorem prover for standard conditional logics

The Power of the Weak

On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances

Flat and one-variable clauses

Sequent calculi for propositional nonmonotonic logics

Monodic temporal resolution

A SAT Approach to Clique-Width

Collapsible Pushdown Automata and Recursion Schemes

Computational Complexity Via Finite Types

Algebra, proof theory and applications for an intuitionistic logic of propositions, actions and adjoint modal operators