Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    CS264A ReviewNotes

    Uploaded by

    De Zheng Zhao

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    CS264A ReviewNotes

    Uploaded by

    De Zheng Zhao
    13 views11 pages

    Original Title

    CS264A_ReviewNotes

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    13 views11 pages

    CS264A ReviewNotes

    Uploaded by

    De Zheng Zhao

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 11

    CS264A: Automated Reasoning Review Notes

    TA Mugdha Bhagwat | Fall 2024

    Quantified Boolean Logic


    Quanti'ied Propositional Logic: Enriching language by de'ining operators on propositional logic sentences

    Conditioning: Elimination of a variable from knowledge base


    1. Notation: 𝚫｜𝛼
    𝚫 is Knowledge Base conditioned on the literal 𝛼 i.e. 𝚫｜𝛼 does not mention 𝛼
    2. Positive Conditioning: : 𝚫｜𝛼 →Replace all occurrences of 𝛼 with true
    3. Negative Conditioning : 𝚫｜¬𝛼 →Replace all occurrences of 𝛼 with false

    Boole’s Expansion Existential Quantification


    Δ = (α ∧ Δ| α) ∨ ( ¬α ∧ Δ|¬α) ∃α Δ = Δ| α ∨ Δ|¬α
    Expansion to reduce query with respect to Δ over
    n variables into 2 queries on Δ over n-1 variables Universal Quantification
    Application: Recursive algorithms (e.g. DPLL) ∀α Δ = Δ| α ∧ Δ|¬α

    Existential and Universal Quantification Properties


    1. If α is a sentence constructed using variables ∑\P then,
    a. Δ ⊨ α iff ∃PΔ ⊨ α → ∃PΔ as the strongest sentence over variables ∑\P that is implied by Δ
    b. α ⊨ Δ iff α ⊨ ∀PΔ → ∀PΔ as the weakest sentence over variables ∑\P that implies Δ
    2. Duality 3. Order of Quanti'ication
    a. ∃PΔ = ¬(∀P¬Δ) a. ∃P∃QΔ = ∃Q∃PΔ = ∃P,Q Δ
    b. ∀PΔ = ¬(∃P¬Δ) b. ∀P∀QΔ = ∀Q∀PΔ = ∀P,Q Δ

    Definitions
    1. Clause : Disjunction of literal over distinct variables : α1 ∨ α2 ∨ … ∨ αn
    2. Term : Conjunction of literals over distinct variables : α1 ∧ α2 ∧ … ∧ αn
    3. Conjunctive Normal Form (CNF) : Conjunction of Clauses : (clause1 i.e. α1 ∨ α2 ∨ … ∨ αn) ∧ (clause2)
    4. Disjunctive Normal Form (DNF) : Disjunction of Terms : (term1 i.e. α1 ∧ α2 ∧ … ∧ αn) ∨ (term2)

    Clausal Form Conversion


    Clausal Form: Set notation of CNF Δ = ¬W ⇒ ¬((X ⇒ Y) ∧ Z)
    1. Remove all logical connectives except ∧, ∨, ¬ 1. Δ = W ∨ ¬((¬X ∨ Y) ∧ Z)
    2. Push negations inside i.e. next to variables 2. Δ = W ∨ ((X ∧ Y) ∨ ¬Z) = W ∨ ¬Z ∨ (X ∧ Y)
    3. Distribute ∨ over ∧ (guarantees a CNF) 3. Δ = (W ∨ ¬Z ∨ X) ∧ (W ∨ ¬Z ∨ Y)
    4. Remove connectives and use set notation 4. Δ = {{ W, ¬Z, X }, { W, ¬Z, Y }}

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy