Representational Completeness

Representational Completeness is a formal property of a representational system that ensures it can express all and only the problem states, transitions, and constraints semantically required for a given problem domain, thereby distinguishing it from weaker representational schemes that may omit essential structures or permit extraneous, non-meaningful expressions.

15

Publications

437

Citations

23

Authors

14

Institutions

Publications per year

2017–2026

2

Authors

23

  1. MB
    Mary Beth Ruskai

    Tufts University, United States

    1 publications · 34 citations

    1

    h-index

  2. RH
    Robin Hirsch

    University College London, United Kingdom

    1 publications · 95 citations

    1

    h-index

  3. WH
    William H. Ruckle

    Clemson University, United States

    1 publications · 45 citations

    1

    h-index

  4. IH
    Ian Hodkinson

    Imperial College London, United Kingdom

    1 publications · 95 citations

    1

    h-index

  5. AB
    A. Bakker

    Carnegie Mellon University, United States

    1 publications · 39 citations

    1

    h-index

1–5 of 23

Venues

  1. Reports on Mathematical Physics

    2 publications · 43 citations

    2

    h-index

  2. Proceedings of the American Mathematical Society

    PROC · 2 publications · 39 citations

    2

    h-index

  3. Discrete & Computational Geometry

    1 publications · 18 citations

    1

    h-index

  4. Logical Methods in Computer Science

    LMCS · 1 publications · 13 citations

    1

    h-index

  5. Pacific Journal of Mathematics

    1 publications · 45 citations

    1

    h-index

1–5