Quantitative Algebraic Reasoning

Radu Iulian Mardare, Prakash Panangaden, Gordon Plotkin

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

23 Citations (Scopus)

Abstract

We develop a quantitative analogue of equational reasoning which we call quantitative algebra. We define an equality relation indexed by rationals: a =ε b which we think of as saying that “a is approximately equal to b up to an error of ε”. We have 4 interesting examples where we have a quantitative equational theory whose free algebras correspond to well known structures. In each case we have finitary and continuous versions. The four cases are: Hausdorff metrics from quantitive semilattices; pWasserstein metrics (hence also the Kantorovich metric) from barycentric algebras and also from pointed barycentric algebras and the total variation metric from a variant of barycentric algebras.
Original languageEnglish
Title of host publicationProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science : LICS'16, New York, NY, USA, July 5-8, 2016
Number of pages10
PublisherAssociation for Computing Machinery
Publication date2016
Pages700-709
ISBN (Print)978-1-4503-4391-6
DOIs
Publication statusPublished - 2016
Event31st IEEE Symposium on Logic in Computer Science - Columbia University, New York City, United States
Duration: 5 Jul 20168 Jul 2016
Conference number: 31st
http://lics.rwth-aachen.de/lics16/

Conference

Conference31st IEEE Symposium on Logic in Computer Science
Number31st
LocationColumbia University
CountryUnited States
CityNew York City
Period05/07/201608/07/2016
Internet address

Fingerprint Dive into the research topics of 'Quantitative Algebraic Reasoning'. Together they form a unique fingerprint.

Cite this