Get an email when this journal's indexing changes
Added to or removed from Scopus, Web of Science, ABDC, DOAJ, FT50, UT Dallas or ONOS. One confirmation click; unsubscribe anytime.
Theory and Practice of Logic Programming is Scopus-indexed (Q1, CiteScore 5.7), WoS SCIE. It is covered by India's One Nation One Subscription scheme for reading access. Published by Cambridge University Press.
Checked against the index lists dated .
ISSN 1471-0684Verify ISSN ↗1475-3081Verify ISSN ↗
Publisher: Cambridge University Press
Cost to publish: About US$3,550 to publish open access (publisher list price, via OpenAlex) — subscription publishing may be free
| Subject area | Rank | Pctile | Q |
|---|---|---|---|
| Computational Theory and Mathematics | 41 / 203 | 80th | Q1 |
| Theoretical Computer Science | 34 / 135 | 75th | Q1 |
| Artificial Intelligence | 192 / 570 | 66th | Q2 |
| Hardware and Architecture | 84 / 245 | 65th | Q2 |
| Software | 178 / 503 | 64th | Q2 |
Not listed in: DOAJ, ABDC, ABS / AJG, FT50, UT Dallas, ONOS (APC covered)
Yes — actively indexed in Scopus, coverage 2001–present, best quartile Q1, CiteScore 5.7.
Theory and Practice of Logic Programming is Q1 in Computational Theory and Mathematics (rank 41 of 203), Q1 in Theoretical Computer Science (rank 34 of 135) and Q2 in Artificial Intelligence (rank 192 of 570), by CiteScore 2025. It is ranked in 5 subject areas in all.
Theory and Practice of Logic Programming is indexed in the Science Citation Index Expanded, so it may have a Journal Impact Factor in Clarivate's Journal Citation Reports. JCR is paid, so check it for the current value. The closest free measure is its Scopus CiteScore 5.7, which places it in quartile Q1 at the 80th percentile of its subject. Its SCImago Journal Rank (SJR, a free Scopus-based metric) is 0.578, quartile Q2, with an H-index of 54.
The publisher lists an article processing charge of about US$3,550 for open access (source: OpenAlex). Many journals also publish by the subscription route at no cost to the author, so confirm on the journal's own website.
Theory and Practice of Logic Programming is published by Cambridge University Press. Its print ISSN is 1471-0684 and its online ISSN is 1475-3081.
Yes. It is part of the One Nation One Subscription (ONOS) national subscription, so readers at participating Indian institutions get its full text. ONOS does not cover its article processing charge.
Yes — indexed in the Science Citation Index Expanded.
No — it is not registered as an open-access journal in DOAJ or Scopus.
Theory and Practice of Logic Programming has an h-index of 53 and a 2-year mean of 0.89 citations per paper (OpenAlex). Its Scopus CiteScore is 5.7, quartile Q1. On 2-year citations it ranks #109 of 178 Scopus journals in Computational Theory and Mathematics.
Theory and Practice of Logic Programming published 44 papers in 2025; its busiest recent year was 2019 with 55. 2026* is the year so far.
h-index, i10-index and 2-year mean citedness are open, licence-clear metrics from OpenAlex — not a proprietary impact factor. The subject rank counts only journals that OpenAlex has a figure for; it is not a Scopus or Clarivate ranking. Updated 2026-10-14.
In its latest 100 research articles (2024–2026), authors are most often from Italy (22.5%), Germany (14.4%) and United States (13.9%).
Countries are counted fractionally, so a paper by authors from two countries counts half to each.
Scopus status: Active. No retracted papers are recorded. The Problematic Paper Screener flags none of its papers. These are indicators to check, not findings against the journal.
Retractions from OpenAlex; flags from the Problematic Paper Screener (Cabanac, Labbé & Magazinov, CC BY), 2026-09-21 export. A flag marks a paper for a closer look; it is not a finding against the journal.
Index data is curated from public sources (Scopus, Web of Science, ABDC, FT50, UT Dallas, DOAJ). CiteScore and quartiles reflect the latest available Scopus release. Always verify a journal's current status on its official source before submitting.
Comments load as you scroll here.