A Proof Method for Local Sufficient Completeness of Term Rewriting Systems

Tomoki Shiraishi, Kentaro Kikuchi, Takahito Aoto

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

A term rewriting system (TRS) is said to be sufficiently complete when each function yields some value for any input. In this paper, we present a proof method for local sufficient completeness of TRSs, which is a generalised notion of sufficient completeness and is useful for proving inductive theorems of non-terminating TRSs. The proof method is based on a sufficient condition for local sufficient completeness of TRSs that consist of functions on natural numbers and (possibly infinite) lists of natural numbers. We also make a comparison between the proof abilities of the methods by the sufficient condition and by a derivation system introduced in previous work.

本文言語English
ホスト出版物のタイトルTheoretical Aspects of Computing – ICTAC 2021 - 18th International Colloquium, Proceedings
編集者Antonio Cerone, Peter Csaba Olveczky
出版社Springer Science and Business Media Deutschland GmbH
ページ386-404
ページ数19
ISBN(印刷版)9783030853143
DOI
出版ステータスPublished - 2021
イベント18th International Colloquium on Theoretical Aspects of Computing, ICTAC 2021 - Virtual, Online
継続期間: 2021 9月 82021 9月 10

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
12819 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference18th International Colloquium on Theoretical Aspects of Computing, ICTAC 2021
CityVirtual, Online
Period21/9/821/9/10

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「A Proof Method for Local Sufficient Completeness of Term Rewriting Systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル