Normal forms for binary relations

Author	dc.contributor.author	Dougherty, Daniel J.
Author	dc.contributor.author	Gutiérrez Gallardo, Claudio	es_CL
Admission date	dc.date.accessioned	2009-03-30T16:49:49Z
Available date	dc.date.available	2009-03-30T16:49:49Z
Publication date	dc.date.issued	2006-08-21
Cita de ítem	dc.identifier.citation	THEORETICAL COMPUTER SCIENCE Volume: 360 Issue: 1-3 Pages: 228-246 Published: AUG 21 2006	en
Identifier	dc.identifier.issn	0304-3975
Identifier	dc.identifier.uri	https://repositorio.uchile.cl/handle/2250/124833
Abstract	dc.description.abstract	We consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly normalizing and induces a notion of computable normal form for terms. This notion of reduction thus leads to a computational interpretation of the representable theory.	en
Lenguage	dc.language.iso	en	en
Publisher	dc.publisher	ELSEVIER	en
Keywords	dc.subject	SERIES-PARALLEL NETWORKS	en
Título	dc.title	Normal forms for binary relations	en
Document type	dc.type	Artículo de revista