Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
ground substitutionhere the act of performing an instantiation is a function like there is only one possible outcome means we can write it as a
first-order inference ruleshere now we have a clear definition of a first-order model is that we can define soundness for first-order inference rules
propositional truth tablesthere xt is a substitution that replaces all occurances of variable x with a term representing an object t as forallx a
quantifiers and variables - propositional modelthere is one question is arrives that what do sentences containing variables mean in other way of
predicates in propositional modelthe predicates take a number of arguments in which for now we assume are ground terms and represent a relationship
terms in propositional modelthere in first-order logic allows us to talking about properties of objects that the first job for our model delta theta
propositional modelhence a propositional model was simply an assignments of truth values to propositions in distinguish a first-order model is a pair
first-order modelshere if we proposed first-order logic as a good knowledge representation language than propositional logic is just because there is
unit resolutionby assuming that we knew the sentence as tony blair is prime minister or may the moon is made of blue cheese is true or we later found
or-introduction thus if we know about one thing is true and also we know that a sentence when there thing is in a disjunction is true here if we
and-introductionin generally english says that if we know that a lot of things are true so we know that the conjunction of all of them is true then
and-elimination rulein generally english says that if you know that lots of things are all true so you know like any one of them is also true because
implication connective - modus ponens rulewe notice that this is a trivial example so it highlights how we use truth tables as the first line is the
propositional inference rulespropositional inference rules equivalence rules are mostly useful because of the vice-versa aspect that means like we
eequivalences rulesthis conveys a meaning that is actually much simpler so than you would think on first inspection hence we can justify this by
equivalencesin this following miscellaneous equivalence rules are often useful during rewriting sessions so there the first two allow us to
double negation all parents are forever correcting their children for the find of double negatives there we have to be very alert with them in
associativity of connectives here brackets are very important in order to tell us where to perform calculations in arithmetic and logic by using
extension of propositional logicaway from proving theorems directly and the other main use for rewrite rules is to prepare a statement just for
rule in a single direction - equivalences ruleshence there the power to replace sub expressions always allows use to prove theorems with
replacement and substitutionhowever equivalences allow us to change one sentence with another without affecting the meaning it means we know already
avoiding overfitting however remember there that in the previous lecture there is over fitting that common problem in machine learning furthermore
appropriate problems for decision tree learning however remember there that is a skilled job in ai to choose exactly the right learning
biological motivation however remember there that in discussion first lecture is about how people have answered the question like how are we going to
two layer artificial neural networkshowever decision trees are whenever powerful they are as a simple representation scheme whereas graphical on the