Stochastic Constraint Programming

AAAI Fall Symposium - Technical Report

Volumn FS-01-04, Issue , 2001, Pages 129-135

  Walsh, Toby ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; CONSTRAINT PROGRAMMING; CONSTRAINT THEORY; DECISION THEORY; INTEGER PROGRAMMING; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SEMANTICS; STOCHASTIC MODELS;

CONSTRAINT PROGRAMMING; CONSTRAINT PROGRAMS; CONSTRAINT SATISFACTION; DECISION PROBLEMS; DECISION VARIABLES; PROBABILITY: DISTRIBUTIONS; SET VARIABLES; STOCHASTIC CONSTRAINTS; STOCHASTIC VARIABLE; UNCERTAINTY;

STOCHASTIC SYSTEMS;

EID: 35248853614     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Bistarelli, S.; Fargier,H.; Montanari, U.; Rossi,F.; Schiex, T.; and Verfaillie, G. 1996. Semi-ring based CSPsand valuedCSPs:Basic properties and comparison.In Jample, M.; Freuder, E., and Maher,M., eds., Over-Constrained Systems, 111-150. Springer-Verlag. LNCS1106.
2. Cheeseman, P.; Kanefsky,B.; and Taylor, W.1991. Where the really hard problemsare. In Proc. of the 12th IJCAL 331-337. Int. Joint Conference on Artificial Intelligence.
3. Fargier, H., andLang,J. 1993.Uncertaintyin constraint satisfaction problems:a probabilistic approach.In Proc. ofECSQARU. Springer-Verlag. LNCS747.
4. Fargier, H., Lang,J.; Martin-Clouaire,R.; andSchiex,T. 1995.Aconstraint satisfaction framework for decisionunder uncertainty. In Proc. of the 11th Int. Conferenceon Uncertainty in Artificial Intelligence.
5. Fargier, H.; Lang, J.; and Schiex, T. 1996. Mixedconstraint satisfaction: a framework for decisionproblemsunder in completeinformation.In Proc.of the 13thNational Conference onArtificial Intelligence.
6. Fowler, D., and Brown,K. 2000. Branchingconstraint satisfaction problemsfor solutions robust under likely changes.In Proc.of 6thlnt. ConferenceonPrinciplesand Practicesof ConstraintProgramming. Springer-Verlag.
7. Freuder,E., andWallacs,R. 1992.Partial constraint satisfaction. Artificial Intelligence58:21-70.
8. Kaelbling, L.; Littman, M.; and Cassandra,A. 1998.Plan-ning andacting in partially observablestochastic domains. Artificial lntelligence 101(I-2):99-134.
9. Littman, M.; Dean, T., and Kaelbling, L. 1995. Onthe complexityof solving Markovdecision problems.In Proc. of the 8th AnnualConferenceon Uncertaintyin AL
10. Littman,M.;Majereik,S.; andPitassi, T. 2000.Stochastic Booleansatisfiability. Journalof Automated Reasoning.
11. Maclntyre, E.; Prosser, P.; Smith,B.; andWalsh,T. 1998. Randomconstraint satisfaction: Theorymeetspractice. In 4th Int. Conferenceon Principles andPractices of Constraint Programming (CP-98),325-339. Springer.
12. Shazeer, N.; Littman, M.; and Keim,G. 1999. Constraint satisfaction with probabilistic preferenceson variable values. In Proc. of the 16thNationalConference onArtificial Intelligence.