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 algorithms for solving CSPs.
The implementation will be

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, 1993):
If the unicorn is mythical, then it is immorta

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 episode of a sitcom Buddies,
a Friends knocko, with the ever

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 solver, lpsolve, in Java.
Please note that this jumpstart w

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 designing
and implementing Java programs. This includes dev

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 construct a plan graph for a very simple spacecraft control
pro

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. Breadth-first.
You will then experiment with these algorithms

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 in the following directed graph
using several search alg

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 class is running.
The electrical system components of th

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 that can be,
provide the transition matrix
The largest nu

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 from the 2004 final. We all know, as the story goes, tha

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 the (in)famous 3-SAT
problem. This problem is to nd an

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 lunar bases that you are building, you are facing a probl