Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Equational Termination by Semantic Labelling ? Hitoshi Ohsaki 1 , Aart Middeldorp 2 , and Jurgen Giesl 3
 

Summary: Equational Termination by Semantic Labelling ?
Hitoshi Ohsaki 1 , Aart Middeldorp 2 , and Jurgen Giesl 3
1 Computer Science Division, Electrotechnical Laboratory
Tsukuba 305-8568, Japan
ohsaki@etl.go.jp
2 Institute of Information Sciences and Electronics
University of Tsukuba, Tsukuba 305-8573, Japan
ami@is.tsukuba.ac.jp
3 Computer Science Department
University of New Mexico, Albuquerque, NM 87131, USA
giesl@cs.unm.edu
Abstract. Semantic labelling is a powerful tool for proving termination
of term rewrite systems. The usefulness of the extension to equational
term rewriting described in Zantema [24] is however rather limited. In
this paper we introduce a stronger version of equational semantical la-
belling, parameterized by three choices: (1) the order on the underlying
algebra (partial order vs. quasi-order), (2) the relation between the al-
gebra and the rewrite system (model vs. quasi-model), and (3) the la-
belling of the function symbols appearing in the equations (forbidden vs.
allowed). We present soundness and completeness results for the various

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences