Search the whole station

# 自动推理代写 CS264A代写 Automated Reasoning代写 hw代写

497

## Homework 1

### 1.[8 pts]

Show that the following sentences are consistent by identifying a world which satisfies each sentence:

• (¬A⇒B) (A⇒¬B).
• (A ∧ B)(¬A ∨ ¬B).

2.[8 pts]

Show that the following sentences are valid by showing that each is true at every world:

• (A⇒B)(¬B⇒¬A).
• ((A ∨ B) (A⇒C))(B ∨ C).

3.[8 pts]

Prove from the definitions of Boolean quantifiers and that (a) ∃P · (∆ Γ) is equivalent to (∃P · ∆) (∃P · Γ), and (b) ∀P · (∆ Γ) is equivalent to (∀P · ∆) (∀P · Γ).

4.[8 pts]

Convert the following knowledge base into clausal form:

∆ = A⇒B, ¬A⇒(¬B ∧ C), (B ∨ C)⇒D.

### 5.[8 pts] 自动推理代写

Show that if we have a polynomial-time procedure for model counting, and another for clausal entailment on a knowledge base Γ, then we have a polynomial-time procedure for testing the equivalence between Γ and CNF ∆.

6.[10 pts]

Show using resolution that D E is entailed by the knowledge base:

∆ = ¬A⇒B, A⇒¬C, ¬D⇒¬B ∧ ¬C, A⇒E.

7.[12 pts]

Show the termination tree for dpll when run on the following KB, assuming that variables are tested according to the order A, B, C, D, E and true expanded before false:

Note that dpll does not use conflict-directed backtracking.

8.[12 pts]

Show a trace of dpll+ on the above KB, assuming that decisions are made according to the constraints given above. At each conflict, show the decision sequence, implication graph, conflict-driven clause, and its assertion level. Assume that conflict-driven clauses are generated using the first-UIP method of Section 3.6.2.

9.[12 pts]

Consider the following knowledge base.

∆ = AB, ¬A(¬B C), (B C)D.

Show how you can count the number of models of ∆ using cdpll and draw the termination tree. Assume that you are expanding variables according to the order A, B, C, D and always expand true before false.

### 10.[14 pts] 自动推理代写

Consider the following knowledge base:

∆ = P1 P2 P3, P1Q, P2Q, P3Q.

a. Convert ∆ into clausal form.

b. Apply directed resolution to the clausal form using the variable order P1, P2, P3, Q.

c. Construct a decision tree for ∆ and use it to count the number of models of ∆.

The prev: The next:

### Related recommendations

• #### 中级宏观经济理论代写 Econ 105B代写 经济学作业代写

693

Econ 105B Handout/Homework 2 中级宏观经济理论代写 1. An economy has two firms. Households own all of the labor services and all of the capital, which they rent out to the firms. 1...

View details
• #### 预测分析代写 Predictive Analytics代写 Homework代写

774

ISE 529 Predictive Analytics Homework  预测分析代写 1.Use the Boston dataset from datasets to fit the following models to predict the price of houses in the Boston area. Read boston.dat...

View details
• #### 代写数据作业 data代写 RESEARCH DESIGN代写

630

APANPS5300_D01_2021_1 - RESEARCH DESIGN Assignments Homework 5: Work and Life Balance 代写数据作业 For this assignment, we will be working to understand the impact of different working m...

View details
• #### 人工智能代写 Artificial Intelligence代写 AI代写

1002

CS 771 Artificial Intelligence Homework 1 (50 points) 人工智能代写 1.For each of the following assertions, say whether it is true or false and support your answer with examples or counterexa...

View details
1