

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
A basic introduction to knowledge-based agents in artificial intelligence. It covers key concepts such as knowledge representation, axioms, declarative and procedural approaches, and logical reasoning. The document also introduces propositional logic and its fundamental concepts, including entailment, logical equivalence, validity, and satisfiability. It further explores inference rules like modus ponens, and-elimination, and resolution.
Typology: Exams
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Knowledge-based agents - Agents which use processes of REASONING which operate on internal REPRESENTATIONS of knowledge. Knowledge Base - The central component of a knowledge based agent. Is a set of SENTENCES knowledge representation language - How SENTANCES are expressed in the KBA's Knowledge Base. Axiom - A base/key sentence in a KBA's knowledge base. Is true without the support of other sentences. Declarative approach - The approach where the the agent designer TELLs sentences one by one until the agent knows how to operate. Proceedural Approach - the approach where desired behaviors are encoded directly Syntax - How the sentences in a agent's knowledge base are represented and interact with one another. ex. x4y> is not ___ally correct. Semantics - How the "meaning" of the sentences in an agent's knowledge base are defined. (Truth value with respect to the model in question) Entailment - When a sentence follows logically from the truth value of another sentence within the given model. Propositional Logic - a branch of formal, deductive logic in which the atomic sentence is the proposition (i.e. P,Q,R etc.)
Logical Equivelence - When two sentences are true in the same set of models. Validity - When a sentence is true in ALL models (tautology) Satisfiability - When a sentence is true in SOME model Clause - A disjunction of literals Horn Clause - a disjunction of literals of which at most one is positive Inference - Deriving a sentence from the truth value of another sentence. Soundness - Whenever KB infers a, then KB entails a is true Completeness - Whenever KB entails a, then KB infers a Modus Ponens - If P then Q P Therefore Q And-Elimination - a & b & c therefore a And-Introduction - a,b,c,d therefore