Treffer: Object-oriented constraint programming with J.CP

Title:
Object-oriented constraint programming with J.CP
Authors:
RINGWELSKI, Georg
Source:
Advances in artificial intelligence (Mérida, 22-26 April 2002)Lecture notes in computer science. :194-203
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 18 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Intelligence artificielle, Artificial intelligence, Résolution de problèmes, jeux, Problem solving, game playing, Asynchronisation, Asynchronism, Asincronia, Interconnexion, Interconnection, Interconexión, Langage programmation, Programming language, Lenguaje programación, Problème recherche, Search problem, Problema investigación, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Programmation orientée objet, Object oriented programming, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Système chaotique, Chaotic systems, Système réparti, Distributed system, Sistema repartido
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Fraunhofer FIRST, Kekuléstrasse 7, 12489 Berlin, Germany
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=14056692
Rights:
Copyright 2002 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.14056692
Database:
PASCAL Archive

Weitere Informationen

We give a short introduction to Asynchronous Constraint Solving (ACS), which is a new execution model to solve constraint satisfaction problems through constraint propagation and search. Propagation is based on the theory of chaotic iteration and search is implemented with explicit constraint retraction. ACS is designed for the object-oriented development of distributed or strongly interactive applications. Our implementation J.CP makes use of this new execution model. J.CP is a Java package, which combines the declarativity of constraint programming with the features of the object-oriented programming language Java. Constraints are autonomous objects that can be posted and retracted in concurrently running solvers that communicate via common constraint variables.