On complementary principles of object-oriented constraint programming

The paper is devoted to the implementation of the paradigm of the object-oriented constraint programming (OOCP), which combines complementary ideas and principles of the object-oriented programming (OOP) and constraint logical programming (CLP). Although the idea looks attractive and there have been...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Programming and computer software Ročník 36; číslo 5; s. 264 - 275
Hlavní autori: Semenov, V. A., Dragalov, K. V., Ilyin, D. V., Morozov, S. V., Sidyaka, O. V.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Dordrecht SP MAIK Nauka/Interperiodica 01.09.2010
Springer Nature B.V
Predmet:
Artificial Intelligence
Computer models
Computer programs
Computer Science
Computer simulation
Mathematical models
Object oriented
Object oriented programming
Object-oriented languages
Operating Systems
Principles
Programming
Programming languages
Software
Software Engineering
Software Engineering/Programming and Operating Systems
Strategy
Test Data Generation
Constraint Problem
Semantic Rule
Constraint Programming
Regular Polyhedron
ISSN:0361-7688, 1608-3261
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The paper is devoted to the implementation of the paradigm of the object-oriented constraint programming (OOCP), which combines complementary ideas and principles of the object-oriented programming (OOP) and constraint logical programming (CLP). Although the idea looks attractive and there have been attempts to implement it with the use of logical and functional languages, its future outline is still not clear. In the paper, a survey of the existing technologies of the constraint programming is given, and a new systematic approach to the implementation of the object-oriented constraint programming based on the use of declarative data modeling languages is discussed. The advantages of the approach related to the expressiveness and generality of the constraint problem declarations are demonstrated on the example of the classical mathematical queen problem. A general algorithmic strategy of solving the constraint problems is also discussed.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0361-7688
1608-3261
DOI:10.1134/S0361768810050026