by jj2739


keywords:
Bookmark and Share



Front Back
In a tree, knowledge is stored in the ______.
Nodes
In a binary tree, there is a maximum of ______ children per node
Two
Lattice
A directed acyclic graph
A state space is a set of states showing the ___________ between states that the object can experience
Transition
FMS
Finite Machine State
A well-formed problem is _______________ if when an operator is applied to a state, we are sure of the next state
Deterministic
In an AND-OR tree, an AND node can be satisfied only if ______ of its subgoals are satisfied
All
Induction
Type of inference from the specific case to the general
Heuristics is inference based on ___________.
Experience
Abduction
Reasoning back from a true conclusion to all the premises that may haved caused the conclusion
Deduction
Logical reasoning where conclusions must follow their premises
In the statement, "All collies are dogs", the predicate is _______ and the subject is _______.
Dogs, Collies
Universal affirmation is a categorical ___-form statement
A
Some S is not P is called ___________ negation
Particular
According to the general rules for drawing categorical syllogisms, if a class is empty it is ________.
Shaded
The truth table for modus ponens results in a __________.
Tautology
If an argument is invalid, it is (True/False) that the conclusion is always incorrect
False
Logic systems rely on ________ to prove theorems
Axioms
While induction makes inferences from the specific to the general of the same situation, ____________ tries to make inferences from situations that are not the same
Analogy
Axioms
Fundamental definitions of a logical system, accepted without proof
Analogy
Inferring a conclusion based on similarities of another situation
Chain
A group of multiple inferences that connect a problem with its solution
Graph
A nonhierarchical data structure consisting of nodes and unrestricted branches connecting them
State
The collection of characteristics that can define the status of an object
Theorems
New rules of inference that can be proven by axioms
Tree
A hierarchical data structure consisting of nodes and branches
x of y cards