Simple and minimal ground term equation systems

• Autorzy: Vagvölgyi S.
• Języki publikacji: EN

Abstrakty

EN

A ground term equation system (gtes for short) E is simple if there is no gtes E' equivalent to E consisting of less equations than E has. Moreover, a gtes E is minimal if for each equation e < E, the congruence generated by E - {e} is a proper subset of the congruence generated by E. Given a reduced ground term rewriting system R, we describe all simple gtes' E and minimal gtes' F equivalent to R. We show that for a reduced ground term rewriting system R, it is decidable whether or not there exist infinitely many simple (minimal) gtes' equivalent to R. Finally, we show that for a reduced ground term rewriting system R, and a gtes E, it is decidable if there is a simple gtes F equivalent to R such that E < F.

Słowa kluczowe

EN

ground term equation system; reduced ground term rewrite system

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 1998
• Tom: Vol. 36, nr 4
• Strony: 367--413
• Opis fizyczny: bibliogr. 20 poz.

Twórcy

autor

Vagvölgyi S.

• Department of Applied Informatics József Attila University Szeged, Arpad ter 2, H-6720 Hungary,