Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Over-Constrained Systems

OCS 1995: Over-Constrained Systems pp 1–22Cite as

A brief overview of over-constrained systems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1106))

Abstract

We survey previous work on resolving over-constrained systems, and previous theories and frameworks for expressing partial, preferential, and hierarchical information. We provide an extensive bibliography.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines. John Wiley & Sons, Cichester, England, 1989.

    Google Scholar 

  2. R. R. Bakker, F. Dikker, F. Templeman, and P. M. Wognum. Diagnosing and Solving Over-Determined Constraint Satisfaction Problems. In IJCAI'93: Proceedings International Joint Conference on Artificial Intelligence, 1993.

    Google Scholar 

  3. M. García de la Banda, M. Hermenegildo, and K. Marriott. Independence in Constraint Logic Programs. In ILPS'93: Proceedings 3rd International Logic Programming Symposium, pages 130–146, Vancouver, 1993.

    Google Scholar 

  4. J. C. Beck. A Schema for Constraint Relaxation with Instantiations for Partial Constraint Satisfaction and Schedule Optimization. Master's thesis, University of Toronto, Canada, 1994.

    Google Scholar 

  5. F. Benhamou, D. Mc Allester, and P. Van Hentenryck. CLP (Intervals) revisited. In ILPS'94: Proceedings 4rd International Logic Programming Symposium, 1994.

    Google Scholar 

  6. Pierre Berlandier and Bertrand Neveu. Arc-Consistency for Dynamic Constraint Problems: A RMS-Free Approach. In Thomas Schiex and Christian Bessière, editors, Proceedings ECAI'94 Workshop on Constraint Satisfaction Issues raised by Practical Applications, Amsterdam, August 1994.

    Google Scholar 

  7. Christian Bessière. Arc Consistency in Dynamic Constraint Satisfaction Problems. In Proceedings AAAI'91, 1991.

    Google Scholar 

  8. Christian Bessière. Arc Consistency for Non-Binary Dynamic CSPs. In ECAI'92, 1992.

    Google Scholar 

  9. Stefano Bistarelli. Programmazione con vincoli pesati e ottimizzazione (in Italian). Dipartimento di Informatica, Università di Pisa, Italy, 1994.

    Google Scholar 

  10. Stefano Bistarelli, Hélène Fargier, Ugo Montanari, Francesca Rossi, Thomas Schiex, and Gerard Verfaillie. Semiring-based CSPs and Valued CSPs: Basic Properties and Comparison. In [133].

    Google Scholar 

  11. Stefano Bistarelli, Ugo Montanari, and Francesca Rossi. Constraint Solving over Semirings. In Chris Mellish, editor, IJCAI'95: Proceedings International Joint Conference on Artificial Intelligence, Montreal, Morgan Kaufman, August 1995.

    Google Scholar 

  12. Karl-Friedrich Böhringer. Using Constraints to Achieve Stability in Automatic Graph Layout Algorithms. In CHI'90 Conference Proceedings, pages 43–52, Seattle, Washington, April 1990. ACM SIGCHI.

    Google Scholar 

  13. Patrice Boizumault, Christelle Guéret, and Narendra Jussien. Efficient Labeling and Constraint Relaxation for Solving Time Tabling Problems. In Pierre Lim and Jean Jourdan, editors, Proceedings of the 1994 ILPS Post-conference Workshop on Constraint Languages/Systems and Their Use in Problem Modeling: Volume 1 (Applications and Modelling), Technical Report ECRC-94-38, ECRC, Munich, Germany, November 1994.

    Google Scholar 

  14. Alan Borning. The Programming Language Aspects of ThingLab, A Constraint-Oriented Simulation Laboratory. ACM Transactions on Programming Languages and Systems, 3(4):353–387, October 1981.

    Google Scholar 

  15. Alan Borning and Robert Duisberg. Constraint-based Tools for Building User Interfaces. ACM Transactions on Graphics, 5(4):345–374, October 1986.

    Google Scholar 

  16. Alan Borning, Robert Duisberg, Bjorn Freeman-Benson, Axel Kramer, and Michael Woolf. Constraint Hierarchies. In OOPSLA '87: Proceedings of the 1987 ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 48–60. ACM, October 1987.

    Google Scholar 

  17. Alan Borning and Bjorn Freeman-Benson. The OTI Constraint Solver: A Constraint Library for Constructing Interactive Graphical User Interfaces. In Ugo Montanari and Francesca Rossi, editors, CP'95: Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming 1995, LNCS 976. Springer, 1995.

    Google Scholar 

  18. Alan Borning, Bjorn Freeman-Benson, and Molly Wilson. Constraint Hierarchies. Lisp and Symbolic Computation, 5:223–270, 1992. (Reprinted in B. Mayoh, E. Tyugu, and J.Penjaam, editors, Constraint Programming: Proceedings 1993 NATO ASI Parnu, Estonia, NATO Advanced Science Institute Series, pages 80–122. Springer, 1994. Also reprinted in [133]).

    Article  Google Scholar 

  19. Alan Borning, Michael Maher, Amy Martindale, and Molly Wilson. Constraint Hierarchies and Logic Programming. In Giorgio Levi and Maurizio Martelli, editors, ICLP'89: Proceedings 6th International Conference on Logic Programming, pages 149–164, Lisbon, Portugal, June 1989. MIT Press.

    Google Scholar 

  20. Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, and Maria Chiara Meo. An Or-Compositional Semantics for Logic Programs. In J.-M. Jacquet, editor, Constructing Logic Programs, chapter 10, pages 215–240. Wiley, 1993.

    Google Scholar 

  21. Fabrice Bouquet and Philippe Jégou. Knowledge Base Revision Using Dynamic Weighted OBDDs. Technical report, Université de Provence, 1995.

    Google Scholar 

  22. Fabrice Bouquet and Philippe Jégou. Solving Over-Constrained CSP Using Weighted OBDD. In [133].

    Google Scholar 

  23. Mouhssine Bouzoubaa, Bertrand Neveu, and Geir Hasle. Houria: A Solver for Equational Constraints in a Hierarchical System. In Michael Jampel, Eugene Freuder, and Michael Maher, editors, OCS'95: Workshop Notes, Workshop on Over-Constrained Systems at CP'95, Cassis, Marseilles, 18 September 1995.

    Google Scholar 

  24. James Bowen, Robert Lai, and Dennis Bahler. Lexical Imprecision in Fuzzy Constraint Networks. In AAAI'92, San Jose, July 1992.

    Google Scholar 

  25. S. Breitinger and H. C. R. Lock. Using Constraint Logic Programming for Industrial Scheduling Problems. In C. Beierle and L. Plümer, editors, Logic Programming: Formal Methods and Practical Applications, chapter 9, pages 273–299. Elsevier, 1995.

    Google Scholar 

  26. Gerhard Brewka. Preferred Subtheories: An Extended Logical Framework for Default Reasoning. In IJCAI'89: Proceedings 11th International Joint Conference on Artificial Intelligence, pages 1043–1048, August 1989.

    Google Scholar 

  27. Gerhard Brewka, Hans Werner Guesgen, and Joachim Hertzberg. Constraint Relaxation and Nonmonotonic Reasoning. Technical Report TR-92-002, ICSI, Berkeley, 1992.

    Google Scholar 

  28. E. Bryant. Graph-based Algorithhms for Boolean Function Manipulation. IEEE Transactions on computers, C-35:677–691, 1986.

    Google Scholar 

  29. E. Bryant. Symbolic Boolean Manipulation with Ordered BDD. ACM Computing Surveys, Vol 24 No.3, September 1992.

    Google Scholar 

  30. Alan Bundy. Incidence Calculus: A Mechanism for Probabilistic Reasoning. Journal of Automated Reasoning, 1:263–283, 1985.

    Google Scholar 

  31. C. A. Carter and W. R. LaLonde. The Design of a Program Editor Based on Constraints. Technical Report CS TR 50, Carleton University, May 1984.

    Google Scholar 

  32. C. Cayrol, M.C. Lagasquie-Schiex, and T. Schiex. Non-monotonic Reasoning: From Complexity to Algorithms. 4th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, USA, 1996.

    Google Scholar 

  33. T.Y. Chen, J-L. Lassez, and G. Port. Maximal Unifiable Subsets and Minimal Non-unifiable Subsets. New Generation Computing, 4:133–152, 1986.

    Google Scholar 

  34. John Chinneck. Finding Minimal Infeasible Sets of Constraints in Infeasible Mathematical Programs. Technical Report SCE-93-01, Department of Systems and Computer Engineering, Carleton University, Ottawa, 1993.

    Google Scholar 

  35. John Chinneck. Finding the Most Useful Subset of Constraints for Analysis in an Infeasible Linear Program. Technical Report SCE-93-07, Department of Systems and Computer Engineering, Carleton University, Ottawa, 1993.

    Google Scholar 

  36. John Chinneck. Computer Codes for the Analysis of Infeasible Linear Programs. Technical Report SCE-94-21, Department of Systems and Computer Engineering, Carleton University, Ottawa, 1994.

    Google Scholar 

  37. John Chinneck. MINOS(IIS): Infeasibility Analysis Using MINOS. Computers and Operations Research, 21(1):1–9, 1994.

    Google Scholar 

  38. John Chinneck. Analyzing Infeasible Nonlinear Programs. Computational Optimization and Applications, 1995.

    Google Scholar 

  39. John Chinneck and Erik Dravnieks. Locating Minimal Infeasible Constraint Sets in Linear Programs. ORSA Journal on Computing, 3(2):157–168, Spring 1991.

    Google Scholar 

  40. John Chinneck and M. A. Saunders. MINOS(IIS) Version 4.2: Analyzing Infeasibilities in Linear Programs. European Journal of Operational Research, 1994. (Technical Note).

    Google Scholar 

  41. Philippe Codognet and Daniel Diaz. Boolean Constraint Solving Using clp(FD). In ILPS'93: Proceedings 3rd International Logic Programming Symposium, pages 525–539, Vancouver, 1993.

    Google Scholar 

  42. Ellis S. Cohen, Edward T. Smith, and Lee A. Iverson. Constraint-Based Tiled Windows. IEEE Computer Graphics and Applications, pages 35–45, May 1986.

    Google Scholar 

  43. Jacques Cohen. Constraint Logic Programming Languages. Communications of the ACM, 33(7):52–68, July 1990.

    Article  Google Scholar 

  44. Alain Colmerauer. An Introduction to Prolog III. Communications of the ACM, 33(7):69–90, July 1990.

    Article  Google Scholar 

  45. Alain Colmerauer. Prolog II Reference Manual and Theoretical Model. Technical report, Groupe Intelligence Artificielle, Université Aix — Marseille II, October 1982.

    Google Scholar 

  46. M. Cooper. Visual Occlusion and the Interpretation of Ambiguous Pictures. Ellis Horwood, Chicester, 1992.

    Google Scholar 

  47. H. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press-McGraw-Hill, 1991.

    Google Scholar 

  48. M. Corsini and A. Rauzy. Toupie User's Manual. Technical report, LABRI, Université de Bordeaux I, France, 1993.

    Google Scholar 

  49. O. Coudert and J.C. Madre. A Logically Complete Reasonning Maintenance System Based on a Logical Constraint Solver. IJCAI91, I:294–299, 1991.

    Google Scholar 

  50. Xavier Cousin. Meilleures Solutions en Programmation Logique. In Proceedings Avignon'91, 1991. In French.

    Google Scholar 

  51. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.

    Google Scholar 

  52. E. Davis. Constraint Propagation with Interval Labels. Artificial Intelligence, 32:281–331, 1987.

    Article  Google Scholar 

  53. Bruno De Backer and Henri Beringer. An Efficient Solver for HCLP(\(\mathcal{R}\)). Technical report, IBM France Scientific Center, 1991. (ICLP'91, Pre-Conference Work-shop on CLP).

    Google Scholar 

  54. Bruno De Backer and Henri Beringer. Intelligent Backtracking for CLP Languages, An Application to CLP(\(\mathcal{R}\)). In ILPS'91: International Logic Programming Symposium, pages 405–419, 1991.

    Google Scholar 

  55. T.L. Dean and M. Boddy. An Analysis of Time-dependent Planning. In Proc. AAAI-88, pages 49–54, St. Paul, Minnesota, 1988.

    Google Scholar 

  56. Romuald Debruyne. DnAc6. Research Report 94-054, Laboratoire d'Informatique, de Robotique et de Micro-électronique de Montpellier, 1994. In French.

    Google Scholar 

  57. Rina Dechter. Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artif. Intell., 41:273–312, 1990.

    Google Scholar 

  58. Rina Dechter and Avi Dechter. Belief Maintenance in Dynamic Constraint Networks. In AAAI'88, Saint Paul, USA, pages 37–42, 1988.

    Google Scholar 

  59. Rina Dechter, A. Dechter, and Judea Pearl. Optimization in Constraint Networks. In R.M Oliver and J.Q. Smith, editors, Influence Diagrams, Belief Nets and Decision Analysis, chapter 18, pages 411–425. John Wiley & Sons Ltd., 1990.

    Google Scholar 

  60. Rina Dechter and Judea Pearl. Tree Clustering for Constraint Networks. Artificial Intelligence, 38:353–366, 1989.

    Google Scholar 

  61. N. Dendris, L. Kirousis, Y. Stamatiou, and D. Thilikos. Partiality and Approximation Schemes for Local Consistency in Networks of Constraints. In FSTTCS'95: Proceedings of the 15th Conf. on Foundations of Software Technology and Theoretical Computer Science, LNCS. Springer, December 1995.

    Google Scholar 

  62. N. Dendris, L. Kirousis, Y. Stamatiou, and D. Thilikos. Partial Arc Consistency. In [133].

    Google Scholar 

  63. Daniel Dennett. Cognitive Wheels: The Frame Problem of AI. In C. Hookway, editor, Minds, Machines, and Evolution: Philosophical Studies, pages 129–151. Cambridge U.P., 1984.

    Google Scholar 

  64. Yannick Descotte and Jean-Claude Latombe. Making Compromises Among Antagonist Constraints in a Planner. Artificial Intelligence, 27:183–217, 1985.

    Google Scholar 

  65. Didier Dubois, Hélène Fargier, and Henri Prade. The Calculus of Fuzzy Restrictions as a Basis for Flexible Constraint Satisfaction. In Proceedings 2nd IEEE Conference on Fuzzy Sets, San Francisco, March 1993.

    Google Scholar 

  66. Didier Dubois, Hélène Fargier, and Henri Prade. Propagation and Satisfaction of Flexible Constraints. In R. R. Yager and L. A. Zadeh, editors, Fuzzy Sets, Neural Networks and Soft Computing. Kluwer Academic Press, 1993. (Also available as Rapport IRIT/92-59-R, IRIT).

    Google Scholar 

  67. Didier Dubois and Henri Prade. Fuzzy Sets and Systems: Theory and Applications. Academic Press, New York, 1980.

    Google Scholar 

  68. Didier Dubois and Henri Prade. A Class of Fuzzy Measures Based on Triangular Norms: A General Framework for the Combination of Uncertain Information. Int. Journal of Intelligent Systems, 8(1):43–61, 1982.

    Google Scholar 

  69. M. Anton Ertl and Andreas Krall. Optimal Instruction Scheduling Using Constraint Logic Programming. In J. Maluszyński and M. Wirsing, editors, PLILP'91: Proceedings 3rd International Symposium on Programming Language Implementation and Logic Programming, LNCS 528, Passau, Germany, August 1991. Springer.

    Google Scholar 

  70. David W. Etherington. Formalizing Nonmonotonic Reasoning Systems. Artificial Intelligence, 31(1):41–85, January 1987.

    Google Scholar 

  71. O. Evans. Factory Scheduling Using Finite Domains. In G. Comyn, N. E. Fuchs, and M. J. Ratcliffe, editors, Logic Programming in Action, LNCS 636, pages 45–53. Springer, 1992.

    Google Scholar 

  72. François Fages, Julian Fowler, and Thierry Sola. Handling Preferences in Constraint Logic Programming with Relational Optimization. In PLILP'94, Madrid, September 1994.

    Google Scholar 

  73. François Fages, Julian Fowler, and Thierry Sola. A Reactive Constraint Logic Programming Scheme. In ICLP'95: International Conference on Logic Programming, Tokyo, 1995.

    Google Scholar 

  74. François Fages. On the Semantics of Optimization Predicates in CLP Languages. In FSTTCS'93: Proceedings 13th Conf. on Foundations of Software Technology and Theoretical Computer Science, 1993.

    Google Scholar 

  75. Boi Faltings. Arc-consistency for Continuous Variables. Artificial Intelligence, 65:363–376, 1994.

    Google Scholar 

  76. Hélène Fargier and Jérôme Lang. Uncertainty in Constraint Satisfaction Problems: A Probabilistic Approach. In ESQARU'93, Grenada. LNCS 747. Springer, November 1993.

    Google Scholar 

  77. Hélène Fargier, Jérôme Lang, and Thomas Schiex. Selecting Preferred Solutions in Fuzzy Constraint Satisfaction Problems. In EUFIT'93: Proceedings of the First European Congress on Fuzzy and Intelligent Technologies, Germany, 1993.

    Google Scholar 

  78. R. Feldman and M. Golumbic. Optimization algorithms for student scheduling via constraint satisfiability. Comput. J., 33:356–364, 1990.

    MathSciNet  Google Scholar 

  79. Mark Fox. Constraint-Directed Search: A Case Study of Job-Shop Scheduling. Morgan Kaufmann, Los Altos, California, 1987.

    Google Scholar 

  80. Bjorn Freeman-Benson. Multiple Solutions from Constraint Hierarchies. Technical Report 88-04-02, University of Washington, Seattle, WA, April 1988.

    Google Scholar 

  81. Bjorn Freeman-Benson. Constraint Imperative Programming. Technical Report 91-07-02, University of Washington, Seattle, July 1991. (PhD Dissertation).

    Google Scholar 

  82. Bjorn Freeman-Benson and Alan Borning. The Design and Implementation of Kaleidoscope'90: A Constraint Imperative Programming Language. In Proceedings IEEE Computer Society International Conference on Computer Languages, pages 174–180, Oakland, April 1992.

    Google Scholar 

  83. Bjorn Freeman-Benson and John Maloney. The DeltaBlue Algorithm: An Incremental Constraint Hierarchy Solver. In Proceedings of the Eighth Annual IEEE Phoenix Conference on Computers and Communications, Scottsdale, Arizona, March 1989. IEEE.

    Google Scholar 

  84. Bjorn Freeman-Benson, John Maloney, and Alan Borning. An Incremental Constraint Solver. Communications of the ACM, 33(1):54–63, January 1990.

    Article  Google Scholar 

  85. Bjorn Freeman-Benson, Molly Wilson, and Alan Borning. DeltaStar: A General Algorithm for Incremental Satisfaction of Constraint Hierarchies. In Proceedings 11th IEEE Phoenix Conference on Computers and Communications, pages 561–568, Scottsdale, Arizona, April 1992.

    Google Scholar 

  86. Eugene Freuder. Synthesizing Constraint Expressions. CACM, 21(11), 1978.

    Google Scholar 

  87. Eugene Freuder. A Sufficient Condition for Backtrack-Free Search. Journal of the ACM, 29(1):24–32, January 1982.

    Google Scholar 

  88. Eugene Freuder. Backtrack-free and Backtrack-bounded Search. In Kanal and Kumar, editors, Search in Artificial Intelligence. Springer-Verlag, 1988.

    Google Scholar 

  89. Eugene Freuder. Partial Constraint Satisfaction. In IJCAI'89: Proceedings 11th International Joint Conference on Artificial Intelligence, pages 278–283, August 1989.

    Google Scholar 

  90. Eugene Freuder. Exploiting Structure in Constraint Satisfaction Problems. In B. Mayoh, E. Tyugu, and J.Penjaam, editors, Constraint Programming: Proceedings 1993 NATO ASI Parnu, Estonia, NATO Advanced Science Institute Series, pages 54–79. Springer, 1994

    Google Scholar 

  91. Eugene Freuder and Richard Wallace. Partial Constraint Satisfaction. Artificial Intelligence, 58:21–70, 1992. (Reprinted in Eugene Freuder and Alan Mackworth, editors, Constraint-Based Reasoning, MIT Press, 1994. Also reprinted in [133]).

    MathSciNet  Google Scholar 

  92. D. Frost and R. Dechter. Dead-End Driven Learning. In Proceedings AAAI-94, pages 294–300, 1994.

    Google Scholar 

  93. Thom Frühwirth, Alexander Herold, Volker Küchenhoff, Thierry Le Provost, Pierre Lim, Eric Monfroy, and Mark Wallace. Constraint Logic Programming: An Informal Introduction. In G. Comyn, N. E. Fuchs, and M. J. Ratcliffe, editors, Logic Programming in Action, LNCS 636, pages 3–35. Springer, 1992. (Also available as Technical Report ECRC-93-5).

    Google Scholar 

  94. Michel Gangnet and Burton Rosenberg. Constraint Programming and Graph Algorithms. In 2nd International Symposium on Artificial Intelligence and Mathematics, January 1992.

    Google Scholar 

  95. M. Garey, D. Johnson, and L. Stockmeyer. Some Simplified NP-complete Graph Problems. Theoretical Computer Science, 1:237–267, 1976.

    Article  Google Scholar 

  96. Esther Gelle and Ian Smith. Dynamic Constraint Satisfaction with Conflict Management in Design. In [133].

    Google Scholar 

  97. Khaled Ghedira. Dynamic Partial Constraint Satisfaction by Multi-Agent and Simulated Annealing. In Thomas Schiex and Christian Bessiére, editors, Proceedings ECAI'94 Workshop on Constraint Satisfaction Issues raised by Practical Applications, Amsterdam, August 1994.

    Google Scholar 

  98. Matthew Ginsberg, editor. Readings in Nonmonotonic Reasoning. Morgan Kaufmann, Los Altos, California, 1987.

    Google Scholar 

  99. F. Glover. Tabu Search: A Tutorial. Interfaces, 20:74–94, 1990.

    Google Scholar 

  100. Lluis Godo and Lluis Vila. Possibilistic Temporal Reasoning Based on Fuzzy Temporal Constraints. In Chris Mellish, editor, IJCAI'95: Proceedings International Joint Conference on Artificial Intelligence, Montreal, August 1995.

    Google Scholar 

  101. H.-J. Goltz. Reducing Domains for Search in CLP(FD) and its Application to Job-shop Scheduling. In Ugo Montanari and Francesca Rossi, editors, CP'95: Proceedings of the First International Conference on Principles and Practice of Constraint Programming 1995, LNCS 976, pages 549–562. Springer, 1995.

    Google Scholar 

  102. James A. Gosling. Algebraic Constraints. PhD thesis, Carnegie-Mellon University, May 1983. Published as CMU Computer Science Department Technical Report CMU-CS-83-132.

    Google Scholar 

  103. Harvey J. Greenberg. Diagnosing Infeasibility in Min-Cost Network Flow Problems Part I: Dual Infeasibility. IMA Journal of Mathematics Applied in Business and Industry, 1:99–109, 1987.

    Google Scholar 

  104. Harvey J. Greenberg. Diagnosing Infeasibility in Min-Cost Network Flow Problems Part II: Primal Infeasibility. IMA Journal of Mathematics Applied in Business and Industry, 2:39–50, 1988/89.

    Google Scholar 

  105. Harvey J. Greenberg. An Empirical Analysis of Infeasibility Diagnosis for Instances of Linear Programming Blending Models. IMA Journal of Mathematics Applied in Business and Industry, 4:163–210, 1992.

    Google Scholar 

  106. Harvey J. Greenberg. How to Analyze the Results of Linear Programs Part 3: Infeasibility Diagnosis. Technical report, Mathematics Department, University of Colorado at Denver, February 1993. (Revised from December 1992 and January 1993).

    Google Scholar 

  107. Harvey J. Greenberg and Frederic H. Murphy. Approaches to Diagnosing Infeasible Linear Programs. ORSA Journal on Computing, 3(3):253–261, Summer 1991.

    Google Scholar 

  108. H.W. Guesgen. A Formal Framework for Weak Constraint Satisfaction Based on Fuzzy Sets. In Proc. ANZIIS-94, pages 199–203, Brisbane, Australia, 1994.

    Google Scholar 

  109. H.W. Guesgen and J. Hertzberg. A Perspective of Constraint-Based Reasoning. LNAI 597. Springer, Berlin, Germany, 1992.

    Google Scholar 

  110. H.W. Guesgen and J. Hertzberg. A Constraint-based Approach to Spatiotemporal Reasoning. Applied Intelligence (Special Issue on Applications of Temporal Models), 3:71–90, 1993.

    Google Scholar 

  111. Paul Halmos. Naive Set Theory. Springer, 1974.

    Google Scholar 

  112. Djamila Haroud, S. Boulanger, E. Gelle, and I. Smith. Strategies for Conflict Management in Preliminary Engineering Design. AIEDAM Special Issue on Conflict Management in Design, 1995, pages 313–323.

    Google Scholar 

  113. Djamila Haroud and Boi Faltings. Global Consistency for Continuous Constraints. Proc. of the ECAI-94, 1994.

    Google Scholar 

  114. Alois Haselböck, Thomas Havelka, and Markus Stumptner. Revising Inconsistent Variable Assignments in Constraint Satisfaction Problems. In Manfred Meyer, editor, Constraint Processing: Proceedings of the International Workshop at CSAM'93, St. Petersburg, July 1993, Research Report RR-93-39, pages 113–122, DFKI Kaiserslautern, August 1993.

    Google Scholar 

  115. Nevin C. Heintze, Spiro Michaylov, Peter J. Stuckey, and Roland H.C. Yap. The CLP(R) Programmer's Manual, Version 1.2. IBM Thomas J. Watson Research Center, PO Box 704, Yorktown Heights, NY 10598, U.S.A., September 1992.

    Google Scholar 

  116. J. Hertzberg, H.W. Guesgen, A. Voß, M. Fidelak, and H. Voß. Relaxing Constraint Networks to Resolve Inconsistencies. In GWAI'88, pages 61–65, Eringerfeld, Germany, 1988.

    Google Scholar 

  117. H. Hosobe, K. Miyashita, S. Takahashi, S. Matuoka, and A. Yonezawa. Locally Simultaneous Constraint Satisfaction. In Alan Borning, editor, Principles and Practice of Constraint Programming, LNCS 874. Springer, May 1994. (PPCP'94: Second International Workshop, Orcas Island, Seattle, USA).

    Google Scholar 

  118. Walter Hower. Proper Constraint Relaxation. In João Martins and Ernesto Morgado, editors, EPIA '89: 4th Portuguese Conference on Artificial Intelligence, volume 2, Lisbon, September 1989.

    Google Scholar 

  119. Walter Hower. The Relaxation of Unsolvable CSPs: General Problem Formulation and Specific Illustration in the Scheduling Domain. In Workshop on Constraint Processing at IJCAI'89, page 154, Detroit, aug 1989. (Abstract).

    Google Scholar 

  120. Walter Hower. Sensitive Relaxation of an Overspecified Constraint Network. In ISAI'89: 2nd International Symposium on Artificial Intelligence, Monterrey, Mexico, October 1989.

    Google Scholar 

  121. Walter Hower. On Conflict Resolution in Inconsistent Constraint Networks. Forschungsbericht AIDA-90-02, Fachgebiet Intellektik, Fachbereich Informatik, Technische Hochschule Darmstadt, April 1990.

    Google Scholar 

  122. S. Huard and E. Freuder. A debugging assistant for incompletely specified constraint network knowledge bases. International Journal of Expert Systems, 6(4):419–446, JAI Press, 1993.

    Google Scholar 

  123. Paul Hubbe and Eugene Freuder. An efficient cross-product representation of the constraint satisfaction problem search space. In AAAI'92, pages 421–427, San Jose, CA, 1992.

    Google Scholar 

  124. Tien Huynh and Catherine Lassez. A CLP(\(\mathcal{R}\)) Options Trading Analysis System. In Robert A. Kowalski and Kenneth A. Bowen, editors, JICSLP'88: Proceedings 5th International Conference and Symposium on Logic Programming, pages 59–69, Seattle, Washington, U.S.A., 1988. MIT Press.

    Google Scholar 

  125. James Ignizio. Generalized Goal Programming. Computers and Operations Research, 10(4):277–290, 1983.

    Google Scholar 

  126. James Ignizio. Introduction to Linear Goal Programming. Sage Publications, Beverly Hills, 1985. Sage University Paper Series on Qualitative Applications in the Social Sciences, 07–056.

    Google Scholar 

  127. Joxan Jaffar and Jean-Louis Lassez. Constraint Logic Programming. Technical Report 86/74, Monash University, Victoria, Australia, June 1986.

    Google Scholar 

  128. Joxan Jaffar and Jean-Louis Lassez. Constraint Logic Programming. In POPL'87: Proceedings 14th ACM Symposium on Principles of Programming Languages, pages 111–119, Munich, 1987. ACM.

    Google Scholar 

  129. Joxan Jaffar and Michael Maher. Constraint Logic Programming: A Survey. Journal of Logic Programming, 19/20:503–581, 1994.

    Article  Google Scholar 

  130. Joxan Jaffar, Spiro Michaylov, Peter Stuckey, and Roland Yap. The CLP(\(\mathcal{R}\)) Language and System. TOPLAS: ACM Transactions on Programming Languages and Systems, 14(3):339–395, July 1992.

    Google Scholar 

  131. Michael Jampel. A Compositional Theory of Constraint Hierarchies (Operational Semantics). In [133].

    Google Scholar 

  132. Michael Jampel. Over-Constrained Systems. PhD thesis, Department of Computer Science, City University, 1996. (To be submitted.)

    Google Scholar 

  133. Michael Jampel, Eugene Freuder, and Michael Maher, editors. Over-Constrained Systems, LNCS. Springer, August 1996.

    Google Scholar 

  134. Michael Jampel and David Gilbert. Fair Hierarchical Constraint Logic Programming. In Manfred Meyer, editor, Proceedings ECAI'94 Workshop on Constraint Processing, Amsterdam, August 1994.

    Google Scholar 

  135. Michael Jampel and Sebastian Hunt. Composition in Hierarchical CLP. In Chris Mellish, editor, IJCAI'95: Proceedings International Joint Conference on Artificial Intelligence, Montreal, August 1995.

    Google Scholar 

  136. Michael Jampel, Jean-Marie Jacquet, and David Gilbert. A General Framework for Integrating HCLP and PCSP. In Walter Hower and Zsofi Ruttkay, editors, ECAI'96 Workshop on Non-Standard Constraint Processing, Budapest, August 1996.

    Google Scholar 

  137. Michael Jampel, Jean-Marie Jacquet, David Gilbert, and Sebastian Hunt. Transformations between HCLP and PCSP. In Eugene Freuder, editor, CP'96: Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming. Springer, August 1996.

    Google Scholar 

  138. P. Janssen, P. Jégou, B. Nougier, M.C. Vilarem, and B. Castro. SYNTHIA: Assisted Design of Peptide Synthesis Plans. New Journal of Chemistry, 14-12:969–976, 1990.

    Google Scholar 

  139. Philippe Jégou. A Logical Approach to Solve Dynamic CSPs: Preliminary Report. In Thomas Schiex and Christian Bessiére, editors, Proceedings ECAI'94 Workshop on Constraint Satisfaction Issues raised by Practical Applications, Amsterdam, August 1994.

    Google Scholar 

  140. Narendra Jussien and Patrice Boizumault. Implementing Constraint Relaxation over Finite Domains using ATMS. In [133].

    Google Scholar 

  141. Johan de Kleer. An Assumption-Based TMS. Artificial Intelligence, 28:127–162, 1986.

    Article  Google Scholar 

  142. Johan de Kleer. A Comparison of ATMS and CSP Techniques. In IJCAI-89: Proceedings 11th International Joint Conference on Artificial Intelligence, pages 290–296, Detroit, 1989.

    Google Scholar 

  143. M. Kosaka and H. Mizuno et. al. Applications of Fuzzy Logic/Neural Networks to Securities Trading Decision Support Systems. IEEE Transactions, 1991. (Systems Development Laboratory, Hitachi Ltd, Japan).

    Google Scholar 

  144. Antonis Kotzamanidis. Intelligent Backtracking in Logic Programming with Constraints over the Real Numbers. PhD thesis, Department of Computing, Imperial College, London, October 1995.

    Google Scholar 

  145. M. Krentel. The complexity of optimization problems. Journal of Computer and System Sciences, 36:490–509, 1988.

    Google Scholar 

  146. V. Kumar. Algorithms for constraint satisfaction problems: a survey. AI Magazine, 13(1), 1992.

    Google Scholar 

  147. M. Lacroix and P. Lavency. Preferences: Putting more knowledge into queries. In Proceedings 15th International Conference on Very Large Databases, pages 217–225, Brighton, 1987.

    Google Scholar 

  148. D. Lehmann. Another Perspective on Default Reasoning. Technical report, Leibniz Center for Research in Computer Science. Hebrew University of Jerusalem. Israel, 1992.

    Google Scholar 

  149. Qiangyi Luo, Peter Hendry, and Iain Buchanan. A New Algorithm for Dynamic Distributed Constraint Satisfaction Problems. Technical Report KEG-4-92, University of Strathclyde, February 1992.

    Google Scholar 

  150. Alan Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1):99–118, 1977.

    Article  Google Scholar 

  151. Alan Mackworth. Encyclopedia of AI, chapter Constraint Satisfaction, pages 205–211. Springer Verlag, 1988.

    Google Scholar 

  152. Alan Mackworth and Eugene Freuder. The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems. Artificial Intelligence, 25:65–73, 1985.

    Article  Google Scholar 

  153. Alan Mackworth and Eugene Freuder. The Complexity of Constraint Satisfaction Revisited. Artificial Intelligence, 59(1–2):57–62, February 1993. Special Volume on Artificial Intelligence in Perspective.

    Google Scholar 

  154. Michael Maher and Peter Stuckey. Expanding Query Power in Constraint Logic Programming Languages. In Ewing Lusk and Ross Overbeek, editors, NACLP'89: Proceedings North American Conference on Logic Programming, pages 20–37, Cleveland, Ohio, October 1989.

    Google Scholar 

  155. John Maloney. Using Constraints for User Interface Construction. PhD thesis, Department of Computer Science and Engineering, University of Washington, August 1991. Published as Department of Computer Science and Engineering Technical Report 91-08-12.

    Google Scholar 

  156. V.W. Marek and M. Truszczynski. Nonmonotonic Logic Springer-Verlag, 1993.

    Google Scholar 

  157. Kim Marriott and Peter Stuckey. Semantics of CLP Programs with Optimization. ACM TOPLAS, 1993.

    Google Scholar 

  158. R. Martin-Clouaire. CSP Techniques with Fuzzy Linear Contraints: Practical Issues. In EUFIT'93: Proceedings of the First European Congress on Fuzzy and Intelligent Technologies, Aachen, September 1993.

    Google Scholar 

  159. R. Martin-Clouaire. Dealing with Soft Constraints in a Constraint Satisfaction Problem. In Proceedings of the International Conference on Information Processing of Uncertainty in Knowledge based Systems, pages 37–40, Palma de Mallorca, July 1992.

    Google Scholar 

  160. Luděk Matyska. Logic Programming with Fuzzy Sets. Technical Report TCU/CS/1993/4, Department of Computer Science, City University, London, December 1993.

    Google Scholar 

  161. John McCarthy. Circumscription — A Form of Non-Monotonic Reasoning. Artificial Intelligence, 13(1,2):27–39, April 1980.

    Article  Google Scholar 

  162. Francisco Menezes and Pedro Barahona. Defeasible Constraint Solving. In [133].

    Google Scholar 

  163. Francisco Menezes, Pedro Barahona, and Philippe Codognet. An Incremental Hierarchical Constraint Solver. In Paris Kanellakis, Jean-Louis Lassez, and Vijay Saraswat, editors, PPCP'93: First Workshop on Principles and Practice of Constraint Programming, Providence RI, 1993.

    Google Scholar 

  164. Harald Meyer auf'm Hofe and Bidjan Tschaitschian. PCSPs with Hierarchical Constraint Orderings in Real World Scheduling Applications. In Michael Jampel, Eugene Freuder, and Michael Maher, editors, OCS'95: Workshop Notes, Workshop on Over-Constrained Systems at CP'95, Cassis, Marseilles, 18 September 1995.

    Google Scholar 

  165. S. Minton, M. D. Johnston, A. B. Philips, and P. Laird. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems. Artificial Intelligence, 58:161–205, 1992.

    MathSciNet  Google Scholar 

  166. Sanjay Mittal and Brian Falkenhainer. Dynamic Constraint Satisfaction Problems. In AAAI'90, pages 25–32, Boston, 1990.

    Google Scholar 

  167. R. Mohr and G. Masini. Good Old Discrete Relaxation. In ECAI'88, pages 651–656, Munich, 1988.

    Google Scholar 

  168. Ugo Montanari. Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Science, 7(2):95–132, 1974.

    Article  Google Scholar 

  169. Ugo Montanari and Francesca Rossi. Constraint Relaxation May Be Perfect. AI Journal, 48:143–170, 1991.

    Google Scholar 

  170. Ugo Montanari and Francesca Rossi. Constraint Satisfaction, Constraint Programming and Concurrency. In Paris Kanellakis, Jean-Louis Lassez, and Vijay Saraswat, editors, PPCP'93: First Workshop on Principles and Practice of Constraint Programming, Providence RI, 1993.

    Google Scholar 

  171. H. Moulin. Axioms for Cooperative Decision Making. Cambridge University Press, 1988.

    Google Scholar 

  172. Katta Murty. Linear Programming. Wiley, 1983.

    Google Scholar 

  173. B. A. Nadel. Constraint Satisfaction Algorithms. Comput. Intell., 5(4):188–224, November 1989.

    Google Scholar 

  174. G. Nelson. Juno, A Constraint-Based Graphics System. Computer Graphics, ACM SIGGRAPH, pages 235–243, 1985.

    Google Scholar 

  175. Bertrand Neveu. Contraintes et Problèmes Hiérarchiques. (Draft). In French, December 1993.

    Google Scholar 

  176. Francis Newberry Paulisch and Walter Tichy. Edge: An Extendible Graph Editor. Software — Practice and Experience, 20(S1):63–88, June 1990.

    Google Scholar 

  177. Hayato Ohwada and Fumio Mizoguchi. A Constraint Logic Programming Approach for Maintaining Consistency in User-Interface Design. In Proceedings of the 1990 North American Conference on Logic Programming, pages 139–153. MIT Press, October 1990.

    Google Scholar 

  178. P. J. Pacini and B. Kosko. Adaptive Fuzzy Systems for Target Tracking. Intelligent Systems Engineering, pages 3–21, Autumn 1992.

    Google Scholar 

  179. C. M. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company. 1994.

    Google Scholar 

  180. A. Philpott. Fuzzy Constraint Satisfaction. Master's thesis, University of Auckland, Auckland, New Zealand, 1995.

    Google Scholar 

  181. Patrick Prosser. Reactive Factory Scheduling as a Dynamic Constraint Satisfaction Problem. Technical Report AISL-31-88, University of Strathclyde, August 1988.

    Google Scholar 

  182. Patrick Prosser, Chris Conway, and Claude Muller. A Constraint Maintenance System for the Distributed Resource Allocation Problem. Intelligent Systems Engineering, pages 76–83, Autumn 1992.

    Google Scholar 

  183. J. Prust and W. Vonolfen. Dokumentation PARABOL 1.0. Unpublished documentation document, GMD, 1993.

    Google Scholar 

  184. A. Rauzy. Cedre version 0.2: User's Guide. Technical report, LaBRI URA CNRS 1304, 1994.

    Google Scholar 

  185. Raymond Reiter. A Logic for Default Reasoning. Artificial Intelligence, 13(1,2):81–132, April 1980.

    Article  Google Scholar 

  186. A. Robinson. Non-Standard Analysis. North-Holland Publishing Company, Amsterdam, 1966.

    Google Scholar 

  187. Azriel Rosenfeld, Robert Hummel, and Steven Zucker. Scene Labelling by Relaxation Operations. IEEE Trans. Sys. Man, and Cybern., 6(6), 1976.

    Google Scholar 

  188. Zsofia Ruttkay. Fuzzy Constraint Satisfaction. In Proceedings 3rd IEEE Conference on Fuzzy Systems, pages 1263–1268. IEEE, June 1994.

    Google Scholar 

  189. Mark Ryan. Defaults and Revision in Structured Theories. In LICS'91: Proceedings of IEEE Symposium on Logic in Computer Science, Amsterdam, July 1991.

    Google Scholar 

  190. Mark Ryan. Ordered Presentations of Theories. PhD thesis, Department of Computing, Imperial College, 1992.

    Google Scholar 

  191. Mark Ryan. Belief Revision and Ordered Theory Presentations. In A. Fuhrmann and H. Rott, editors, Logic, Language and Information. De Gruyter, 1994. (Presented at 8th Amsterdam Colloquium on Logic, December 1991).

    Google Scholar 

  192. Michael Sannella. The SkyBlue Constraint Solver and Its Applications. In Paris Kanellakis, Jean-Louis Lassez, and Vijay Saraswat, editors, PPCP'93: First Workshop on Principles and Practice of Constraint Programming, Providence RI, 1993.

    Google Scholar 

  193. Michael Sannella. Analyzing and Debugging Hierarchies of Multi-way Local Propagation Constraints. In Alan Borning, editor, Principles and Practice of Constraint Programming, LNCS 874. Springer, May 1994. (PPCP'94: Second International Workshop, Orcas Island, Seattle, USA).

    Google Scholar 

  194. Michael Sannella and Alan Borning. Multi-Garnet: Integrating Multi-Way Constraints with Garnet. Technical Report 92-07-01, Department of Computer Science and Engineering, University of Washington, September 1992.

    Google Scholar 

  195. Michael Sannella, John Maloney, Bjorn Freeman-Benson, and Alan Borning. Multi-way versus One-way Constraints in User Interfaces: Experience with the DeltaBlue Algorithm. Software—Practice and Experience, 23(5):529–566, May 1993.

    Google Scholar 

  196. Vijay Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, Computer Science Department, January 1989.

    Google Scholar 

  197. Vijay Saraswat, Johan de Kleer, and Brian Williams. ATMS-based Constraint Programming. Technical report, Xerox PARC, October 1991.

    Google Scholar 

  198. Ken Satoh. Formalizing Nonmonotonic Reasoning by Preference Order. Technical Report TR-440, ICOT, December 1988.

    Google Scholar 

  199. Ken Satoh. Formalizing Soft Constraints by Interpretation Ordering. In ECAI'90: Proceedings European Conference on Artifical Intelligence, 1990.

    Google Scholar 

  200. Ken Satoh and Akira Aiba. Computing Soft Constraints by Hierarchical Constraint Logic Programming. Technical Report TR-610, Institute for New Generation Computer Technology, Tokyo, January 1991. (Also Journal of Information Processing, 7, 1993).

    Google Scholar 

  201. Ken Satoh and Akira Aiba. The Hierarchical Constraint Logic Language CHAL. Technical Report TR-592, Institute for New Generation Computer Technology, Tokyo, September 1991.

    Google Scholar 

  202. Abdul Sattar, Aditya Ghose, and Randy Goebel. Specifying Over-Constrained Problems in Default Logic. In [133].

    Google Scholar 

  203. Thomas Schiex. Possibilistic Constraint Satisfaction Problems or “How to handle soft constraints”. In 8th International Conference on Uncertainty in Artificial Intelligence, Stanford, July 1992.

    Google Scholar 

  204. Thomas Schiex. Private Communication, April 1996.

    Google Scholar 

  205. Thomas Schiex, Hélène Fargier, and Gerard Verfaillie. Valued Constraint Satisfaction Problems: Hard and Easy Problems. In Chris Mellish, editor, IJCAI'95: Proceedings International Joint Conference on Artificial Intelligence, Montreal. Morgan Kaufman August 1995.

    Google Scholar 

  206. Thomas Schiex and Gérard Verfaillie. No-Good Recording for Static and Dynamic CSP. In ICTAI'93: Proceeding of the 5th IEEE International Conference on Tools with Artificial Intelligence, pages 48–55, Boston, November 1993.

    Google Scholar 

  207. Thomas Schiex and Gérard Verfaillie. Nogood Recording for Static and Dynamic Constraint Satisfaction Problems. International Journal of Artificial Intelligence Tools, 3(2): 187–207, 1994.

    Google Scholar 

  208. Thomas Schiex and Gérard Verfaillie. Stubborness: An Enhancement Scheme for Backjumping and Nogood Recording. In ECAI'94, pages 165–169, Amsterdam, August 1994.

    Google Scholar 

  209. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, 1986.

    Google Scholar 

  210. B. Selman and H. A. Kautz. An Empirical Study of Greedy Local Search for Satisfiability Testing. In Proceedings AAAI-93, pages 46–51, 1993.

    Google Scholar 

  211. B. Selman, H. Levesque, and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. In AAAI'92, pages 440–446, San Jose, July 1992.

    Google Scholar 

  212. G. Shafer. An Axiomatic Study of Computation in Hypertrees. Working paper 232, University of Kansas, School of Business, Lawrence, 1991.

    Google Scholar 

  213. Linda Shapiro and Robert Haralick. Structural Descriptions and Inexact Matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 3:504–519, 1981.

    Google Scholar 

  214. Wolfgang Slany. Fuzzy Scheduling Bibliography. Available by ftp as mira.dbai.tuwien.ac.at:/pub/slany/fuzzy-scheduling.ps.Z, and also by email from listproc@vexpert.dbai.tuwien.ac.at with the message body “GET LISTPROC fuzzy-scheduling.bib”.

    Google Scholar 

  215. Paul Snow and Eugene Freuder. Improved Relaxation and Search Methods for Approximate Constraint Satisfaction with a Maximin Criterion. In Proc. of the 8th Biennal Conf. of the Canadian Society for Comput. Studies of Intelligence, pages 227–230, May 1990.

    Google Scholar 

  216. Guy Steele. The Definition and Implementation of a Computer Programming Language Based on Constraints. PhD thesis, MIT, August 1980. Published as MIT-AI TR 595, August 1980.

    Google Scholar 

  217. Ivan Sutherland. Sketchpad: A Man-machine Graphical Communication System. In Proceedings of the Spring Joint Computer Conference, pages 329–346. IFIPS, 1963.

    Google Scholar 

  218. Gilles Trombettoni. CCMA*: A Complete Constraint Maintenance Algorithm Using Constraint Programming. In Manfred Meyer, editor, Constraint Processing: Proceedings of the International Workshop at CSAM'93, St. Petersburg, July 1993, Research Report RR-93-39, pages 123–132, DFKI Kaiserslautern, August 1993.

    Google Scholar 

  219. Fujio Tsusumi. An Efficient Algorithm of Logic Programming with Constraint Hierarchy. In Jean-Pierre Jouannaud, editor, CCL'94: Proceedings 1st International Conference on Constraints in Computational Logics, Munich, LNCS 854, pages 170–182. Springer, September 1994.

    Google Scholar 

  220. Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, MA, 1989.

    Google Scholar 

  221. Pascal Van Hentenryck. Incremental Constraint Satisfaction in Logic Programming. In ICLP'90: Proceedings 7th International Conference on Logic Programming, pages 189–202, Jerusalem, June 1990. MIT Press.

    Google Scholar 

  222. Pascal Van Hentenryck, Yves Deville, and Choh-Man Teng. A Generic Arcconsistency Algorithm and its Specializations. Artificial Intelligence, 57(2–3):291–321, October 1992.

    Article  Google Scholar 

  223. Pascal Van Hentenryck and Thierry Le Provost. Incremental Search in Contraint Logic Programming. New Generation Computing, 9:257–275, 1991.

    Google Scholar 

  224. Bradley Vander Zanden. An Incremental Planning Algorithm for Ordering Equations in a Multilinear system of Constraints. PhD thesis, Department of Computer Science, Cornell University, April 1988.

    Google Scholar 

  225. N.R. Vempaty. Solving Constraint Satisfaction Problems using Finite State Automata. AAAI, San Jose, USA:453–458, 1992.

    Google Scholar 

  226. Gerard Verfaillie and Thomas Schiex. Dynamic Backtracking for Dynamic CSPs. In Thomas Schiex and Christian Bessière, editors, Proceedings ECAI'94 Workshop on Constraint Satisfaction Issues raised by Practical Applications, Amsterdam, August 1994.

    Google Scholar 

  227. Gerard Verfaillie and Thomas Schiex. Solution Reuse in Dynamic Constraint Satisfaction Problems. In AAAI'94: Proceedings of the National Conference on Artificial Intelligence, pages 307–312, August 1994.

    Google Scholar 

  228. Richard Wallace. Directed Arc Consistency Preprocessing as a Strategy for Maximal Constraint Satisfaction. In Manfred Meyer, editor, Proceedings ECAI'94 Workshop on Constraint Processing, Amsterdam, August 1994.

    Google Scholar 

  229. Richard Wallace. Cascaded Directed Arc Consistency and No-Good Learning for the Maximal Constraint Satisfaction Problem. In [133].

    Google Scholar 

  230. Richard Wallace and Eugene Freuder. Conjunctive Width Heuristics for Maximal Constraint Satisfaction. In AAAI-93: Proceedings of the 11th National Conference on Artificial Intelligence, Washington, DC, 1993. American Association for Artificial Intelligence.

    Google Scholar 

  231. Richard Wallace and Eugene Freuder. Applying Algorithms for Constraint Satisfaction to Maximum Satisfiability. In Thomas Schiex and Christian Bessière, editors, Proceedings ECAI'94 Workshop on Constraint Satisfaction Issues raised by Practical Applications, Amsterdam, August 1994.

    Google Scholar 

  232. Richard Wallace and Eugene Freuder. Comparing Constraint Satisfaction and Davis-Putnam Algorithms for the Maximal Satisfiability Problem. In D. S. Johnson and M. A. Trick, editors, Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, (to appear). Amer. Math. Soc., 1996.

    Google Scholar 

  233. Richard Wallace and Eugene Freuder. Heuristic Methods for Over-Constrained Constraint Satisfaction Problems. In [133].

    Google Scholar 

  234. Rolf Weißschnur. Die Projektion von Constraint-Satisfaction-Problemen auf Boltzmann-Maschinen. Master's thesis, Universität Bonn, Institut für Informatik, May 1994.

    Google Scholar 

  235. Rolf Weissschnur, Joachim Hertzberg, and Hans Werner Guesgen. Experiences in Solving Constraint Relaxation Networks with Boltzmann Machines. In [133].

    Google Scholar 

  236. Molly Wilson. Hierarchical Constraint Logic Programming. PhD thesis, University of Washington, Seattle, May 1993. (Also available as University of Washington Technical Report 93-05-01).

    Google Scholar 

  237. Molly Wilson and Alan Borning. Extending Hierarchical Constraint Logic Programming: Nonmonotonicity and Inter-Hierarchy Comparison. In Ewing Lusk and Ross Overbeek, editors, NACLP'89: Proceedings North American Conference on Logic Programming, pages 3–19, Cleveland, Ohio, 1989.

    Google Scholar 

  238. Molly Wilson and Alan Borning. Hierachical Constraint Logic Programming. The Journal of Logic Programming, 16(3 & 4):277–318, July and August 1993.

    Google Scholar 

  239. Armin Wolf. Transforming Ordered Constraint Hierarchies into Ordinary Constraint Systems. In [133].

    Google Scholar 

  240. Christopher van Wyk. A Language for Typesetting Graphics. PhD thesis, Department of Computer Science, Stanford, June 1980.

    Google Scholar 

  241. Karine Yvon. A Solver for Fair Hierarchical Constraint Logic Programming. BSc Final Year Project, Department of Computer Science, City University, London, June 1995.

    Google Scholar 

  242. Lotfi Zadeh. Fuzzy Sets. Information and Control, 8:338–353, 1965.

    Article  Google Scholar 

  243. Lotfi Zadeh. Calculus of Fuzzy Restrictions. In K. Tanaka L.A. Zadeh, K.S. Fu and M. Shimura, editors, Fuzzy Sets and Their Applications to Cognitive and Decision Processes. Academic Press, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, City University, Northampton Square, EC1V 0HB, London, UK

    Michael Jampel

Authors
  1. Michael Jampel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Jampel Eugene Freuder Michael Maher

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jampel, M. (1996). A brief overview of over-constrained systems. In: Jampel, M., Freuder, E., Maher, M. (eds) Over-Constrained Systems. OCS 1995. Lecture Notes in Computer Science, vol 1106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61479-6_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-61479-6_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61479-1

  • Online ISBN: 978-3-540-68601-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation