Skip to main content
SpringerLink
Log in

Solving and Learning Soft Temporal Constraints; Ceteris Paribus Statements Represented as Soft Constraints Problems

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming - CP 2002 (CP 2002)

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

  • 961 Accesses

Abstract

Soft temporal constraints problems (TCSPs) allow to describe in a natural way scenarios where events happen over time and preferences are associated to event distances and durations. However, sometimes such local preferences are difficult to set, and it may be easier instead to associate preferences to some complete solutions of the problem. The Constraint Satisfaction framework combined with Machine learning techniques can be useful in this respect. Soft constraints are useful in general for manipulating preferences. In particular it is possible to approximate CP nets, a graphical representation of ceteris paribus conditional preference statements, with semiring based soft constraints problems.

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

Similar content being viewed by others

References

  1. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Solving and Optimization. Journal of the ACM, 44(2):201–236, March 1997.

    Google Scholar 

  2. Craig Boutilier, Ronen I. Brafman, Holger H. Hoos, and David Poole. Reasoning with ceteris paribus preference statements. Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, pages 71–80, Stockholm, 1999.

    Google Scholar 

  3. F. Rossi, A Sperduti, K. B. Venable, L. Khatib, R. Morris, and Paul Morris. Solving and Learning Soft Temporal Constraints: Experimental Setting and Results. Proceedings of Constraint Programming Conference CP 2002, Ithaca, NY, 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Padova, Italy

    Kristen B. Venable

Authors
  1. Kristen B. Venable
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Brown University, Box 1910, Providence, RI, 02912, USA

    Pascal Van Hentenryck

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Venable, K.B. (2002). Solving and Learning Soft Temporal Constraints; Ceteris Paribus Statements Represented as Soft Constraints Problems. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_74

Download citation

  • DOI: https://doi.org/10.1007/3-540-46135-3_74

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44120-5

  • Online ISBN: 978-3-540-46135-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation