Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Innovative and Interdisciplinary Applications of Advanced Technologies

IAT 2018: Advanced Technologies, Systems, and Applications III pp 430–438Cite as

Constraint Satisfaction Problem: Generating a Schedule for a Company Excursion

  • Conference paper
  • First Online:

  • 657 Accesses

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 60))

Abstract

A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint satisfaction problem. A number of different approaches have been developed for solving these problems. Some of them use backtracking to directly search for possible solutions. Intelligent backtracking is used in this paper, but the algorithm is not standard. A specific problem of organizing an excursion for a company’s employees is solved.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM 5, 394–397 (1962)

    Article  MathSciNet  Google Scholar 

  2. Golomb, S., Baumert, L.: Backtracking programming. J. ACM 12, 516–524 (1965)

    Article  Google Scholar 

  3. Gaschnig, J.: A Constraint satisfaction method for inference making. In: Twelfth Annual Allerton Conference on Circuit and System Theory, pp. 866-874, Monticello, Illinois (1974)

    Google Scholar 

  4. Mackworth, A.K.: Consistency in networks of relations. Artif. Intell. 8, 99–118 (1977)

    Article  Google Scholar 

  5. Mackworth, A.K.: On reading sketch maps. In: Fifth International Joint Conference on Artificial Intelligence, pp. 598-606, Cambridge, Mass (1977)

    Google Scholar 

  6. Stallman, R.M., Sussman, G.J.: Forward reasoning and dependency directed in a system for computer aided circuit analysis. Artif. Intell. 9, 135–196 (1977)

    Article  Google Scholar 

  7. Gaschnig, J.: Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisfying assignment problems. In: Proceedings of the Second Canadian Conference on Artificial Intelligence, pp. 268–277, Toronto (1978)

    Google Scholar 

  8. Prosser, P.: Hybrid algorithms for the constraint satisfaction problems. Comput. Intell. 9, 268–299 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sarajevo School of Science and Technology, Sarajevo, Bosnia and Herzegovina

    Mirna Udovičić & Nedžad Hafizović

Authors
  1. Mirna Udovičić
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nedžad Hafizović
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mirna Udovičić .

Editor information

Editors and Affiliations

  1. Faculty of Electrical Engineering, University of Sarajevo, Sarajevo, Bosnia and Herzegovina

    Samir Avdaković

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Udovičić, M., Hafizović, N. (2019). Constraint Satisfaction Problem: Generating a Schedule for a Company Excursion. In: Avdaković, S. (eds) Advanced Technologies, Systems, and Applications III. IAT 2018. Lecture Notes in Networks and Systems, vol 60. Springer, Cham. https://doi.org/10.1007/978-3-030-02577-9_42

Download citation

Publish with us

Policies and ethics

Search

Navigation