Professional Documents
Culture Documents
Knowledge
Representation
and Reasoning
University "Politehnica" of Bucharest
Department of Computer Science
Fall 2012
Readings
• Reading materials will be assigned to you.
• You are expected to do the readings before the class 5
Syllabus
1. General knowledge representation issues
Readings:
http://plato.stanford.edu/entries/logic-ai/
2. Logical agents – Logical knowledge representation and
reasoning
• First order predicate logic revisited, ATP
Readings:
AIMA Chapter 7 http://aima.cs.berkeley.edu/newchap07.pdf
• Nonmonotonic logics and reasoning
Readings:
Non-monotonic Logic, Stanford Encyclopedia of Philosophy
http://plato.stanford.edu/entries/logic-nonmonotonic/
Nonmonotonic Reasoning, G. Brewka, I. Niemela, M. Truszczynski
http://www.informatik.uni-leipzig.de/~brewka/papers/NMchapter.pdf
Nonmonotonic Reasoning With WebBased Social Networks
http://www.mindswap.org/~katz/papers/socialnet-defaults.pdf 6
Syllabus
• Modal logic, logics of knowledge and beliefs
Readings: Modal logic on Wikipedia
http://en.wikipedia.org/wiki/Modal_logic
+ to be announced
• Semantic networks and description logics,
reasoning services
Readings: to be announced
• Knowledge representation for the Semantic
Web
Readings:
Ontology knowledge representation - from description logic to
OWL Description Logics as Ontology Languages for the
Semantic Web
http://lat.inf.tu-dresden.de/research/papers/2005/BaSaJS60.pdf
7
Syllabus
Midterm exam (written examination) – 1h
3. Rule based agents
• Rete: Efficient unification
Readings:
The RETE algorithm
http://www.cis.temple.edu/~ingargio/cis587/readings/rete.html
9
Links for the young researcher
AI-MAS Links of interest
http://aimas.cs.pub.ro/links
Academic publishing
http://en.wikipedia.org/wiki/Academic_publishing
10
Lecture 1
Readings for Lecture 1:
http://plato.stanford.edu/entries/logic-ai/
11
1. Why KR?
We understand by "knowledge" all kinds of
facts about the world.
Knowledge is necessary for intelligent
behavior (human beings, robots).
In this course we consider representation of
knowledge and how we can use it in making
intelligent artifacts.
What is knowledge?
12
2. KR&R Challenges
Challenges of KR&R:
• representation of commonsense knowledge
• the ability of a knowledge-based system to
tradeoff computational efficiency for accuracy
of inferences
• its ability to represent and manipulate
uncertain knowledge and information.
13
3. What is KR?
Randall Davis, Howard Shrobe, Peter Szolovits, MIT
Symbolic representations
Non-symbolic representations
18
5. Models of KRR
Symbolic logic and ATP
Probabilistic
Temporal
Rules
Structured
19
6. Formal logic
Formal logic is the field of study of entailment
relations, formal languages, truth conditions,
semantics, and inference.
All propositions/statements are represented as
formulae which have a semantics according to
the logic in question.
Logical system = Formal language +
semantics
Formal logics gives us a framework to discuss
different kinds of reasoning. 20
6.1 Logical consequence (entailment)
21
Logical consequence (entailment)
Model centered approach to logical
consequence
Models are abstract mathematical structures that
provide possible interpretations for each of the
objects in a formal language.
Given a model for a language - define what it is
for a sentence in that language to be true
(according to that model) or not.
In any model in which the premises are true the
conclusion is true too. (Tarski's definition of logical
consequence from 1936.)
22
6.2 Model centered approach
Interpretation of a formula
Model of a formula
Entailment or logical consequence
A formula F is a logical consequence of a set of
formulas P1,…Pn iff F is true in all interpretations in
which P1,…Pn are true.
P1,… Pn |= L F
T Formula F is a logical consequence of a set of
formulas P1,…Pn iff P1,…Pn F is valid.
T Formula F is a logical consequence of a set of
formulas P1,…Pn iff P1… Pn ~F is inconsistent.
23
6.3 Proof centered approach
Theorem, deduction
Inference rule R
R
R F n F , y = y1 ,..., y n x, x, y i F , i = 1, n
Consequence of E i ( i 0)
24
Proof centered approach
If E 0 = A x then
Ei is deductible
from
|S x
E 0 = A ( = )
Theorems - the elements of Ei if
x Ei
Demonstration | R x
25
Proof approach important notions
Th() – set of provable theorems in
• Monotonicity
• Idempotence - multiple applications of the
operation do not change the result
Th() – a fixed point operator which
computes the closure of a set of formulas
according to the rules of inference
Th() – the least fixed point of this closure
process
26
6.4 Properties of logical systems
Important properties of logical systems:
Consistency - no theorem of the system contradicts
another.
Soundness - the system's rules of proof will never
allow a false inference from a true premise. If a system
is sound and its axioms are true then its theorems are also guaranteed to be
true.
Model theory
Generate new wffs that are necessarily true, given that the old wffs
are true - entailment KB |=L
Proof theory
Derive new wffs based on axioms and inference rules
KB |-i
29
PrL, FOPL Linear model
Extend PrL, PL
Sentential logic
Situation calculus of beliefs
Adds states, actions Uses beliefs atoms BA()
Index PL with agents
Symbol level
Modal logic
Knowledge level Modal operators
Structured models
Description Logics
Subsumption relationships Temporal logic Dynamic logic
Modal operators for time Modal operators
Linear time for actions
Branching time
Logics of knowledge
and belief
CTL logic
Modal operators B and K
Branching time
BDI logic
and action
Adds agents, B, D, I 30
knowledge propositional first-order
32
33
A logical puzzle
Someone who lives in Dreadbury Mansion killed Aunt
Agatha.
Agatha, the butler, and Charles live in Dreadbury
Mansion, and are the only people who live therein.
A killer always hates his victim, and is never richer than
his victim.
Charles hates no one that Aunt Agatha hates.
Agatha hates everyone except the butler.
The butler hates everyone not richer than Aunt Agatha.
The butler hates everyone Aunt Agatha hates.
No one hates everyone.
Agatha is not the butler.
Who killed Aunt Agatha?
34
35
36
37
38
Slides 35-38 are from the slides
39