Logical programming of solvers for local geometric problems

Novikov Pavel Vladimirovich

The article introduces the concept of a local geometric problem from the position of the clausal form of logic. The abilities of logical programming of local geometric problem are investigated. The features of programming symmetric binary relations and transitive geometric properties in the PROLOG language are shown. Domains types and predicates have been created to implement the basic concepts of geometry. The functioning of various solvers of local geometric problems is investigated.

Keywords:local geometric problem, logical program, binary relations, transitive geometric properties, problem solver