Skip to main content
SpringerLink
Log in

Constraint Programming Techniques for Solving Problems on Graphs

  • Conference paper
  • First Online:
Book cover Perspectives of System Informatics (PSI 1999)

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

  • 252 Accesses

Abstract

In this paper we examine a technology for solving problems on graphs in the constraint programming framework called Subdefinite Models. We describe in brief the mechanism of constraint propagation underlying it. We present in detail the facilities for specification of graph problems as Subdefinite models. We discuss a class of graph problems with emphasizing on ones having not discussed before

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mayoh, B.: Constraint Programming and Artificial Intelligence: In: Mayoh, B., Tyugu, E., Penjaam, J. (eds.): Constraint Programming: Proceedings 1993 NATO ASI Parnu, Estonia. Springer-Verlag, Berlin Heidelberg New York (1993) 18–53

    Google Scholar 

  2. Narin’yani, A. S.: Subdefiniteness and Basic Means of Knowledge Representation. Computers and Artificial Intelligence, Bratislawa 2, No.5 (1983) 443–452

    Google Scholar 

  3. Ushakov, D.: Some Formal Aspects of Subdefinite Models. Preprint Institute of Informatics Systems, Novosibirsk 49 (1998)

    Google Scholar 

  4. Telerman, V., Ushakov, D.: Data Types in Subdefinite Models. In: Calmet, J., Campbell, J. A., Pfalzgraf, J. (eds.): Artificial Intelligence and Symbolic Mathematical Computation: Proceedings. Lecture Notes in Computer Science, Vol. 1138. Springer-Verlag, Berlin Heidelberg New York (1996) 305–319

    Google Scholar 

  5. Telerman, V., Ushakov, D.: Constraint Satisfaction Techniques for Mathematical Programming Problems. In: Proceedings of International Conference on Interval Methods and their Application in Global Optimization, INTERVAL’98. Nanjing, China (1998)

    Google Scholar 

  6. Telerman, V., Sidorov, V., Ushakov, D.: Problem Solving in the Object-Oriented Technological Environment NeMo+. In: Bjørner, D., Broy, M., Pottosin, I. V. (eds.): Perspectives of System Informatics: Proceedings. Lecture Notes in Computer Science, Vol. 1181. Springer-Verlag, Berlin Heidelberg New York (1996) 91–100

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A. P. Ershov Institute of Informatics Systems, 6, Acad. Lavrentjev pr., Novosibirsk, 630090, Russia

    Vladimir Sidorov & Vitaly Telerman

  2. Russian Research Institute of Artificial Intelligence, 6, Acad. Lavrentjev pr., Novosibirsk, 630090, Russia

    Dmitry Ushakov

Authors
  1. Vladimir Sidorov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vitaly Telerman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dmitry Ushakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information Technology, Technical University of Denmark, Bldg. 244, 2800, Lyngby, Denmark

    Dines Bjøner

  2. Computer Science Department, Technical University of Munich, Arcisstr. 21, 80290, Munich, Germany

    Manfred Broy

  3. A.P. Ershov Institute of Informatics Systems, av. Ac. Lavrentyev 6, Novosibirsk, 630090, Russia

    Alexandre V. Zamulin

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sidorov, V., Telerman, V., Ushakov, D. (2000). Constraint Programming Techniques for Solving Problems on Graphs. In: Bjøner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 1999. Lecture Notes in Computer Science, vol 1755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46562-6_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-46562-6_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67102-2

  • Online ISBN: 978-3-540-46562-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation