Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 114

The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.

Neural, symbolic and neural-symbolic reasoning on knowledge graphs

Zhang, Jing, Chen, Bo, Zhang, Lingxi, Ke, Xirui, Ding, Haipeng · 2021 · AI Open

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.aiopen.2021.03.001

Cites

36 of 36 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 36 references

Research works printed but not linked: 34

  1. Bryant, 1986, Graph-based algorithms for boolean function manipulation, Comput. IEEE Trans., 100, 677, 10.1109/TC.1986.1676819 · DOI · Paper page
  2. Chen, 2016, Scalekb: scalable learning and inference over large knowledge bases, VLDB J., 25, 893, 10.1007/s00778-016-0444-3 · DOI
  3. Clark, 1989, The cn2 induction algorithm, Mach. Learn., 3, 261, 10.1023/A:1022641700528 · doi:10.1023/a:1022641700528 · Paper page
  4. Cui, 2017, Learning question answering over qa corpora and knowledge bases, Proc. VLDB Endow., 10, 565, 10.14778/3055540.3055549 · DOI · Paper page
  5. Cussens, 2001, Parameter estimation in stochastic logic programs, Mach. Learn., 44, 245, 10.1023/A:1010924021315 · DOI
  6. de Penning, 2011, A neural-symbolic cognitive agent for online learning and reasoning, vol. 2, 1653
  7. Dhingra, 2002, vol. 10640, 2020
  8. Galárraga, 2015, Fast rule mining in ontological knowledge bases with amie, VLDB J., 24, 707, 10.1007/s00778-015-0394-1 · DOI · Paper page
  9. Gallant, 1988, Connectionist expert systems, Commun. ACM, 31, 152, 10.1145/42372.42377 · DOI · Paper page
  10. Gormley, 2015, Approximation-aware dependency parsing by belief propagation, Trans. Assoc. Comput. Linguistics (TACL), 3, 489, 10.1162/tacl_a_00153 · DOI
  11. Hinton, 2006, A fast learning algorithm for deep belief nets, Neural Comput., 18, 1527, 10.1162/neco.2006.18.7.1527 · DOI · Paper page
  12. Jha, 2012, Probabilistic databases with markoviews, Proc. VLDB Endowment, 5, 10.14778/2350229.2350236 · DOI
  13. Ji, 2015, Knowledge graph embedding via dynamic mapping matrix, vol. 1, 687
  14. Jiang, 2019, Adaptive convolution for multi-relational learning, vol. 1, 978
  15. Klein, 2003, Accurate unlexicalized parsing, vol. 1, 423
  16. Lao, 2010, Relational retrieval using a combination of path-constrained random walks, Mach. Learn., 81, 53, 10.1007/s10994-010-5205-8 · DOI · Paper page
  17. Lehmann, 2015, vol. 6, 167
  18. Li, 2006, One-shot learning of object categories, IEEE Trans. Pattern Anal. Mach. Intell., 28, 594, 10.1109/TPAMI.2006.79 · DOI · Paper page
  19. Liu, 2017, Analogical inference for multi-relational embeddings, vol. 70, 2168
  20. Neelakantan, 2015, Compositional vector space models for knowledge base inference, vol. 1, 156
  21. Nickel, 2011, A three-way model for collective learning on multi-relational data, vol. 11, 809
  22. G. Niu, B. Li, Y. Zhang, Y. Sheng, C. Shi, J. Li, and S. Pu. Joint Semantics and Data-Driven Path Representation for Knowledge Graph Inference. ArXiv, abs/2010.02602, 2020. · arXiv
  23. Pedoe, 2010, True knowledge: open-domain question answering using structured knowledge and inference, AI Mag., 31, 80
  24. Plotkin, 1970, A note on inductive generalization, Mach. Intell., 5, 153
  25. Plotkin, 1971, A further note on inductive generalization, Mach. Intell., 6, 248
  26. Shavlik, 1991, Symbolic and neural learning algorithms: an experimental comparison, Mach. Learn., 6, 111, 10.1023/A:1022602303196 · doi:10.1023/a:1022602303196 · Paper page
  27. Towell, 1994, Knowledge-based artificial neural networks, Artif. Intell., 70, 119, 10.1016/0004-3702(94)90105-8 · DOI · Paper page
  28. Towell, 1994, Refining symbolic knowledge using neural networks, Mach. Learn.: Multistrategy Approach, 4, 405
  29. Trouillon, 2016, Complex embeddings for simple link prediction, Proc. 33nd Int. Conf. Mach. Learn., 48, 2071
  30. Vu, 2019, A capsule network-based embedding model for knowledge graph completion and search personalization, vol. 1, 2180
  31. Yang, 2015, S-MART: novel tree-based structured learning algorithms applied to tweet entity linking, vol. 1, 504
  32. Yang, 2017, Differentiable learning of logical rules for knowledge base reasoning, vol. 30, 2319
  33. You, 2020, Graph contrastive learning with augmentations, Adv. Neural Inf. Process. Syst., 33
  34. Zheng, 2018, Question answering over knowledge graphs: question understanding via template decomposition, Proc. VLDB Endowment, 11, 1373, 10.14778/3236187.3236192 · doi:10.14778/3236187.3236192

Cited by

See all 114

Metadata

Authors
Zhang, J., Chen, B., Zhang, L., Ke, X., & Ding, H.
Venue
AI Open
Publisher
Elsevier BV
Published
2021
Volume
2
Pages
14-35
ISSN
2666-6510
Cited by
114
References
36
Language
en
Licence
Funders
National Natural Science Foundation of China

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Neural, symbolic and neural-symbolic reasoning on knowledge graphs. https://app.cochat.ai/papers/10.1016/j.aiopen.2021.03.001
The paper
Zhang, J., Chen, B., Zhang, L., Ke, X., & Ding, H. (2021). Neural, symbolic and neural-symbolic reasoning on knowledge graphs. AI Open. https://doi.org/10.1016/j.aiopen.2021.03.001

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.