Keynote Speakers
Pedro Quaresma
Measuring the Readability of Geometric Proofs
Pedro Quaresma obtained his PhD in Informatics, in the area of knowledge of Fundamentals Computer Science, from the University of Minho in 1998 and is currently Assistant Professor at the Mathematics Department of University of Coimbra. He has over 83 papers published under peer review, of which 18 articles in indexed journals (ISI and/or Scopus), 12 articles in Lecture Notes in Artificial Intelligence (LNAI), and also has 18 publications as a volume editor of LNAI and of the Electronic Proceedings in Theoretical Computer Science (EPTCS). He belongs to the Centre for Informatics and Systems of the University of Coimbra. His research interests include automatic deduction and knowledge management in geometry and ICT applications to education.
Abstract
An important feature of a text is its readability. Readability is the ease with which a reader can understand a written text. The readability of a text is determined by many factors and plays an important role in many areas of interest.
A mathematical text is composed of many elements: descriptions in natural language, formulas and diagrams; thus, it is much more difficult to quantify its readability through formulas, then in the case of regular text. Even more complex is the problem of the readability of mathematical proofs produced by automatic provers that are often presented in a form that can only be read by experts.
In my talk I will introduce both a language to formulate readability criteria for formal proofs produced by automated theorem provers for geometry, based on the area method and also a novel criterion based on our modernisation of Lemoine’s Geometrography.