Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 81, 2004 - Issue 12
Submit an article Journal homepage
41
Views
1
CrossRef citations to date
0
Altmetric
Miscellany

A new approach to partial constraint satisfaction problems

D. K. GuptaDepartment of Mathematics, I.I.T. Kharagpur, Kharagpur, 721302, India
&
N. Gupta † Department of Electronics and Communication Engineering, B.I.T. Mesra, Ranchi, Jharkhand, 835215, India
Pages 1465-1476 | Received 10 Jun 2004, Accepted 15 Jul 2004, Published online: 25 Jan 2007

  • Freuder, EC, and Wallace, RJ, (1992). Partial constraint satisfaction, Artificial Intelligence 58 ((1992)), pp. 21–70.
  • Hower, H, (1989). "Sensitive relaxation of an overspecified constraint network". In: Proc. of Second International Symposium on Artificial Intellegence. Monterry, Mexico. (1989), In:.
  • Adorf, HM, and Johnston, MD, (1990). "A discrete stochastic neural network for constraint satisfaction problems". In: Proceedings of International Joint Conference on Neural Networks. San Diego, CA. (1990).
  • Descotte, Y, and Latombe, JC, (1985). Making compromises among antagonistic constraints in a planner, Artificial Intelligence 27 ((1985)), pp. 185–217.
  • Shapiro, LG, and Haralick, RM, (1981). Structural descriptions and inexact matching, IEEE Trans. Pattern Analysis Machine Intelligence 3 ((1981)), pp. 504–519, PAMI.
  • Cooper, M, (1991). "Visual occulusion and interpretation of ambiguous pictures". In: Ellis Horwood. Chichester. (1991).
  • Lui, B, and Looi, CK, (1991). "Relaxed constraint satisfaction". In: Proc. of International Symposium on Artificial Intelligence. Cancun, Mexico. (1991). p. pp. 276–282.
  • Smith, BM, and Bennett, S, (1992). "Combining constraint satisfaction and local improvement algorithms to construct anaesthetists’ rotas". In: Proc. of the Eight Conference on Artificial Intelligence for Applications. Monterey, CA. (1992). p. pp. 116–112.
  • Dechter, R, Dechter, A, and Pearl, J, (1990). "Optimization in constraint networks". In: Influence Diagrams, Belief Nets and Decision Analysis, Wiley. NY. (1990). p. pp. 411–425, In: R. M. Oliver and J. Q. Smith (eds.).
  • Reingold, EM, Nievergelt, J, and Deo, N, (1977). "Combinatorial Algorithms: Theory and Practice". In: Prentice-Hall Inc. Englewood Cliffs, NJ. (1977).
  • Lawler, EW, and Wood, DE, (1966). Branch and Bound methods: a survey, Operations Research 14 ((1966)), pp. 699–719.
  • Hall, PAV, (1971). "Branch and Bound and beyond". In: Proc. International Joint Conference on Artificial Intelligence. (1971). p. pp. 641–650.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.