Linear Arithmetic

Linear Arithmetic is a decidable fragment of first-order arithmetic that restricts terms to linear combinations of integer or real variables and supports equality and inequality comparisons, forming the basis for constraint solving in Satisfiability Modulo Theories.

137

Publications

5.1K

Citations

253

Authors

145

Institutions

Publications per year

2017–2026

16

Authors

253

  1. VW
    Volker Weispfenning

    University of Passau, Germany

    4 publications · 376 citations

    4

    h-index

  2. JL
    Jean-Louis Lassez

    IBM Research - Thomas J. Watson Research Center, United States

    3 publications · 135 citations

    3

    h-index

  3. PJ
    Peter J. Stuckey

    The University of Melbourne, Australia

    3 publications · 140 citations

    3

    h-index

  4. RS
    Roberto Sebastiani

    University of Trento, Italy

    3 publications · 176 citations

    3

    h-index

  5. VK
    Viktor Kunčak

    École Polytechnique Fédérale de Lausanne, Switzerland

    3 publications · 68 citations

    3

    h-index

1–5 of 253

Venues

  1. Theoretical Computer Science

    5 publications · 126 citations

    5

    h-index

  2. Annals of Pure and Applied Logic

    3 publications · 52 citations

    3

    h-index

  3. Numerische Mathematik

    3 publications · 51 citations

    3

    h-index

  4. Formal Methods in System Design

    3 publications · 49 citations

    3

    h-index

  5. Journal of Automated Reasoning

    3 publications · 139 citations

    3

    h-index

1–5