Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
cs-236:exams [2016/12/08 19:58]
egm [Final Exam Review]
cs-236:exams [2017/11/14 21:30] (current)
brob144 [Midterm 2 Review Topics]
Line 20: Line 20:
 * Express English statements in propositional logic. Prove a conclusions from a set of propositions and predicates without using resolution. Prove a conclusion from a set of propositions and predicates using only resolution. '''​Proofs should look like those done in class being in tabular form with clearly labeled inference rules.'''​([[Homework 6]]) * Express English statements in propositional logic. Prove a conclusions from a set of propositions and predicates without using resolution. Prove a conclusion from a set of propositions and predicates using only resolution. '''​Proofs should look like those done in class being in tabular form with clearly labeled inference rules.'''​([[Homework 6]])
 * Express English statements in predicate calculus. Use inference rules to prove a conclusion valid or invalid from the predicate calculus statements statements. '''​Proofs should look like those done in class being in tabular form with clearly labeled inference rules.'''​([[Homework 6]]) * Express English statements in predicate calculus. Use inference rules to prove a conclusion valid or invalid from the predicate calculus statements statements. '''​Proofs should look like those done in class being in tabular form with clearly labeled inference rules.'''​([[Homework 6]])
-* Answer a Datalog query by constructing a proof by contradiction using only resolution and universal ​or existential ​instantiation. '''​Proofs should look like those done in class being in tabular form with clearly labeled inference rules.'''​ ([[Homework 6]])+* Answer a Datalog query by constructing a proof by contradiction using only resolution and universal instantiation/​existential generalization. '''​Proofs should look like those done in class being in tabular form with clearly labeled inference rules.'''​ ([[Homework 6]])
 * Identify relations that are reflexive, irreflexive,​ symmetric, antisymmetric,​ or transitive. Add pairs to a relation to make it reflexive, symmetric, or transitive. ([[Homework 7]]) * Identify relations that are reflexive, irreflexive,​ symmetric, antisymmetric,​ or transitive. Add pairs to a relation to make it reflexive, symmetric, or transitive. ([[Homework 7]])
 * Evaluate relational algebra expressions on relations ([[Homework 7]] and [[Relational-database]]) * Evaluate relational algebra expressions on relations ([[Homework 7]] and [[Relational-database]])
cs-236/exams.txt ยท Last modified: 2017/11/14 21:30 by brob144
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0