CoChat

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

A Rete Network Construction Algorithm for Incremental Pattern Matching

Varró, Gergely, Deckwerth, Frederik · 2013 · Lecture Notes in Computer Science

Overview

Integrity signals

Registry

Crossref · 10.1007/978-3-642-38883-5_13

Cites

20 of 20 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 20 references

Cited by

See all 35

Metadata

Authors
Varró, G., & Deckwerth, F.
Affiliations
Technische Universität Darmstadt (DE)
Venue
Lecture Notes in Computer Science
Published
2013
Pages
125-140
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1751328170
Cited by
26
References
20
Citations by year
2025: 1 · 2024: 2 · 2022: 2 · 2021: 2 · 2020: 4 · 2019: 3 · 2018: 1 · 2017: 5 · 2016: 3 · 2014: 3
FWCI
1.28
Type
conference paper
Language
en
Open access
closed
Locations
  • Lecture notes in computer science (publishedVersion)
  • TUbilio (Technical University of Darmstadt) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
  • Physical Sciences › Computer Science › Software › Model-Driven Software Engineering Techniques
  • Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
Keywords
Rete algorithm, dynamic programming, network topology optimization, cost function, motif recognition, runtime performance

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: A Rete Network Construction Algorithm for Incremental Pattern Matching. https://app.cochat.ai/papers/10.1007/978-3-642-38883-5_13
The paper
Varró, G., & Deckwerth, F. (2013). A Rete Network Construction Algorithm for Incremental Pattern Matching. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-38883-5_13

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.