Skip to main content
SpringerLink
Log in
SpringerLink
Log in

A System Prototype for Solving Multi-granularity Temporal CSP

  • Conference paper
Recent Advances in Constraints (CSCLP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3419))

Abstract

Time granularity constraint reasoning is likely to have a relevant role in emerging applications like GIS, time management in the Web and Personal Information Management applications for mobile systems. This paper reports recent advances in the development of a system for solving temporal constraint satisfaction problems where distance constraints are specified in terms of arbitrary time granularities.

This work has been partially supported by Italian MIUR (FIRB “Web-Minds” project N. RBNE01WEJT_005).

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bessière, C.: Arc-Consistency and Arc-Consistency Again. Artificial Intelligence 65(1), 179–190 (1994)

    Article  Google Scholar 

  2. Bettini, C., Mascetti, S., Pupillo, V.: GSTP: A Temporal Reasoning System Supporting Multi-Granularity Temporal Constraints. In: Proc. of Int. Joint Conference on Artificial Intelligence (IJCAI) (Intelligent Systems Demonstrations), pp. 1633–1634. Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

  3. Bettini, C., Wang, X., Jajodia, S.: A General Framework for Time Granularity and its Application to Temporal Reasoning. Annals of Mathematics and Artificial Intelligence 22(1-2), 29–58 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bettini, C., Ruffini, S.: Granularity Conversion of quantitative temporal constraints DICo – Università di Milano, Technical Report N. 276-02, http://homes.dico.unimi.it/~bettini/papers/tr276-02.pdf

  5. Bettini, C., Wang, X., Jajodia, S.: Solving Multi-Granularity constraint networks. Artificial Intelligence 140(1-2), 107–152 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chen, H.: Periodic Constraint Satisfaction Problems: Polynomial-Time Algorithms. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 199–213. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  8. Mackworth, A., Freuder, E.: The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence 25, 65–74 (1985)

    Article  Google Scholar 

  9. Mackworth, A.K., Mulder, J.A., Havens, W.S.: Hierarchical Arc Consistency: Exploiting Structured Domains in Constraint Satisfaction Problems. Computational Intelligence 1, 118–126 (1985)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DICo – Università di Milano, Italy

    Claudio Bettini, Sergio Mascetti & Vincenzo Pupillo

Authors
  1. Claudio Bettini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergio Mascetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vincenzo Pupillo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Artificial Intelligence Lab, Ecole Polytechnique Fédérale de Lausanne, Station 14, CH-1015, Lausanne, Switzerland

    Boi V. Faltings

  2. Ecole Polytechnique Federale de Lausanne (EPFL), CH-1015, Lausanne, (Switzerland)

    Adrian Petcu

  3. Projet Contraintes, INRIA Rocquencourt, BP105, Domaine de Voluceau, 78153, Le Chesnay Cedex, France

    François Fages

  4. Dipartimento di Matematica Pura ed Applicata, Università di Padova, Via Trieste 63, 35121, Padova, Italy

    Francesca Rossi

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bettini, C., Mascetti, S., Pupillo, V. (2005). A System Prototype for Solving Multi-granularity Temporal CSP. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds) Recent Advances in Constraints. CSCLP 2004. Lecture Notes in Computer Science(), vol 3419. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11402763_11

Download citation

  • DOI: https://doi.org/10.1007/11402763_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25176-7

  • Online ISBN: 978-3-540-32252-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation