POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Backtrack-free and backtrack-bounded search
Search in Artificial Intelligence
Constraint relaxation may be perfect
Artificial Intelligence
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
From local to global consistency
Artificial Intelligence
Concurrent constraint programming
Concurrent constraint programming
Synthesizing constraint expressions
Communications of the ACM
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
Redundant Hidden Variables in Finite Domain Constraint Problems
Constraint Processing, Selected Papers
From Eventual to Atomic Locally Atomic CC Programs: A Concurrent Semantics
ALP '94 Proceedings of the 4th International Conference on Algebraic and Logic Programming
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Interchangeability in Soft CSPs
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
In this paper we advocate for more flexible anduser-friendly constraint solving environments, as well as forconstraint programming languages which have great expressivepower while maintaining a formal semantics based on few crucialconcepts. We cite some of our work in these directions and wehint at subjects of our future research.