Experimenting with Different Approaches to Test Colinearity of Points

The subject of collinearity of 3 points on a line is challenging for 7th- grade students. This article discusses the possibilities to demonstrate different approaches for solving collinearity of three points on a line: straight angle, axiom on the uniform mapping of an angle on a half-plane, parallel axiom, vector method, and homothetic features. The experiment was held using GEONExT to demonstrate by visual methods collinearity of three points on a line a district type of problems.

Computing and Visualizing Solution Sets of Interval Linear Systems

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006

Reasoning Methods for Designing and Surveying Relationships Described by Sets of Functional Constraints

This work is supported by the Hungarian Scientific Research Fund (OTKA), grant T042706.

Discriminant Sets of Families of Hyperbolic Polynomials of Degree 4 and 5

∗ Research partially supported by INTAS grant 97-1644

On the Time Complexity of the Problem Related to Reducts of Consistent Decision Tables

In recent years, rough set approach computing issues concerning reducts of decision tables have attracted the attention of many researchers. In this paper, we present the time complexity of an algorithm computing reducts of decision tables by relational database approach. Let DS = (U, C ∪ {d}) be a consistent decision table, we say that A ⊆ C is a relative reduct of DS if A contains a reduct of DS. Let s = be a relation schema on the attribute set C ∪ {d}, we say that A ⊆ C is a relative minimal set of the attribute d if A contains a minimal set of d. Let Qd be the family of all relative reducts of DS, and Pd be the family of all relative minimal sets of the attribute d on s. We prove that the problem whether Qd ⊆ Pd is co-NP-complete. However, the problem whether Pd ⊆ Qd is in P .