Top-down Ground Proof Procedure Idea: search backward from a query - PowerPoint PPT Presentation

Jan 08, 2023 •207 likes •291 views

Top-down Ground Proof Procedure Idea: search backward from a query to determine if it is a logical consequence of KB . An answer clause is of the form: yes a 1 a 2 . . . a m The SLD Resolution of this answer clause on atom a i with

Top-down Ground Proof Procedure Idea: search backward from a query to determine if it is a logical consequence of KB . An answer clause is of the form: yes ← a 1 ∧ a 2 ∧ . . . ∧ a m The SLD Resolution of this answer clause on atom a i with the clause: a i ← b 1 ∧ . . . ∧ b p is the answer clause yes ← a 1 ∧· · ·∧ a i − 1 ∧ b 1 ∧ · · · ∧ b p ∧ a i +1 ∧ · · · ∧ a m . � D. Poole and A. Mackworth 2008 c Artificial Intelligence, Lecture 5.3, Page 1
Derivations An answer is an answer clause with m = 0. That is, it is the answer clause yes ← . A derivation of query “? q 1 ∧ . . . ∧ q k ” from KB is a sequence of answer clauses γ 0 , γ 1 , . . . , γ n such that ◮ γ 0 is the answer clause yes ← q 1 ∧ . . . ∧ q k , ◮ γ i is obtained by resolving γ i − 1 with a clause in KB , and ◮ γ n is an answer. � D. Poole and A. Mackworth 2008 c Artificial Intelligence, Lecture 5.3, Page 2
Top-down definite clause interpreter To solve the query ? q 1 ∧ . . . ∧ q k : ac := “ yes ← q 1 ∧ . . . ∧ q k ” repeat select atom a i from the body of ac ; choose clause C from KB with a i as head; replace a i in the body of ac by the body of C until ac is an answer. � D. Poole and A. Mackworth 2008 c Artificial Intelligence, Lecture 5.3, Page 3
Nondeterministic Choice Don’t-care nondeterminism If one selection doesn’t lead to a solution, there is no point trying other alternatives. select Don’t-know nondeterminism If one choice doesn’t lead to a solution, other choices may. choose � D. Poole and A. Mackworth 2008 c Artificial Intelligence, Lecture 5.3, Page 4
Example: successful derivation a ← b ∧ c . a ← e ∧ f . b ← f ∧ k . c ← e . d ← k . e . f ← j ∧ e . f ← c . j ← c . Query: ? a γ 0 : yes ← a γ 4 : yes ← e γ 1 : yes ← e ∧ f γ 5 : yes ← γ 2 : yes ← f γ 3 : yes ← c � D. Poole and A. Mackworth 2008 c Artificial Intelligence, Lecture 5.3, Page 5
Example: failing derivation a ← b ∧ c . a ← e ∧ f . b ← f ∧ k . c ← e . d ← k . e . f ← j ∧ e . f ← c . j ← c . Query: ? a γ 0 : yes ← a γ 4 : yes ← e ∧ k ∧ c γ 1 : yes ← b ∧ c γ 5 : yes ← k ∧ c γ 2 : yes ← f ∧ k ∧ c γ 3 : yes ← c ∧ k ∧ c � D. Poole and A. Mackworth 2008 c Artificial Intelligence, Lecture 5.3, Page 6
Search Graph for SLD Resolution yes ← a ^ d yes ← h ^ d yes ← b ^ c ^ d yes ← g ^ d yes ← m ^ d yes ← m ^ d yes ← j ^ c ^ d yes ← f ^ d a ← b ∧ c . a ← g . yes ← k ^ c ^ d a ← h . b ← j . yes ← m ^ d yes ← p ^ d b ← k . d ← m . yes ← m ^ c ^ d d ← p . f ← m . yes ← d f ← p . g ← m . yes ← m yes ← p g ← f . k ← m . h ← m . p . yes ← ? a ∧ d � D. Poole and A. Mackworth 2008 c Artificial Intelligence, Lecture 5.3, Page 7

Recommend

Practical proof reconstruction for first-order logic and set-theoretical constructions Cl

Practical proof reconstruction for first-order logic and set-theoretical constructions Cl ement Hurlin January 25, 2007 Outline 1 Introduction Two different worlds Proof reconstruction General procedure Targeted languages 2 Quantifier

1.02k views • 43 slides

Top-down Definite Clause Proof Procedure Idea: search backward from a query to determine if it is

Top-down Definite Clause Proof Procedure Idea: search backward from a query to determine if it is a logical consequence of KB . An answer clause is of the form: yes a 1 a 2 . . . a m The SLD Resolution of this answer clause on atom

389 views • 7 slides

Narrative Storyline Development AIM Training Workshop Tokyo, Japan Oct 22-26, 2007 General

Narrative Storyline Development AIM Training Workshop Tokyo, Japan Oct 22-26, 2007 General Flow of LCS Vision Development Tomoki Ehara Contents Contents Back Ground Back Ground Procedure Background Procedure J apan2050 visions J

403 views • 22 slides

3515ICT Theory of Computation Some sample proofs 4-0 Proof types 1. Proof

Griffith University 3515ICT Theory of Computation Some sample proofs 4-0 Proof types 1. Proof by construction 2. Proof by equivalence 3. Proof by contradiction 4. Proof by case analysis 5. Proof by induction

549 views • 11 slides

Optimizing Procedure Calls Inlining Procedure calls can be costly (A.k.a. procedure integration,

Optimizing Procedure Calls Inlining Procedure calls can be costly (A.k.a. procedure integration, unfolding, beta-reduction, ...) direct costs of call, return, argument & result passing, stack frame maintainance Replace call with body of

279 views • 5 slides

Optimizing Procedure Calls Inlining Procedure calls can be costly (A.k.a. procedure integration,

497 views • 4 slides

Painswick Recreation Ground No Planning Application yet submitted Submission will be

Painswick Recreation Ground No Planning Application yet submitted Submission will be made to Stroud District Council Procedure is seeking Prior Approval Painswick Recreation Ground About Shared Access Shared Access are an

358 views • 13 slides

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

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 models of KB

226 views • 7 slides

1 2 3 KASS Certification Procedure Operation System Certification Certification Training

1 2 3 KASS Certification Procedure Operation System Certification Certification Training Inspection/Audit Establish MoC Status of Operator/ Maintainer Manual, Function Identify CRB Record and Interfaces Result of Form Ground/

618 views • 24 slides

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

296 views • 7 slides

Variational principle (Ch. 7) Only Sec. 7.1 Theorem: For an arbitrary | , the ground state

EE201/MSE207 Lecture 16 Variational principle (Ch. 7) Only Sec. 7.1 Theorem: For an arbitrary | , the ground state energy satisfies inequality = Proof is simple. Let us expand =

110 views • 9 slides

LCLSII Warm FPC Assembly to Cryomodule 1.0 General notes 1.1 This procedure specifies and documents

LCLSII Warm FPC Assembly to Cryomodule Procedure Title CP L2PRO FPCW AC Procedure ID This procedure specifies the assemble of the LCLSII Warm FPC Procedure Description to the cryomodule. R1 Revision Sign : Date : Author Name : Mircea

413 views • 18 slides

A Mathematical Proof When referring to a proof in logic we usually mean: 1. A sequence of

A Mathematical Proof When referring to a proof in logic we usually mean: 1. A sequence of statements. 2. Based on axioms. 3. Each statement is derived via the derivation rules. Zero Knowledge Protocols 4. The proof is fixed, i.e, in any time,

642 views • 14 slides

Todays Topics 1. Procedures and Procedure Call 2. Array and Record Types Procedure and

Todays Topics 1. Procedures and Procedure Call 2. Array and Record Types Procedure and Function Calls How to type check? - Example-driven, modelling, coding to the spec. Example: PROCEDURE foo (x : INTEGER; y : REAL) : BOOLEAN;

189 views • 8 slides

Fatigue Management Procedure Your organization NEEDS a fatigue management procedure

Fatigue Management Procedure Your organization NEEDS a fatigue management procedure Procedure Absolutes: Clear Work Day, Work Hour, and rest period limits Exceptions: Job Critical Can employees perform the work safely

451 views • 4 slides

CALTRAIN FARE ENFORCEMENT ORDINANCE AND PROCEDURE Prepared by: Caltrain Rail Operations

CALTRAIN FARE ENFORCEMENT ORDINANCE AND PROCEDURE Prepared by: Caltrain Rail Operations December 7, 2017 Current Boarding Environment Open Barrier / Honor-based System Fare Media Proof-of-payment System Total Annual

348 views • 15 slides

Lecture 4: Procedure Calls Todays topics: Procedure calls Large constants The

Lecture 4: Procedure Calls Todays topics: Procedure calls Large constants The compilation process Reminder: Assignment 1 is due on Thursday 1 Recap The jal instruction is used to jump to the procedure and save the

442 views • 23 slides

Procedure Procedure: a description of a computation that, given an input, produces an output.

Procedure Procedure: a description of a computation that, given an input, produces an output. Example: def mul(p,q): return p*q Computational Problem: an input-output specification that a procedure might be required to satisfy. Example: Integer

673 views • 32 slides

The SQL Procedure Language (SQL PL) Tony Andrews Themis Education tandrews@themisinc.com

The SQL Procedure Language (SQL PL) Tony Andrews Themis Education tandrews@themisinc.com www.themisinc.com Coding a SQL PL Procedure An SQL procedure consists of: CREATE PROCEDURE header BEGIN statement Body (SQL procedural

1.13k views • 34 slides

Problem Chapter 5.3: Suppose you want to make a procedure call Remote Procedure Calls Caller

Problem Chapter 5.3: Suppose you want to make a procedure call Remote Procedure Calls Caller and called code are on different Internet hosts Situation is remote procedure call CS/ECPE 5516: Comm. Network Prof. Abrams Spring 2000

320 views • 3 slides

Scout, NegaScout and Proof-Number Search Tsan-sheng Hsu tshsu@iis.sinica.edu.tw

Scout, NegaScout and Proof-Number Search Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Introduction It looks like alpha-beta pruning is the best we can do for a generic searching procedure. What else can be

947 views • 49 slides

GENERAL PROCEDURE OF FE SOFTWARE FE SOFTWARE PROCEDURE PRE PROCESSING SOLVING POST

GENERAL PROCEDURE OF FE SOFTWARE FE SOFTWARE PROCEDURE PRE PROCESSING SOLVING POST PROCESSING SOLVING GENERAL PROCEDURE ENGINEERING MATHEMATICS (PDE) FEM DERIVATION COMPUTER PROGRAMMING CODE VALIDATION FREE VIBRATION

232 views • 19 slides

PROCEDURE FOR GENERATING PROCEDURE FOR GENERATING XGN GENERATED MANIFEST XGN GENERATED MANIFEST

PROCEDURE FOR GENERATING PROCEDURE FOR GENERATING XGN GENERATED MANIFEST XGN GENERATED MANIFEST STEP 1: Visit below URL (Preferred Internet Explorer) htup://gpcbxgn.gujarat.gov.in/login.aspx STEP2: Enter User Id & Password received from

291 views • 10 slides

CS 671 Automated Reasoning Proof Automation in First Order Logic 1. Tactic-based proof search 2.

CS 671 Automated Reasoning Proof Automation in First Order Logic 1. Tactic-based proof search 2. Complete proof search with JProver Tactic-based proof search Sort rule applications by cost of induced proof search let simple prover = Repeat (

562 views • 9 slides