Constraint programming languages: their specification and generation
Constraint programming languages: their specification and generation
OOPSLA '87 Conference proceedings on Object-oriented programming systems, languages and applications
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Tree search and ARC consistency in constraint satisfaction algorithms
Search in Artificial Intelligence
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Equate: an object-oriented constraint solver
OOPSLA '91 Conference proceedings on Object-oriented programming systems, languages, and applications
Synthesizing constraint expressions
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Generating Semantic Descriptions From Drawings of Scenes With Shadows
Generating Semantic Descriptions From Drawings of Scenes With Shadows
Predictive Personnel Management
IEEE Intelligent Systems
Increasing functional constraints need to be checked only once
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
On complementary principles of object-oriented constraint programming
Programming and Computing Software
| Hi-index | 0.00 |
ConstraintLisp is an object-oriented constraint programming language. It is based on the constraint satisfaction problem (CSP) model in Artificial Intelligence and the object-oriented technology. This integration provides both the declarative representation and efficiency of constraint solving of constraint programming, and the powerful problem modelling capability, maintainability, reusability and extensibility of the object-oriented technology. ConstraintLisp is aimed at providing practical solutions to real life constrained search problems such as scheduling, resource allocation, etc. It is also designed and implemented in an object-oriented approach.