TFRYTUYGJKH

Attribution Non-Commercial (BY-NC)

12 views

TFRYTUYGJKH

Attribution Non-Commercial (BY-NC)

- UNIT 1 - Basic Concepts in Logic-1
- 03 Knowledge Representations
- Artificial Intelligence and Knowledge Representation
- Critical Thinking Text
- A Quick Reference For Critical Thinking
- Tok Review
- Systematic Errors Logic.pdf
- Kuba - 2012 - OWL 2 and SWRL Tutorial-Annotated
- Acz01Super Across Management's Insight
- Legal Logic
- Type Theory and Functional Programming (Simon Thompson)
- Deductive Inductive
- 5. Philosophy I
- Models for Text Grammars - Van Djik.pdf
- Logic reviewer
- Chapter 1 What is Critical Thinking Anyway
- Week 3.2 - Logic
- szalas-cugs-lectures.pdf
- CriticalThinking Tutorial 1
- Notions in logic

You are on page 1of 28

Lecture 2

1

Outline

A knowledge based system (KBS) is a software system capable of supporting the explicit representation of knowledge in some specific competence domain and of exploiting it through appropriate reasoning mechanisms in order to provide high-level problem-solving performance. KBS is a specific, dedicated, computer-based problemsolver, able to face complex problems, which, if solved by man, would require advanced reasoning capabilities, such as deduction, abduction, hypothetical reasoning, modelbased reasoning, analogical reasoning, learning, etc.

Typical problems

Domain Knowledge Knowledge Base

Solution

Knowledge-Based System

4

Knowledge Classification

Examples are mathematical laws, logical statements.

This Knowledge can be denied based on new knowledge without the need for contradictions.

Procedural knowledge: Knowing how to do something. Declarative knowledge: Knowing that something is true or false. Tacit knowledge: Unconsciously knowing how to do something. 5 Explicit knowledge:

Knowledge Representation

This is the way that knowledge is stored in a program. This implies that

There is a systematic way to store the information. The knowledge is coded into the program.

Knowledge representation and reasoning - the study of formal ways of extracting information from symbolically represented knowledge

Existing computer languages can be used and the knowledge is stored in memory. The stored knowledge and facts can be used in reasoning.

6

Knowledge Representation

Knowledge can be represented in a variety of ways. The predominant knowledge representation schemes are

Knowledge Representation

Completeness: Should support the acquisition of all aspects of the knowledge. Conciseness: Allow efficient acquisition so that knowledge is stored compactly and is easily retrieved. Computational efficiency: It should be possible to use the knowledge rapidly and without the need for excessive computation. Transparency: Should be such that it is possible to understand its behaviour and how it arrives at conclusions. Explicity: The important things should be explicit but the details suppressed but available in case it is required in future. 8

9

There is no single representation scheme that embodies all the above characteristics. Each of the representation schemes is suitable for certain types of application domain.

10

Rule-based schemes: Information is stored as abstract rules that have general applicability.

Learning is explicit.

Instance based models: Do not operate on explicit rules. Exhibit rule-like behavior by being exposed to a series of examples.

Learning is implicit.

11

Logic: Extensively used in Al programs. Main purpose of logic: The soundness or unsoundness of arguments. Typically, an argument consists of statements called propositions, from which other statement(s) called conclusion(s) are claimed to follow. This is the basis of propositional logic.

12

Propositional Logic

(1) (2)

Propositions, because each is either true or false. The following phrases are not propositions:

(3) (4)

13

Propositional Logic

Example: The following inference:

"If Sam is a happy man then Sam is a teacher" Could be symbolically expressed as:

if A then B

14

Propositional Logic

This is an example of a rule of inference called modus ponens. This says that if proposition A is true, and the rule of inference A B is true, then B will also be true.

"If I listen to music and the room is warm then I fall asleep

Proposition A: I listen to music Proposition B: The room is warm Proposition C: I fall asleep

15

Propositional Logic

Connective symbols The symbols shown in the table are used to denote some of the most common connectives used in propositional logic.

16

Propositional Logic

Symbol Meaning -A Not A AB AB AB Interpretation Negation. Negation of proposition A is true if A is false and vice versa A and B Conjunction. A and B only true if A and B are both true, otherwise false A or B Disjunction. A or B is true if A is true or B is true. A implies B Implication. If A is true and A implies B is true, then B is true. If A is false and A implies B is true then anything goes. That is, B could be true or false, since implication says nothing about case when A is false

17

Propositional Logic

Truth table The meanings of the connectives and their results are summarized in the table

A 1 1 0 0

B A A B A B A B 1 0 1 1 1 0 0 0 1 0 1 1 0 1 1 0 1 0 0 1

18

Predicate Logic

Propositional logic is inadequate for solving some problems because a proposition has to be treated as a single entity that is either true or false. Predicate logic overcomes this by allowing a proposition to be broken down into two components.

Arguments Predicates.

It allows the use of variables, in addition to supporting the rules of inference derived from propositional logic (i.e. modus ponens etc.).

19

Predicate Logic

Example Consider the proposition:

Predicate: HAS Arguments: Kamau and brown hair.

In the example,

20

Predicate Logic

Quantifiers in predicate logic Predicate logic also allows for the use of quantifiers.

This means that the language can be extended to propositions that refer to a range of a variable. For example, consider the proposition:

21

Predicate Logic

x, Man(x) y, s.t. Woman(y) Loves(x, y)

Which reads:

For any object x in the world if x is a Man, then there exists an object y, such that y is a woman and x Loves y.

Quantifiers : The universal quantifier since it refers to all objects in the (male) population. : The existential quantifier since it refers to at least one object in the (female) population.

22

Predicate Logic

Now consider the proposition: every Welshman is a Man. This would be expressed in formal logic as:

x, Welshman(x) Man(x)

Which reads:

23

Predicate Logic

Then from the two facts it can be concluded, using the rules of inference, that the following fact must be true:

Loves(x, y)

That is, every Welshman loves a woman. The example seems to lead to an obvious conclusion. However, for other examples such intuitive conclusions would be less obvious.

24

If you are in Chiromo, then you are in Nairobi If you are in Nairobi, then you are in Kenya

Both premises and conclusion happen to be true statements, But if you substitute Kampala for Nairobi the

argument will have false premises.

Therefore, there are arguments that intuitively seem to be valid in the sense that the conclusions somehow follow from the premises, but which still have something missing.

25

Validity:

A deductive argument (or argument form) is valid if and only if it is impossible for its conclusion to be false when its premises are true.

Soundness:

26

There is a set of rules called rules of inference by which facts that are known to be true can be used to derive other facts, which must also be true. The truth of any new proposition can be checked, in a well-specified manner, against the facts that are already known to be true.

Logical inferences will only guarantee the truth of a conclusion if the premises leading to the conclusion are also true.

27

Summary

Components Types

28

- UNIT 1 - Basic Concepts in Logic-1Uploaded byBarby Angel
- 03 Knowledge RepresentationsUploaded byskyisvisible
- Artificial Intelligence and Knowledge RepresentationUploaded bylipika008
- Critical Thinking TextUploaded byMayank Agrawal
- A Quick Reference For Critical ThinkingUploaded byPhillip Shurtleff
- Tok ReviewUploaded byAnil Rayala
- Systematic Errors Logic.pdfUploaded bynicoddias
- Kuba - 2012 - OWL 2 and SWRL Tutorial-AnnotatedUploaded byjasmincosic
- Acz01Super Across Management's InsightUploaded byAnonymous 8erOuK4i
- Legal LogicUploaded byJoseph Park
- Type Theory and Functional Programming (Simon Thompson)Uploaded byMaiara e maraiara
- Deductive InductiveUploaded byJerome Salazar Caballero
- 5. Philosophy IUploaded byalam amar
- Models for Text Grammars - Van Djik.pdfUploaded byValeria Barría
- Logic reviewerUploaded byJérômeBernabé
- Chapter 1 What is Critical Thinking AnywayUploaded byalaa
- Week 3.2 - LogicUploaded byPlane2Spain
- szalas-cugs-lectures.pdfUploaded byranaateeq
- CriticalThinking Tutorial 1Uploaded byrabdu100
- Notions in logicUploaded byColate Loco
- 123syllabusUploaded byAnonymous bZTdTpL
- Reviewer in LogicUploaded byMhayBinuyaJuanzon
- Standard Categorical PropositionUploaded byRichard Michael
- Quantificational Accounts IUploaded byClaudio Conforti
- lappin engl 2 --critical thinking sections 5 7 10 11Uploaded byapi-372316705
- Glossary ENGLUploaded bygabitza2014
- zzcobaUploaded byAndri Wahyudi
- MakingGeneralizations[1].pdfUploaded bydazzle genre
- 42273 lec07Uploaded byapi-304236873
- Waltons_Informal_Logic_A_Handbook_for_Critical_Ar.pdfUploaded byUserinio

- Bit 4202 Distributed Multimedia SystemsUploaded bySuada Bőw Wéěžý
- kcpe-2013Uploaded bySuada Bőw Wéěžý
- xxzsas6Uploaded bySuada Bőw Wéěžý
- 15Uploaded bySuada Bőw Wéěžý
- information+systemUploaded bySuada Bőw Wéěžý
- xasw11Uploaded bySuada Bőw Wéěžý
- 340 IntroductionUploaded bySuada Bőw Wéěžý
- chemeUploaded bySuada Bőw Wéěžý
- Ethics and Professionalism.pdfUploaded bySuada Bőw Wéěžý
- 440_001_c11Uploaded bySuada Bőw Wéěžý
- 0c-syncUploaded bySuada Bőw Wéěžý
- Computer Information MFT ReviewUploaded byarun
- THEME2 PresentationUploaded byJaziel Cabral
- hrmUploaded byAsna Ayaz
- SaoFM hghygUploaded bySuada Bőw Wéěžý
- etop and mckinsey analysisUploaded byraj041974
- Case Based ReasoningUploaded bySuada Bőw Wéěžý
- Expert SystemsUploaded bySuada Bőw Wéěžý
- Machine Learning Systems & EaUploaded bySuada Bőw Wéěžý
- Uncertainty in KBSUploaded bySuada Bőw Wéěžý
- CHAP13Uploaded bySuada Bőw Wéěžý
- Distributed Databases YingyingUploaded bysammy21791
- Distributed Databases 1AUploaded bySuada Bőw Wéěžý
- Distributed Databases 1Uploaded bySuada Bőw Wéěžý
- Databases Review IntroUploaded bySuada Bőw Wéěžý
- Database Review 1Uploaded bySuada Bőw Wéěžý
- Database Review 1aUploaded bySuada Bőw Wéěžý
- Lecture 5 Knowledge Acquisition 2Uploaded bySuada Bőw Wéěžý

- Rawn Clark - 1997 - Unlocking the Hebrew Sequence of CreationUploaded byElizabeth Day
- CV SAP BIUploaded byrohit80042
- Soal Soal TOEFLUploaded bybolukojo
- SrsUploaded byMirul Azri
- Harris an Prc 150c Type 1 Hf RadioUploaded byAKsentinel
- Gupta and Ferguson 1997Uploaded byJamie Furniss
- 8-TEMPARATUREUploaded byDemonfox NarutoUzumaki
- c99Uploaded byanon_551688216
- Resume-uma2011Uploaded byUma Prabhu
- Coursework Definition RevisedUploaded byCreanga Florin
- ipv6Uploaded byCristian Bujor
- Mock Test 35 ( CSAT Unit Test 8) 31-May-19 1724(1)Uploaded byNisha B
- GCL ProgramingUploaded bysongtu2552
- Savitri ASpart2Uploaded bySvasthānanda Nath
- Fy06 SQL IntroUploaded byblob232
- Inclusion ExclusionUploaded bysai
- Technical English for Civil Engineers Construction BasicsUploaded bygio477
- Oracle Applications R12 - All About Multi OrgUploaded bytushardighe123
- Lesson Plan FoodUploaded byCristina Stepan
- ReactionUploaded byella xx
- Praja Sahiti May 2013 EditorialUploaded bySoma Sankar Kolluri
- Java 1Uploaded byPackia Raj
- Scientists on the QuranUploaded byMohammed faisal
- Light From the East Authors and Themes in Orthodox TheologyUploaded byRazvan Persa
- ctlUploaded byGus Tungurrah
- F71889AUploaded byFlavianoSilva
- ODBC Programming in C++Uploaded bycluetime
- SAP PM (ETM - Equipment and Tools Management)Uploaded byMohammad Asif Iqbal
- David BidneyUploaded byBuddy Seed
- Output Determination in SAPUploaded byAnupa Wijesinghe