Karteikarten
Artificial intelligence - Logical Agents
Karten in diesem Stapel (17)
- 1Operation on KBA1. Tell : add new sentence
2. Ask : query what is know
3. Make-percept-Sentence : construct a sentence asserting that the agent perceived the given
percept at the given time.
4. Make-Action-Query : construct a sentence that asks what action should be done at the current time
5. Make-Action-Sentence : constructs a sentence asserting that the chosen action was excecuted
There operations involve inference (deriving new sentences from old) - 2Knowledge representation
- 3Logic
- 4Interpretation and Models
- 5Logical entailment
- 6How to verify entailment ?• Enumeration of the interpretations
• Find the interpretations which are models of α
• Check that β is true in these models
α |- β - 7Soundness and CompletenessSoundness means that you cannot prove anything that's wrong.
Completeness means that you can prove anything that's right.
- 8Model checking1. Enumerate the interpretations
(2^n where n is the number of symbol)
2. Check wheter α = P1,2 is true in every model of KB
The algorithm is sound because it impletments directly the definition of entailment and complete
because it work for any KB and α.
Complexity time complexity is O(2n) and space complexity O(n) because it’s a depth-first. - 9Validity and satisfiability
- 10Proofs As Search
- 11Convertion to CNF
- 12Inference with Horn clauses
- 13Davis Putman algorithm
- 14The DPLL algorithm
- 15WalkSAT : Local Search
- 16The WalkSAT algorithm
- 17Summary
Informationen
- Beschreibung
- Karteikarten am Artificial intelligence - Logical Agents, erstellt von Wojciech Gryncze am 11/01/2016.
- Erstellt von
- Wojciech Gryncze
- Aufrufe
- 3
- Bewertung