Abstract
In this paper we advocate for more flexible and user-friendly constraint solving environments, as well as for constraint programming languages which have great expressive power while maintaining a formal semantics based on few crucial concepts. We cite some of our work in these directions and we hint at subjects of our future research.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Bistarelli, U. Montanari, & F. Rossi. (1995). Constraint Solving over Semirings. In Proc.IJCAI95. Morgan Kaufman.
F. Bueno, M. Jose Garcia de la Banda, M. Hermenegildo, U. Montanari, & F. Rossi. (1994). From eventual to atomic and locally atomic cc programs: A concurrent semantics. In Proc.Int.Conference on Algebraic and Logic Programming (ALP94).
P. Codognet & D. Diaz. (1996). Compiling constraints in clp(fd). Journal of Logic Programming, 27.
P. Codognet, D. Diaz, & F. Rossi. (1996). Constraint retraction in fd. In Proc.FST & TCS.
P. Codognet & F. Rossi. (1995). NMCC Programming: Constraint Enforcement and Retraction in CC Programming. In Proc.ICLP95
R. Dechter. (1987). On the expressiveness of networks with hidden variables. In Proc.AAAI, pp. 556–562.
R. Dechter & J. Pearl. (1987). Network-Based Heuristics for Constraint-Satisfaction Problems. Artificial Intelligence34.
Rina Dechter. (1992). From local to global consistency. Artificial Intelligence55: 87–107.
E. C. Freuder. (1978). Synthesizing constraint expressions. Communication of the ACM21.
E. C. Freuder. (1988). Backtrack-free and backtrack-bounded search. In Kanal and Kumar, editors, Search in Artificial Intelligence. Springer-Verlag.
J. Jaffar et al. (1992). The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems.
J. Jaffar & J.L. Lassez. (1987). Constraint logic programming. In Proc.POPL. ACM.
A. K. Mackworth & E. C. Freuder. (1985). The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence
A.K. Mackworth. (1977). Consistency in networks of relations. Artificial Intelligence8.
U. Montanari. (1974). Networks of constraints: Fundamental properties and application to picture processing. Information Science7. Also Technical Report, Carnegie Mellon University, 1970.
U. Montanari & F. Rossi. (1991). Constraint relaxation may be perfect. Artificial Intelligence Journal48: 143–170.
U. Montanari & F. Rossi. (1991). True concurrency in concurrent constraint programming. In Proc.ILPS91. MIT Press.
U. Montanari & F. Rossi. (1995). A concurrent semantics for concurrent constraint programming via contextual nets. In Saraswat V. and Van Hentenryck P. eds., editors, Constraint Programming. MIT Press.
U. Montanari & F. Rossi. (1996), Graph rewriting and constraint solving for modelling distributed systems with synchronization. In Proc.COORDINATION96. Springer-Verlag, LNCS.
F. Rossi. (1995). Redundant hidden variables in finite domain constraint problems. In M. Meyer, editor, Constraint Processing. Springer-Verlag, LNCS 923.
F. Rossi & A. Sperduti. (1996). Learning solution preferences in constraint problems. In W. Hower and Zsófia Ruttkay, editors, Non-Standard Constraint Processing, working notes of the ECAI-96 workshop W27.
V.A. Saraswat. (1993). Concurrent Constraint Programming. MIT Press.
T. Schiex, H. Fargier, & G. Verfaille. (1995). Valued Constraint Satisfaction Problems: Hard and Easy Problems. In Proc.IJCAI95. Morgan Kaufmann, 1995.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Montanari, U., Rossi, F. Constraint Solving and Programming: What Next?. Constraints 2, 87–91 (1997). https://doi.org/10.1023/A:1009757208585
Issue Date:
DOI: https://doi.org/10.1023/A:1009757208585