propositions
play

Propositions An interpretation is an assignment of values to all - PowerPoint PPT Presentation

Dec 05, 2022 •100 likes •257 views

Propositions An interpretation is an assignment of values to all variables. A model is an interpretation that satisfies the constraints. Often we dont want to just find a model, but want to know what is true in all models. A proposition is

  1. Propositions An interpretation is an assignment of values to all variables. A model is an interpretation that satisfies the constraints. Often we don’t want to just find a model, but want to know what is true in all models. A proposition is statement that is true or false in each interpretation. � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 1

  2. Why propositions? Specifying logical formulae is often more natural than filling in tables It is easier to check correctness and debug formulae than tables We can exploit the Boolean nature for efficient reasoning We need a language for asking queries (of what follows in all models) that may be more complicated than asking for the value of a variable It is easy to incrementally add formulae It can be extended to infinitely many variables with infinite domains (using logical quantification) � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 2

  3. Human’s view of semantics Step 1 Begin with a task domain. Step 2 Choose atoms in the computer to denote propositions. These atoms have meaning to the KB designer. Step 3 Tell the system knowledge about the domain. Step 4 Ask the system questions. — the system can tell you whether the question is a logical consequence. — You can interpret the answer with the meaning associated with the atoms. � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 3

  4. Role of semantics In computer: In user’s mind: light 1 broken : light #1 light 1 broken ← sw up is broken ∧ power ∧ unlit light 1 . sw up : switch is up sw up . power : there is power in power ← lit light 2 . the building unlit light 1 . unlit light 1: light #1 lit light 2 . isn’t lit lit light 2: light #2 is lit Conclusion: light 1 broken The computer doesn’t know the meaning of the symbols The user can interpret the symbol using their meaning � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 4

  5. Simple language: propositional definite clauses An atom is a symbol starting with a lower case letter A body is an atom or is of the form b 1 ∧ b 2 where b 1 and b 2 are bodies. A definite clause is an atom or is a rule of the form h ← b where h is an atom and b is a body. A knowledge base is a set of definite clauses � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 5

  6. Semantics An interpretation I assigns a truth value to each atom. A body b 1 ∧ b 2 is true in I if b 1 is true in I and b 2 is true in I . A rule h ← b is false in I if b is true in I and h is false in I . The rule is true otherwise. A knowledge base KB is true in I if and only if every clause in KB is true in I . � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 6

  7. Models and Logical Consequence A model of a set of clauses is an interpretation in which all the clauses are true . If KB is a set of clauses and g is a conjunction of atoms, g is a logical consequence of KB , written KB | = g , if g is true in every model of KB . That is, KB | = g if there is no interpretation in which KB is true and g is false . � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 7

  8. Simple Example  p ← q .  KB = q . r ← s .  model? p q r s I 1 true true true true I 2 false false false false I 3 true true false false I 4 true true true false I 5 true true false true � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 8

  9. Simple Example  p ← q .  KB = q . r ← s .  model? p q r s I 1 true true true true is a model of KB not a model of KB I 2 false false false false I 3 true true false false is a model of KB I 4 true true true false is a model of KB not a model of KB I 5 true true false true � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 9

  10. Simple Example  p ← q .  KB = q . r ← s .  model? p q r s I 1 true true true true is a model of KB not a model of KB I 2 false false false false I 3 true true false false is a model of KB I 4 true true true false is a model of KB not a model of KB I 5 true true false true Which of p , q , r , q logically follow from KB? � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 10

  11. Simple Example  p ← q .  KB = q . r ← s .  model? p q r s I 1 true true true true is a model of KB not a model of KB I 2 false false false false I 3 true true false false is a model of KB I 4 true true true false is a model of KB not a model of KB I 5 true true false true Which of p , q , r , q logically follow from KB? KB | = p , KB | = q , KB �| = r , KB �| = s � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 11

  12. User’s view of Semantics 1. Choose a task domain: intended interpretation. 2. Associate an atom with each proposition you want to represent. 3. Tell the system clauses that are true in the intended interpretation: axiomatizing the domain. 4. Ask questions about the intended interpretation. 5. If KB | = g , then g must be true in the intended interpretation. 6. Users can interpret the answer using their intended interpretation of the symbols. � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 12

  13. Computer’s view of semantics The computer doesn’t have access to the intended interpretation. All it knows is the knowledge base. The computer can determine if a formula is a logical consequence of KB. If KB | = g then g must be true in the intended interpretation. If KB �| = g then there is a model of KB in which g is false. This could be the intended interpretation. � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 13

  14. Electrical Environment outside power cb1 w5 s1 w1 circuit breaker cb2 s2 w2 w3 off s3 w0 switch on w6 w4 two-way p2 switch l1 light p1 l2 power outlet � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 14

  15. Representing the Electrical Environment lit l 1 ← live w 0 ∧ ok l 1 light l 1 . live w 0 ← live w 1 ∧ up s 2 . light l 2 . live w 0 ← live w 2 ∧ down s 2 . down s 1 . live w 1 ← live w 3 ∧ up s 1 . up s 2 . live w 2 ← live w 3 ∧ down s 1 . up s 3 . lit l 2 ← live w 4 ∧ ok l 2 . ok l 1 . live w 4 ← live w 3 ∧ up s 3 . ok l 2 . live p 1 ← live w 3 . ok cb 1 . live w 3 ← live w 5 ∧ ok cb 1 . ok cb 2 . live p 2 ← live w 6 . live outside . live w 6 ← live w 5 ∧ ok cb 2 . live w 5 ← live outside . � D. Poole and A. Mackworth 2010 c Artificial Intelligence, Lecture 5.1, Page 15

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Because propositions in such a logic may no longer be freely copied or ig- standing propositions

Because propositions in such a logic may no longer be freely copied or ig- standing propositions

Because propositions in such a logic may no longer be freely copied or ig- standing propositions in sub- structural logics as repre- senting resources rather than truth. nored, this suggests under- Programming with Affine Types CS 51 &

2.11k views • 194 slides
Overview Propositions and Propositions Distinguish two construals of declaratives. I As a

Overview Propositions and Propositions Distinguish two construals of declaratives. I As a

Introduction Overview Propositions and Propositions Distinguish two construals of declaratives. I As a proposition in the analytic philosophical sense. I As a proposition in the ordinary business sense. Paul Dekker Clarify relativist discourse.

172 views • 6 slides
Propositions 419, 420, and 421 present an integrated and comprehensive approach to improve

Propositions 419, 420, and 421 present an integrated and comprehensive approach to improve

Propositions 419, 420, and 421 present an integrated and comprehensive approach to improve Flagstaffs transportation system, address congestion, and plan for our future. Propositions 419, 420, and 421 Proposition 419 : Connecting Our

510 views • 27 slides
Propositions 419, 420, and 421 present an integrated and comprehensive approach to improve

Propositions 419, 420, and 421 present an integrated and comprehensive approach to improve

Propositions 419, 420, and 421 present an integrated and comprehensive approach to improve Flagstaffs transportation system, address congestion, and plan for our future. Propositions 419, 420, and 421 Proposition 419 : Connecting Our

493 views • 26 slides
Ballot Propositions November 2016 Election Dr. Nadine Koch October 2016 Agenda n The Initiative

Ballot Propositions November 2016 Election Dr. Nadine Koch October 2016 Agenda n The Initiative

Ballot Propositions November 2016 Election Dr. Nadine Koch October 2016 Agenda n The Initiative Process in California n Overview of the 17 Propositions (Props.51-67) n A closer look at the most high profile propositions 2 Progressive reforms,

952 views • 40 slides
Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical

Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical

Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies Valentin Goranko Stockholm University September 2016 Goranko Propositions Proposition: statement which can be

382 views • 21 slides
+ Propositional Logic Revision Tutorial Mr Tony Chung a.chung@lancaster.ac.uk

+ Propositional Logic Revision Tutorial Mr Tony Chung a.chung@lancaster.ac.uk

+ Propositional Logic Revision Tutorial Mr Tony Chung a.chung@lancaster.ac.uk http://www.tonychung.net/ + Todays Objectives 2 Propositions Complex Propositions Valid Propositions Correct or Incorrect? Is it a predicate?

887 views • 22 slides
propositions to elements of B E.g.: A B = A B x

propositions to elements of B E.g.: A B = A B x

Models and termination of proof-reduction in the -calculus modulo theory Gilles Dowek Models and truth values A model: a set M , a set B , a function (parametrized by valuations) . mapping terms to elements of M , and propositions to

454 views • 16 slides
Alternative Representations Propositions and State-Variables 1 Literature Malik Ghallab,

Alternative Representations Propositions and State-Variables 1 Literature Malik Ghallab,

Alternative Representations Propositions and State-Variables Alternative Representations Propositions and State-Variables 1 Literature Malik Ghallab, Dana Nau, and Paolo Traverso. Automated Planning Theory and Practice , chapter 2.

534 views • 30 slides
Today Propositional logic. Connecting Propositions with Boolean Operators A proposition is a

Today Propositional logic. Connecting Propositions with Boolean Operators A proposition is a

Today Propositional logic. Connecting Propositions with Boolean Operators A proposition is a statement that is true or false. Propositions? 3 = 4 1 ? Proposition! 3 = 5 ? Proposition! A B , A B , A , A = B . 3 ? Not a

406 views • 3 slides
Model Checking Tutorial 4 1. Let the set of atomic propositions be { a, b, c } . (a) Rewrite the

Model Checking Tutorial 4 1. Let the set of atomic propositions be { a, b, c } . (a) Rewrite the

Model Checking Tutorial 4 1. Let the set of atomic propositions be { a, b, c } . (a) Rewrite the CTL formula A [ a U ( AF c ) ] in existential normal form (that is, using only EX , EU and EG ). (b) Which states of the transition system below

205 views • 3 slides
Constraints on credences in two not mutually exclusive propositions: the search for the best

Constraints on credences in two not mutually exclusive propositions: the search for the best

Constraints on credences in two not mutually exclusive propositions: the search for the best belief update function. . . Leszek Wroski Institute of Philosophy Jagiellonian University Krakw, Poland Full and Partial Belief Workshop

512 views • 29 slides
Definitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean

Definitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean

Definitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg Undefined Terms: Point, Line, Incident, Between, Congruent. Incidence Axioms: IA1: For every two distinct points there

444 views • 6 slides
FY2016/1Q Results Presentation July 29, 2016 Ever-improving value propositions to customers and

FY2016/1Q Results Presentation July 29, 2016 Ever-improving value propositions to customers and

FY2016/1Q Results Presentation July 29, 2016 Ever-improving value propositions to customers and society Advancement of New Speed mobile ICT ideas (Device/Network/Software) Service creation/evolution Promotion of +d Deliver

479 views • 31 slides
Sustainable circular economy value propositions in clothing as a service -model IS PIM Virtual

Sustainable circular economy value propositions in clothing as a service -model IS PIM Virtual

Sustainable circular economy value propositions in clothing as a service -model IS PIM Virtual 2020 Maria Antikainen, VTT Jouko Heikkil, VTT Henna Knuutila & Piia Nurmi, Turku University of Applied Sciences Pivi Petnen, VTT

322 views • 10 slides
Logic Charles L Dodgson 1832 - 1898 It s so easy even Propositions, computers can do

Logic Charles L Dodgson 1832 - 1898 It s so easy even Propositions, computers can do

IIT Bombay :: Autumn 2020 :: CS 207 :: Discrete Structures :: Manoj Prabhakaran Logic Charles L Dodgson 1832 - 1898 It s so easy even Propositions, computers can do Predicates, it! Operators, Formulas c i Expert Systems g o L

299 views • 11 slides
CS 331: Artificial Intelligence Propositional Logic I 1 Knowledge-based Agents Can represent

CS 331: Artificial Intelligence Propositional Logic I 1 Knowledge-based Agents Can represent

CS 331: Artificial Intelligence Propositional Logic I 1 Knowledge-based Agents Can represent knowledge And reason with this knowledge How is this different from the knowledge used by problem-specific agents? More general More

430 views • 26 slides
Chapter Overview 5.1 Introduction 5.2 The ABCs of Caches 5.3 Reducing Cache Misses 5.4

Chapter Overview 5.1 Introduction 5.2 The ABCs of Caches 5.3 Reducing Cache Misses 5.4

Chapter Overview 5.1 Introduction 5.2 The ABCs of Caches 5.3 Reducing Cache Misses 5.4 Reducing Cache Miss Penalty 5.5 Reducing Hit Time 5.6 Main Memory 5.7 Virtual Memory 5.8 Protection and Examples of Virtual Memory 1 The Big Picture:

1.24k views • 99 slides
Access Network Measurements Source: http://commons.wikimedia.org/wiki/

Access Network Measurements Source: http://commons.wikimedia.org/wiki/

Access Network Measurements Source: http://commons.wikimedia.org/wiki/ File%3ALautsprecherkabel_Makro_nah.jpg Delay = d0 + PacketSize / Capacity? Access networks are session stateful Packet-based processing Pronounced asymmetry

94 views • 5 slides
Collection of Paradata in CAPI System Vesa Kuusela Social Survey Unit Statistics Finland

Collection of Paradata in CAPI System Vesa Kuusela Social Survey Unit Statistics Finland

Collection of Paradata in CAPI System Vesa Kuusela Social Survey Unit Statistics Finland Background Paradata did not exist in paper-and-pencil era Computer Assisted Interviewing (CAI) systems brought along many possibilities to

224 views • 10 slides
Inference Techniques for Logical Reasoning Recall: Wumpus World Wumpus You (Agent) 2

Inference Techniques for Logical Reasoning Recall: Wumpus World Wumpus You (Agent) 2

CSE 473 Chapter 7 Inference Techniques for Logical Reasoning Recall: Wumpus World Wumpus You (Agent) 2 Wumpusitional Logic Proposition Symbols and Semantics: Let P i,j be true if there is a pit in [i, j]. Let B i,j be true if there is a

331 views • 22 slides
function TT-Entails? ( KB , ) returns true or false symbols a list of the proposition

function TT-Entails? ( KB , ) returns true or false symbols a list of the proposition

B.Y. Choueiry function TT-Entails? ( KB , ) returns true or false symbols a list of the proposition symbols in KB and return TT-Check-All ( KB , , symbols ,[ ]) function TT-Check-All ( KB , , symbols , model ) returns true

360 views • 3 slides
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme L eo Ducas (CWI), Eike Kiltz

CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme L eo Ducas (CWI), Eike Kiltz

CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme L eo Ducas (CWI), Eike Kiltz (Ruhr-Universit at Bochum), Tancr` ede Lepoint (SRI International), Vadim Lyubashevsky (IBM Research), Peter Schwabe (Radboud University), Gregor

1.06k views • 36 slides
Proofs A proof is a mechanically derivable demonstration that a formula logically follows from

Proofs A proof is a mechanically derivable demonstration that a formula logically follows from

Proofs A proof is a mechanically derivable demonstration that a formula logically follows from a knowledge base. Given a proof procedure, KB g means g can be derived from knowledge base KB . Recall KB | = g means g is true in all

296 views • 7 slides

More recommend