Skip to main content
SpringerLink
Log in

Conditional and composite temporal CSPs

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Constraint Satisfaction Problems (CSPs) have been widely used to solve combinatorial problems. In order to deal with dynamic CSPs where the information regarding any possible change is known a priori and can thus be enumerated beforehand, conditional constraints and composite variables have been studied in the past decade. Indeed, these two concepts allow the addition of variables and their related constraints in a dynamic manner during the resolution process. More precisely, a conditional constraint restricts the participation of a variable in a feasible scenario while a composite variable allows us to express a disjunction of variables where only one will be added to the problem to solve. In order to deal with a wide variety of real life applications under temporal constraints, we present in this paper a unique temporal CSP framework including numeric and symbolic temporal information, conditional constraints and composite variables. We call this model, a Conditional and Composite Temporal CSP (or CCTCSP). To solve the CCTCSP we propose two methods respectively based on Stochastic Local Search (SLS) and constraint propagation. In order to assess the efficiency in time of the solving methods we propose, experimental tests have been conducted on randomly generated CCTCSPs. The results demonstrate the superiority of a variant of the Maintaining Arc Consistency (MAC) technique (that we call MAX+) over the other constraint propagation strategies, Forward Checking (FC) and its variants, for both consistent and inconsistent problems. It has also been shown that, in the case of consistent problems, MAC+ outperforms the SLS method Min Conflict Random Walk (MCRW) for highly constrained CCTCSPs while both methods have comparable time performance for under and middle constrained problems. MCRW is, however, the method of choice for highly constrained CCTCSPs if we decide to trade search time for the quality of the solution returned (number of solved constraints).

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alfonso MI, Barber F (2004) A mixed closure-CSP method for solving scheduling problems. Appl Intell 21(2):173–193

    Article  MATH  Google Scholar 

  2. Allen JF (1983) Maintaining knowledge about temporal intervals. CACM 26(11):832–843

    MATH  Google Scholar 

  3. Badaloni S, Giacomin M (1999) A fuzzy extension of Allen’s interval algebra. In: E. Lamma, P. Mello, (eds) Proc. of the 6th congress of the Italian assoc. for artificial intelligence, pp 228–237

  4. Baptiste P, Le Pape C (1995) Disjunctive constraints for manufacturing scheduling: principles and extensions. In: Third international conference on computer integrated manufacturing. Singapore

  5. Bettini C, Wang X, Jajodia S (1998) A general framework for time granularity and its application to temporal reasoning. Ann Math Artif Intell 22:29–58

    Article  MATH  MathSciNet  Google Scholar 

  6. Bettini C, Wang X, Jajodia S (2002) Solving multi-granularity temporal constraint networks. Artif Intell 140(1–2):107–152

    Article  MATH  MathSciNet  Google Scholar 

  7. Bodirsky M, Kára J (2010) The complexity of temporal constraint satisfaction problems. J Assoc Comput Mach 57(2):1–41

    Article  Google Scholar 

  8. Boerkoel JC Jr., Durfee EH (2009) Evaluating hybrid constraint tightening for scheduling agents. In: The proceedings of the 8th international conference on autonomous agents and multiagent systems, pp 673–680

  9. Dean T (1989) Using temporal hierarchies to efficiently maintain large temporal databases. J Assoc Comput Mach, pp 686–709

  10. Dechter R, Dechter A (1988) Belief maintenance in dynamic constraint networks. In: 7th national conference on artificial intelligence, pp 37–42, St Paul

  11. Dechter R (2003) Constraint processing. Morgan Kaufmann, San Mateo

    Google Scholar 

  12. Dechter R, Meiri I, Pearl J (1991) Temporal constraint networks. Artif Intell 49:61–95

    Article  MATH  MathSciNet  Google Scholar 

  13. Fargier H, Lang J, Schiex T (1996) Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge. In: The 13th national conference on artificial intelligence (AAAI-96), pp 175–180

  14. Fisher M, Gabbay D, Vila L (2005) Handbook of temporal reasoning in artificial intelligence (foundations of artificial intelligence), Elsevier, Amsterdam. ISBN: 0444514937

    Google Scholar 

  15. Gelle E (1998) On the generation of locally consistent solution spaces in mixed dynamic constraint problems. PhD thesis, 1826, pp 101–140

  16. Gelle E Faltings B (2003) Solving mixed and conditional constraint satisfaction problems. Constraints 8:107–141

    Article  MATH  MathSciNet  Google Scholar 

  17. Gent IP, MacIntyre E, Prosser P, Smith BM, Walsh T (1998) Random constraint satisfaction: flaws and structure

  18. Ghallab M, Laruelle H (1994) Representation and control in IxTeT, a temporal planner. In: AIPS 1994:61–67

    Google Scholar 

  19. Golumbic C, Shamir R (1993) Complexity and algorithms for reasoning about time: a graphic-theoretic approach. J Assoc Comput Mach 40(5):1108–1133

    Article  MATH  MathSciNet  Google Scholar 

  20. Guesgen H, Hertzberg J (1993) A constraint-based approach to spatiotemporal reasoning. Appl Intell 3(1):71–90

    Article  Google Scholar 

  21. Haralick RM, Elliott GL (1980) Increasing tree search efficiency for constraint satisfaction problems. Artif Intell 14:263–313

    Article  Google Scholar 

  22. Hwang C, Shubert L (1994) Interpreting tense, aspect, and time adverbials: a compositional, unified approach. In: Proceedings of the first international conference on temporal logic, LNAI, vol 827, Berlin, pp 237–264

  23. Jónsson AK, Frank J (2000) A framework for dynamic constraint reasoning using procedural constraints. In: ECAI 2000, pp 93–97

  24. Jónsson AK, Frank J (2003) Constraint-based attribute and interval planning. Constraints 8(4):339–364

    Article  MATH  MathSciNet  Google Scholar 

  25. Kautz HA, Ladkin PB (1991) Integrating metric and qualitative temporal reasoning. In: AAAI’91, Anaheim, CA, pp 241–246

  26. Laborie P (2003) Resource temporal networks: definition and complexity. In: Eighteenth international joint conference on artificial intelligence (IJCAI’03), pp 948–953

  27. Mackworth AK (1977) Consistency in networks of relations. Artif Intell 8:99–118

    Article  MATH  Google Scholar 

  28. Marin R, Cardenas M, Balsa M, Sanchez J (1997) Obtaining solutions in fuzzy constraint networks. Int J Approx Reason 16:261–288

    Article  MATH  MathSciNet  Google Scholar 

  29. Meiri I (1996) Combining qualitative and quantitative constraints in temporal reasoning. Artif Intell 87:343–385

    Article  MathSciNet  Google Scholar 

  30. Mitra D (2002) A path-consistent singleton modeling (CSM) algorithm for arc-constrained networks. Appl Intell 17(3):313–318

    Article  MATH  Google Scholar 

  31. Mittal S, Falkenhainer B (1990) Dynamic constraint satisfaction problems. In: Proceedings of the 8th national conference on artificial intelligence. AAAI Press, Boston, pp 25–32

    Google Scholar 

  32. Morris P, Muscettola N (2000) Execution of temporal plans with uncertainty. In: AAAI 2000, pp 491–496

  33. Mouhoub M, Charpillet F, Haton JP (1998) Experimental analysis of numeric and symbolic constraint satisfaction techniques for temporal reasoning. Constraints Int J 2:151–164

    Article  Google Scholar 

  34. Mouhoub M (2004) Reasoning with numeric and symbolic time information. Artif Intell Rev 21:25–56

    Article  MATH  Google Scholar 

  35. Ryabov V Trudel A (2004) Probabilistic temporal interval networks. In: TIME 2004, pp 64–67

  36. Sabin D, Freuder EC (1994) Contradicting conventional wisdom in constraint satisfaction. In: Proceedings of the eleventh European conference on artificial intelligence. Wiley, Amsterdam, pp 125–129

    Google Scholar 

  37. Sabin D, Freuder EC (1996) Configuration as composite constraint satisfaction. In: Luger GF (ed) Proceedings of the (1st) artificial intelligence and manufacturing research planning workshop. AAAI Press, Menlo Park, pp 153–161

    Google Scholar 

  38. Sabin D, Freuder EC, Wallace RJ (2003) Greater efficiency for conditional constraint satisfaction. In: Proc., ninth international conference on principles and practice of, constraint programming—CP 2003, 2833, pp 649–663

  39. Selman B, Kautz H (1993) Domain-independent extensions to GSAT: solving large structured satisfiability problems. In: Proceedings of the 13th international joint conference on artificial intelligence, Chambéry, France. Morgan Kaufmann, San Mateo, pp 290–295

    Google Scholar 

  40. Schockaert S, De Cock M (2008) Temporal reasoning about fuzzy intervals. Artif. Intell. 172(8–9):1158–1193

    Article  MATH  Google Scholar 

  41. Smith B, Dyer M (1996) Locating the phase transition in binary constraint satisfaction problems. Artif Intell 81:155–181

    Article  MathSciNet  Google Scholar 

  42. Song F, Cohen R (1991) Tense interpretation in the context of narrative. In: AAAI’91, pp 131–136

  43. Thornton J, Beaumont M, Sattar A, Maher M (2004) A local search approach to modelling and solving interval algebra problems. J Logic Computat 14(1):93–112

    Article  MATH  MathSciNet  Google Scholar 

  44. Theodoulidis C, Loucopoulos P, Wangler B (1991) A conceptual modelling formalism for temporal database applications. Inf Syst 16(4):401–416

    Article  Google Scholar 

  45. Tsamardinos I, Vidal T, Pollack ME (2003) CTP: a new constraint-based formalism for conditional temporal planning. Constraints 8(4):365–388

    Article  MATH  MathSciNet  Google Scholar 

  46. van Beek P (1992) Reasoning about qualitative temporal information. Artif Intell 58:297–326

    Article  MATH  Google Scholar 

  47. Vidal T, Ghallab M (1996) Dealing with uncertain durations in temporal constraint networks dedicated to planning. In: ECAI-1996, pp 48–52

  48. Vidal T, Fargier H (1999) Handling consistency in temporal constraint networks: from consistency to controllabilities. J Exp Theor 11:23–45

    Article  MATH  Google Scholar 

  49. Vilain M, Kautz H (1986) Constraint propagation algorithms for temporal reasoning. In: Proceedings of the fifth national conference on arifical intelligence (AAAI’86), Philadelphia, PA. MIT Press, Cambridge, pp 377–382

    Google Scholar 

  50. Walsh T (2002) Stochastic constraint programming. In: The 15th European conference on artificial intelligence (ECAI-02)

  51. Xu K, Li W (2000) Exact phase transitions in random constraint satisfaction problems. J Artif Intell Res 12:93–103

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Univ. of Regina, Regina, Canada

    Malek Mouhoub & Amrudee Sukpan

Authors
  1. Malek Mouhoub
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amrudee Sukpan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Malek Mouhoub.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mouhoub, M., Sukpan, A. Conditional and composite temporal CSPs. Appl Intell 36, 90–107 (2012). https://doi.org/10.1007/s10489-010-0246-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-010-0246-z

Keywords

Search

Navigation