vu cs201 Mid Term Subjective Solved Past Paper No.8
vu cs201 Introduction to Programming Solved Past Papers
This subjective solved past paper is related to book/course code vu cs201 Introduction to Programming which belongs to vu organization. We have 12 past papers available related to the book/course Introduction to Programming. This past paper has a total of 10 subjective questions belongs to topic Mid Term to get prepared. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to get prepared for exams by learning subjective questions online on NVAEducatio.
NVAEducation also facilitates users to download these solved past papers with an affordable prices. However, users are not enforced to pay for money, rather they can use credits to buy such stuff on NVAEducation. Users can earn credits for doing some little tasks and then you will be able to use that credits to buy solved past papers on NVAEducation.
To overcome the conflict problem stated above, we may choose to use on of the following conflict resolution strategies:
Fire first rule in sequence (rule ordering in list). Using this strategy all the rules in the list are ordered (the ordering imposes prioritization). When more than one rule matches, we simply fire the first in the sequence o Assign rule priorities (rule ordering by importance). Using this approach we assign explicit priorities to rules to allow conflict resolution.
More specific rules (more premises) are preferred over general rules. This strategy is based on the observation that a rule with more premises, in a sense, more evidence or votes from its premises, therefore it should be fired in preference to a rule that has less premises.
Prefer rules whose premises were added more recently to WM (timestamping). This allows prioritizing recently added facts over older facts.
Parallel Strategy (view-points). Using this strategy, we do not actually resolve the conflict by selecting one rule to fire. Instead, we branch out our execution into a tree, with each branch operation in parallel on multiple threads of reasoning. This allows us to maintain multiple view-points on the argument concurrently
(Page 126)- Problem facts, rules
- Concepts
- Relationships
- Start with the goal.
- Goal may be in WM initially, so check and you are done if found!
- If not, then search for goal in the THEN part of the rules (match conclusions, rather than premises). This type of rule is called goal rule.
- Check to see if the goal rule?s premises are listed in the working memory.
- Premises not listed become sub-goals to prove.
- Process continues in a recursive fashion until a premise is found that is not supported by a rule, i.e. a premise is called a primitive, if it cannot be concluded by any rule
- When a primitive is found, ask user for information about it. Back track and use this information to prove sub-goals and subsequently the goal. (Page 126)