16.410-13 Principles of Automated
Reasoning and Decision Making
Problem Set 3
Problem 1: Modeling for Constraint Programming (40 Points)
You are a screen writer designing the story board for an episod
Massachusetts Institute of Technology
16.410 Principles of Automated Reasoning
and Decision Making
Problem Set #4
Background for Problems 1 and 2
In Problems 1 and 2, you will implement backtracking a
Massachusetts Institute of Technology
16.410 Principles of Automated Reasoning
and Decision Making
Problem Set #6
Problem 1 (50 points)
Consider the following quote, taken from (Barwise and Etchemendy
Massachusetts Institute of Technology
16.410-13 Principles of Autonomy and
Decision Making
Jump Starting lpsolve in Java
Introduction
This jumpstart shows you the basics of using a Linear Program solv
Massachusetts Institute of Technology
16.410-13 Principles of Autonomy and
Decision Making
Problem Set #1
Objective
The primary objective of this problem set is to begin to exercise your skill at desi
Massachusetts Institute of Technology
16.410 Principles of Automated Reasoning
and Decision Making
Problem Set #5
Problem 1: Planning for Space Operations (30 points)
In this problem you will construc
Massachusetts Institute of Technology
16.410-13 Principles of Autonomy and
Decision Making
Problem Set #2
Objective
You will implement in Java the following search algorithms:
1. Depth-first
2. Breadt
Massachusetts Institute of Technology
16.410-13 Principles of Autonomy and
Decision Making
Problem Set #7 Part 2
Problem 3: Search (20 points)
You are trying to find a path from vertex 0 to vertex 7 i
16.410-13 Problems Set 7
Due in class on Wed. Nov. 10th, 2010.
Problem 1: Model-based Diagnosis (20 points)
Part A
Consider a Mars rover on which the diagnosis algorithm that you have learned in the c
16.410/13 Problem Set 10
Problem 1: Markov Chains (50 points)
Part A: Markov Chain Representation
A die is rolled repeatedly. Which of the following can be represented as a Markov Chain? For those tha
Massachusetts Institute of Technology
16.410-13 Principles of Automated Reasoning
and Decision Making
Problem Set #11
Do not Turn In
Problem 1 MDPs: Tortoise and Hare
The following question is taken f
16.410/13 Problem Set 9
Problem 1: Mixed Integer Linear Programming (50 points)
Part A: 3-SAT (10 points)
In this problem we will prove that solving a Mixed Integer Linear Program is NP-hard. Consider
16.410 Principles of Autonomy and Decision-Making
Problem Set. # 8
Please remember to include the time have spent for each problem in your solutions.
Problem 1: LP Formulation (20pts)
In one of the lu