public:t-622-arti-13-1:lab_4_-_propositional_logic
This is an old revision of the document!
Table of Contents
Lab 4 - Propositional Logic / Inference
Problem Description
(Based on “The Adventure of Silver Blaze,” an original Sherlock Holmes mystery by Arthur Conan Doyle)
A prize-winning racehorse named Silver Blaze has been stolen from a stable, and a bookmaker named Fitzroy Simpson has been arrested as the prime suspect by good old Inspector Gregory. Sherlock Holmes, however, after ample use of his magnifying glass and some of the strongest black tobacco this side of the Atlantic, finds the true thief by reasoning from the following premises:
- The horse was stolen either by Fitzroy or by its trainer John Straker.
- The thief had to have entered the stable the night of the theft.
- If a stranger enters the stable, the dog barks.
- Fitzroy was a stranger.
- The dog did not bark.
Who stole Silver Blaze?
Tasks:
- Encode all the given information as a knowledge base <latex>$KB$</latex> in propositional logic.
- Write down which propositional symbols you used and which facts in the environment they represent.
- Use the inference rules and equivalences below to infer who is the thief. For each inference step note which sentences and which inference rule / equivalence you used!
Inference Rules and Equivalences
- <latex>$\{ \alpha \Rightarrow \beta, \alpha \} \: \vdash \: \beta $</latex>
- <latex>$\{ \alpha \Rightarrow \beta, \neg \beta \} \: \vdash \: \neg \alpha $</latex>
- <latex>$\{ \alpha \land \beta, . \} \: \vdash \: \alpha $</latex>
- <latex>$\{ \alpha , \beta \} \: \vdash \: \alpha \land \beta $</latex>
- <latex>$\{ \alpha , . \} \: \vdash \: \alpha \lor \beta $</latex>
- <latex>$\{ \alpha \lor \beta, \neg \alpha \} \: \vdash \: \beta $</latex>
- <latex>$ \alpha \Leftrightarrow \beta \: \equiv \: \beta \Leftrightarrow \alpha $</latex>
- <latex>$ \alpha \Leftrightarrow \beta \: \equiv \: (\alpha \Rightarrow \beta) \land \beta \Rightarrow \alpha $</latex>
- <latex>$ \alpha \Rightarrow \beta \: \equiv \: \neg \alpha \lor \beta $</latex>
- <latex>$ \alpha \land \beta \: \equiv \: \beta \land \alpha $</latex>
- <latex>$ \alpha \lor \beta \: \equiv \: \beta \lor \alpha $</latex>
- <latex>$ \neg (\alpha \land \beta) \: \equiv \: \neg \alpha \lor \neg \beta $</latex>
- <latex>$ \neg (\alpha \lor \beta) \: \equiv \: \neg \alpha \land \neg \beta $</latex>
- <latex>$ \neg \neg \alpha \: \equiv \: \alpha $</latex>
/var/www/cadia.ru.is/wiki/data/attic/public/t-622-arti-13-1/lab_4_-_propositional_logic.1361444527.txt.gz · Last modified: 2024/04/29 13:32 (external edit)