100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
College aantekeningen Representation and Interaction (SOW-BKI329) $7.60   Add to cart

Class notes

College aantekeningen Representation and Interaction (SOW-BKI329)

 7 views  1 purchase
  • Course
  • Institution

Notes and summary of Part 1 of the course Representation and Interaction (SOW-BKI329) - 2021

Preview 4 out of 46  pages

  • March 30, 2021
  • 46
  • 2020/2021
  • Class notes
  • Perry groot, pablo lanillos, johan kwisthout
  • All classes
avatar-seller
Representation and Interaction
Chantal Drijvers
March 2021


Logic and Resolution
Logic concepts
• M |=ϕ
– M satisfies ϕ
– If a formula ϕ is true under a given interpretation M
• A formula is satisfiable if there is some interpretation under which it is
true
• A formula is unsatisfiable (inconsistent) if there is no interpretation under
which it is true
• |=ϕ
– Formula is valid (tautology)
– If a formula is true in every interpretation
– for all M: M |=ϕ
• Γ |=ϕ
– Formula ϕ is entailed (logical consequence) by a conjunction of for-
mulas (theory) Γ, if for all M: M |=Γ then M |=ϕ

• w |=ϕ
– w is a model of ϕ




1

,Deduction Concepts
• Deductive system S: set of axioms and rules of inference for deriving the-
orems
• A formula ϕ can be deduced by a set of formulae Γ if ϕ can be proven
using a deduction system S, written as Γ ` sϕ
• A deductive system S is sound if

Γ ` sϕ ⇒ Γ |= ϕ

• A deductive system S is complete if

Γ |= ϕ ⇒ Γ ` sϕ

• A deductive system S is refutation-complete if

Γ |=  ⇒ Γ ` s




2

,Resolution
• Clausal form
L1 ∨ L2 ∨ · · · ∨ Ln
– Li : literal (atom or negation of atom)
– if n = 0, then it is  (empty clause)
• Complementary literals: L an L’, such that L ≡ ¬ L’
• Resolution (rule) R
C ∨ L, C 0 ∨ ¬L
D
– C, C’: clause
– D: (binary) resolvent equal to C ∨ C’
• V = {P ∨ Q ∨ ¬R, U ∨ ¬Q}, then

P ∨ Q ∨ ¬R, U ∨ ¬Q
P ∨ U ∨ ¬R
So V `R P ∨ U ∨ ¬R by applying the resolution rule R once
¬P ∨Q,¬Q ¬P ,P
• Give V = {¬P ∨ Q, ¬Q, P }, then ¬P and  so V `R 
• V `R 
– V is inconsistent
– The derivation is called a refutation
– R is sound
• V 0R 
– V is consistent
– R is refutation-complete

• Horn clause: clause with maximally one positive literal ¬A1 ∨· · ·∨¬Am ∨
B, also denoted by B ← A1 , . . . , Am




3

, First-order Logic
Syntax
• Constants: a, b, ...

• Variables: x, y, z, ...
• Functions: maps (sets of) objects to other objects, e.g., father, plus, ...
• Predicates: a function that returns either true of false: Brother-of, Bigger-
than, Has-color, ...

• Quantifiers: allow the representation of properties that hold for a collec-
tion to objects
– Existential: ∃x, ’there is an x’
– Universal: ∀x, ’for all x’

Truth
• A predicate is true if the interpretation of the predicate evaluates to ’true’
• Logical connectives are interpreted just like in propositional logic
• ∀xϕ(x) is true if ϕ is true for all variable assignments
• ∃xϕ(x) is true if ϕ is true for some variable assignments

Equivalences


¬(¬F ) ≡ F (a)
F ∨G ≡ G∨F (b)
F ∧G ≡ G∧F (c)
(F ∧ G) ∧ H ≡ F ∧ (G ∧ H) (d)
(F ∨ G) ∨ H ≡ F ∨ (G ∨ H) (e)
F ∨ (G ∧ H) ≡ (F ∨ G) ∧ (F ∨ H) (f)
F ∧ (G ∨ H) ≡ (F ∧ G) ∨ (F ∧ H) (g)
F ↔G ≡ (F → G) ∧ (G → F ) (h)
F →G ≡ ¬F ∨ G (i)
¬(F ∧ G) ≡ ¬F ∨ ¬G (j)
¬(F ∨ G) ≡ ¬ ∧ ¬G (k)
F ∧F ≡ F (l)
F ∨F ≡ F (m)

Table 1: Equivalences




4

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller chantalbanga. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $7.60. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

64438 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$7.60  1x  sold
  • (0)
  Add to cart