1. Convex Programming Prove that the following mathematical program is a convex program. You may use without proof any facts claimed about convex functions and sets in the lecture slides. min max(1/1₁, 1/₂) 21.-22 F1, F₂ > 0 x²+x≤1

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

question 2 

1. Convex Programming Prove that the following mathematical program is a convex program. You
may use without proof any facts claimed about convex functions and sets in the lecture slides.
min max(1/₁, 1/₂)
1,2
F1, F₂ > 0
x² + x² ≤ 1
2. Propositional Inference Suppose you want to show:
A^B^ (B⇒D) ^ ((A^D) E) ^ ((BAC) ⇒F) ^ (A⇒C) ^ (F⇒G) G
(a) Draw the diagram we used in the video for forward and backward chaining.
(b) Indicate the order in which symbols are popped from the agenda by forward chaining
(c) Indicate the order in which subgoals are added to the stack by backwards chaining
(d) Prove the entailment using resolution. (You do not need to show every clause generated, just
those on the path to G.
(e) Draw the tree of models explored by DPLL to prove the entailment.
3. Limits of Forward Chaining
Given an example of an entailment that can be inferred via resolution but cannot be inferred using
forward chaining
Transcribed Image Text:1. Convex Programming Prove that the following mathematical program is a convex program. You may use without proof any facts claimed about convex functions and sets in the lecture slides. min max(1/₁, 1/₂) 1,2 F1, F₂ > 0 x² + x² ≤ 1 2. Propositional Inference Suppose you want to show: A^B^ (B⇒D) ^ ((A^D) E) ^ ((BAC) ⇒F) ^ (A⇒C) ^ (F⇒G) G (a) Draw the diagram we used in the video for forward and backward chaining. (b) Indicate the order in which symbols are popped from the agenda by forward chaining (c) Indicate the order in which subgoals are added to the stack by backwards chaining (d) Prove the entailment using resolution. (You do not need to show every clause generated, just those on the path to G. (e) Draw the tree of models explored by DPLL to prove the entailment. 3. Limits of Forward Chaining Given an example of an entailment that can be inferred via resolution but cannot be inferred using forward chaining
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Recurrence Relation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education