The research presented in this papr is situated in the framework of ocnstraint databases tha twas introducted by Kanellaskkis,Kupe,and revesz in their seminal paper of 1990.In this area,databases and query Languages are defiend using real polynomial constraints.As a consequence of a classicla result by AATarski,First-order queries in the constraint database model are effectively ocmputable,and their resut is within the constraint model.
展开▼
