h1

% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@INPROCEEDINGS{Baader:995082,
      author       = {Baader, Franz and Giesl, Jürgen},
      title        = {{O}n the {C}omplexity of the {S}mall {T}erm {R}eachability
                      {P}roblem for {T}erminating {T}erm {R}ewriting {S}ystems},
      volume       = {299},
      address      = {Saarbrücken/Wadern, Germany},
      publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH,
                      Dagstuhl Publishing, June},
      reportid     = {RWTH-2024-09699},
      series       = {Leibniz international proceedings in informatics},
      pages        = {16:1-16:18},
      year         = {2024},
      comment      = {9th International Conference on Formal Structures for
                      Computation and Deduction : FSCD 2024, July 10-13, 2024,
                      Tallinn, Estonia / edited by Jakob Rehof},
      booktitle     = {9th International Conference on Formal
                       Structures for Computation and
                       Deduction : FSCD 2024, July 10-13,
                       2024, Tallinn, Estonia / edited by
                       Jakob Rehof},
      month         = {Jul},
      date          = {2024-07-10},
      organization  = {9. International Conference on Formal
                       Structures for Computation and
                       Deduction, Tallinn (Estonia), 10 Jul
                       2024 - 13 Jul 2024},
      keywords     = {Confluence (Other) / Creating small terms (Other) /
                      Derivational complexity (Other) / Description Logics (Other)
                      / Proof rewriting (Other) / Rewriting (Other) / Termination
                      (Other) / Theory of computation → Automated reasoning
                      (Other) / Theory of computation → Complexity theory and
                      logic (Other) / Theory of computation → Equational logic
                      and rewriting (Other)},
      cin          = {121420 / 120000},
      cid          = {$I:(DE-82)121420_20140620$ / $I:(DE-82)120000_20140620$},
      pnm          = {DFG project G:(GEPRIS)235950644 - Automatische
                      Terminierungs- und Komplexitätsanalyse imperativer
                      Programme (235950644)},
      pid          = {G:(GEPRIS)235950644},
      typ          = {PUB:(DE-HGF)7 / PUB:(DE-HGF)8},
      UT           = {WOS:001587746100016},
      doi          = {10.4230/LIPICS.FSCD.2024.16},
      url          = {https://publications.rwth-aachen.de/record/995082},
}