Computer-Aided Construction of Finite Geometric Spaces: Automated Verification of Geometric Constraints

  • Authors:
  • Wolfgang Gehrke;Jochen Pfalzgraf

  • Affiliations:
  • Università di Roma Tre, Dipartimento di Informatica e Automazione, Via della Vasca Navale 79, I - 00146 Roma, Italy. e-mail: wgehrke@rhl.dia.uniroma3.it;Department of Computer Science, University of Salzburg, Jakob Haringer Str. 2, A-5020 Salzburg, Austria. e-mail: pfalzgraf@cosy.sbg.ac.at

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The category of noncommutative geometric spaces is a rather new and wide field in geometry that provides a rich source of hard computer applications. In this contribution we give a short summary of the basic notions of geometric spaces. The so-called parallel map that describes a space will play a fundamental role because, in terms of the parallel map, a geometric space can be represented in such a way that geometric conditions/axioms (which form the structure of a space) are expressible by certain equations. To verify a configuration amounts to showing the solvability of a corresponding equation or a system of equations, respectively. This is a computational aspect that opens the whole field naturally to computer applications by means of “automated deduction in geometry,” verification of geometric constraints, computer-aided construction of finite geometries. We give motivation why we use specific declarative programming languages for doing all the implementations and computer applications.