First-Order Theory of Rewriting for Linear Variable-Separated Rewrite Systems: Automation, Formalization, Certification

First-Order Theory of Rewriting for Linear Variable-Separated Rewrite Systems: Automation, Formalization, Certification

The first-order theory of rewriting is decidable for linear variable-separated rewrite systems. We present a new decision procedure which is the basis of FORT, a decision and synthesis tool for properties expressible in the theory. The decision procedure is based on tree automata techniques and veri...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of automated reasoning 2023-06, Vol.67 (2), p.14-14, Article 14
Hauptverfasser: Middeldorp, Aart, Lochmann, Alexander, Mitterwallner, Fabian
Format: Artikel
Sprache:eng
Schlagworte:
Artificial Intelligence
Automation
Certification
Computer Science
Decision theory
Mathematical Logic and Formal Languages
Mathematical Logic and Foundations
Symbolic and Algebraic Manipulation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The first-order theory of rewriting is decidable for linear variable-separated rewrite systems. We present a new decision procedure which is the basis of FORT, a decision and synthesis tool for properties expressible in the theory. The decision procedure is based on tree automata techniques and verified in Isabelle. Several extensions make the theory more expressive and FORT more versatile. We present a certificate language that enables the output of FORT to be certified by the certifier FORTify generated from the formalization, and we provide extensive experiments.
ISSN:0168-7433
1573-0670
DOI:10.1007/s10817-023-09661-7