Subdefinite Models and Logic Programming: Implementation of Constraints

Authors:
E. S. Petrov;T. M. Yakhno
Affiliations:
Ershov Institute of Information Systems, Siberian Division, Russian Academy of Sciences, pr. Akademika Lavrent'eva 6, Novosibirsk, 630090 Russia petrov@irin.univ-nantes.fr;Ershov Institute of Information Systems, Siberian Division, Russian Academy of Sciences, pr. Akademika Lavrent'eva 6, Novosibirsk, 630090 Russia petrov@irin.univ-nantes.fr
Venue:
Programming and Computing Software
Year:
2001

Citing 3
Cited 0

Improved incremental randomized Delaunay triangulation

Proceedings of the fourteenth annual symposium on Computational geometry
Metastructures versus Attributed Variables in the Context of Extensible Unification

PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Interval Constraint Logic Programming

Selected Papers from Constraint Programming: Basics and Trends

Quantified Score

Hi-index	0.00

Visualization

Abstract

Subdefinite models, described in [11], are a common approach to representation and processing of partial specifications. This approach is closely related to constraint programming, and, actually, is a method for constructing constraint satisfaction algorithms. The paper describes subdefinite models themselves, the method of their integration into logic programming, and two calculators created on the basis of this method. Results of a comparison of these calculators with the best available calculators designed for the same purpose are given. Applications are listed that were developed on the base of these calculators for solving problems of SAPR and computational geometry.