74.419 artificial intelligence 2004 non-classical logics

24
74.419 Artificial Intelligence 2004 Non-Classical Logics

Post on 21-Dec-2015

235 views

Category:

Documents


3 download

TRANSCRIPT

Page 1: 74.419 Artificial Intelligence 2004 Non-Classical Logics

74.419 Artificial Intelligence 2004

Non-Classical Logics

Page 2: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Non-Classical Logics

Specific Language Constructs added to classic FOPL

Different Types of Logics Modal Logics most popular ones, e.g.

Deontic Logic (allowed and forbidden; ethics; law)

Epistemic Logic (Knowledge) and Doxastic (Belief) Logic

Possible World Semantics

Page 3: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Non-Classical Logics 1

(many-) sorted logic individuals pre-arranged in sets = sorts

many-valued logic more than two truth values (e.g. Lukasiewicz

“intermediate truth” = I; "don't know" status) fuzzy logic

degree of truth between 0 and 1 (predicate corresponds to fuzzy set; membership in set to a certain degree, not just yes or no)

non-monotonic logic belief modeling; defaults; set of true formulae can

change (non-monotonicity); TMS

Page 4: 74.419 Artificial Intelligence 2004 Non-Classical Logics

higher-order logicquantification over predicates (as variables), like P: ..., or statements about statements, e.g. “This sentence is false.”

modal logics (see later slides)describe “subjunctive” statements in addition to assertional statements, using Modal Operators, i.e. "possible P" and "necessary P"

Non-Classical Logics 2

Page 5: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Non-Classical Logics 3

time logics time as temporal modality time logic based on time points and relations

between them (like “t1 earlier than t2”) Allen’s model of time intervals

situational logic; situation calculus (McCarthy) situation as additional parameter to predicate

expressions, for describing change due to events additional axioms describe transformations of

ssituations due to actions used for reasoning with time and planning

Page 6: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Modal Logics 1

Uses additional operators and axioms to describe logic. Includes FOPL assertions, and in addition statements using Modal Operators. Different Modalities express different types of statements, e.g. alethic modality “necessary” and “possible” as additional operators

temporal modality with necessary “always” and possible “sometimes”

deontic modality “permissible” (allowed) and “obligatory” (must)

epistemic modality“knows” and “beliefs” as operators

Page 7: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Alethic Modality

Alethic modality

Something is necessarily true, or possibly true.

Operators:

“necessary” and “possible” Axioms:

A1) necessary(P) possible(P)

A2) possible(P) P

“If P is necessarily true, then P is also possible.”

“If P is not possible, then P cannot be true.”

Page 8: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Temporal Modality

Temporal modality

Something is always or sometimes true. Operators: “always” “necessary”

“sometimes” “possible”Axioms:

A1) always (P) sometimes (P)

“If P is always true, then P is sometimes true.”

A2) always ( P) sometimes (P)

“If not P is always true, then P is not sometimes true.”

Also for tenses like “past”, “past perfect”, “future”, ...

Page 9: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Deontic Modality

Deontic modality (ethics)

Something is permitted or obligatory. Operators:

“permissible” and “obligatory”

Axioms:

e.g. obligatory (P) permissible (P)

“If P is obligatory, then P is also permitted.”

Page 10: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Epistemic Modality

Epistemic modality Reasoning about knowledge (and beliefs)

Operators: “Knows” and “Believes”

Axioms: e.g. KnowsA(P) P

“If agent A knows P, then P must be true.”

KnowsA(P) BelievesA(P)

“If agent A knows P, then agent A also believes P.”

KnowsA(P) KnowsA(P Q) KnowsA(Q)

Note: P and Q refer in this context to closed FOPL formulae.

Page 11: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Epistemic Modality - Axioms

Most Common Axioms (Nilsson): 1. Modus Ponens Knowledge

[KnowsA(P) KnowsA(P Q) ] KnowsA(Q)

2. Distribution AxiomKnowsA(P Q) [KnowsA(P) KnowsA(Q) ]

3. Knowledge AxiomKnowsA(P) P

4. Positive-Introspection AxiomKnowsA(P) (KnowsA(KnowsA(P))

5. Negative Introspection Axiom

¬ KnowsA(P) (KnowsA(¬ KnowsA(P))

Page 12: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Epistemic Modality - Inference

Inferential Properties of Agents:

Epistemic Necessitation:from |– αinfer KnowsA(α)

Logical Omniscience:from α |– β and KnowsA(α)

infer KnowsA(β)

or:from |– (α β) infer KnowsA(α) KnowsA(β)

Page 13: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Epistemic Modality - Problems 1

Problem: "Referential Opaqueness"

Different statements refering to the same extension, cannot necessarily be substituted.

Agent A knows John's phone number. John's phone number is the same as Jane's phone number. You cannot conclude that A also knows Jane's phone number.

Another approach (than ML) is to use Strings instead of plain formulae to model referential opaqueness (cf. Norvig):

e.g. KnowsA(P) KnowsA("P=Q") KnowsA(Q)

Page 14: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Epistemic Modality - Problem 2

Problem: "Non-Compositional Semantics"

You cannot determine the truth status of a complex expression through composition as in standard FOPL.

From A and α you cannot always determine the truth status of KnowsA(α ).

e.g. From KnowsA(P) and (P Q) not conclude KnowsA(Q)

Modal Logic uses a "Possible Worlds Semantics"

Page 15: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Possible World Semantics

For modal and temporal logics, semantics is often based on considerations about which “worlds” (set of formulae) are compatible with or possible to reach from a certain given “world” → possible world semanticsRelations between “worlds”:

• accessible• necessary

A world is accessible from a certain world, if it is one possible follow state of that world. A world is a necessary follow state of a certain world, if the formulae in that world must be true, is a necessary conclusion.

Page 16: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Possible World Semantics - Example 1

Possible World Semantics for Epistemic Logic

If Agent A knows P, then P must be true in all worlds accessible from the current world. That means these worlds are not only accessible but necessary worlds (respective to the agent and its knowledge).

If Agent A believes P, then P can be true in some accessible worlds, and false in others.

Page 17: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Possible World Semantics for Alethic ModalityOne of my colleagues, let's call him BG for 'Big Guy', wants to loose weight. When we went for coffee last time, it was my turn to buy. Since he has had a hard day, I offered to buy him a Danish, too, but added, that in the future, he would not get any Danish, if he doesn't go to the Gym, but if he does go to the Gym, he might get a Danish - or not, depending on his weight situation.

Gym (BG) [ Danish (BG)]

Gym (BG) [Danish (BG)]

Possible Worlds - Example 2

Page 18: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Representing Time

Time as temporal modality in modal logic Time in FOPL

add time points and time relations as predicates

e.g. "earlier-than" (et) for two time points

Axioms:

e.g. x,y,z: (et (x,y) et (y,z)) et (x,z)

x,y: et (x,y) et (y,x)

Page 19: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Time Interval Representation (Allen)

Allen’s Time Interval LogicTime represented based on Intervals. Relations between time intervals are central :e.g. meet (i,j) for Intervals i and j

Interval i

Interval j

Time points representable as functions on intervals, e.g. start(i) and end(i) specify time points.

Axioms:e.g. meet(i,j) time(end(i))=time(start(j))

Page 20: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Time Interval Relations (Allen)

Allen’s Time Interval Logic: Relations (Nilsson)

Page 21: 74.419 Artificial Intelligence 2004 Non-Classical Logics

References

R. A. Frost: Introduction to Knowledge-Based Systems. Collins, London, 1986.

Graham Priest, An Introduction to Non-Classical Logic, Cambridge University Press, 2001

Nils J. Nilsson: Artificial Intelligence – A New Synthesis. Morgan Kaufmann, San Francisco, 1998.

Page 22: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Textbooks on (Modal) Logic

Richard A. Frost, Introduction to Knowledge-Base Systems, Collins, 1986 (out of print)

Comments: one of my favourite books; contains (almost) everything you need w.r.t. foundations of classical and non-classical logic; very compact, comprehensive and relatively easy to understand.

Allan Ramsay, Formal Methods in Artificial Intelligence, Cambridge University Press, 1988

Comments: easy to read and to understand; deals also with other formal methods in AI than logic; unfortunately out of print; a copy is on course reserve in the Science Library.

Page 23: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Textbooks on (Modal) Logic

Graham Priest, An Introduction to Non-Classical Logic, Cambridge University Press, 2001

Comments: the most poplar book (at least among philosophy students) on non-classical, in particular, (propositional) modal logic.

Kenneth Konyndyk, Introductory Modal Logic, University of Notre-Dame Press, 1986 (with later re-prints)

Comments: relatively easy and nice to read; contains propositional as well as first-order (quantified) modal logic, and nothing else.

Page 24: 74.419 Artificial Intelligence 2004 Non-Classical Logics

Textbooks on (Modal) Logic

J.C. Beall & Bas C. van Fraassen, Possibilities and Paradox, University of Notre-Dame Press, 1986 (with later re-prints)Comments: contains a lot of those weird things, you knew existed but you've never encountered in reality (during your university education).

G.E. Hughes & M.J. Creswell, A New Introduction to Modal Logic, Routledge, 1996 Comments: Location: Elizabeth Dafoe Library, 2nd Floor, Call Number / Volume: BC 199 M6 H85 1996