Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 11, Problem 24CRP
Program Plan Intro
Production system:
Production system consists of condition-action rules, a
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
find the suitable term for the following sentences are the type of quantifiers, which express that the statement within its scope is true for at least one instance of something.
Choose... is someone who is capable of designing, building and testing an expert system
Choose... is a knowledgeable and skilled person capable of solving problems in a specific area or domain
Choose... is a symbol of logical representation, which specifies that the statement within its range is true for everything or every instance of a particular thing
In "Computing Machines and Intelligence," the English mathematician Alan Turing (1912-1954) wrote,
"If each man had a definite set of rules of conduct by which he regulated his life, he would be a machine, but there are no such rules, so men cannot be machines."
Using what you now know about Logic, determine whether this statement make sense and explain. Construct a truth table for Turing's statement and determine if this statement is a tautology.
Formal Methods are based on logic reasoning. Conceptually the two most common logics are propositional logic and Predicate Logic.
An undergraduate student who took a course of discrete mathematics is inquiring as to how propositional and predicate logics can be used in software testing. You are asked to guide this student in this quest.
One pointer may consist in presenting the characteristics and limitations of both logic as well as their use as a mean for software testing. Which Logic is most adequate for formal verification of software and how this should be implemented?
Chapter 11 Solutions
Computer Science: An Overview (12th Edition)
Ch. 11.1 - Prob. 1QECh. 11.1 - Prob. 2QECh. 11.1 - Prob. 3QECh. 11.1 - Prob. 4QECh. 11.1 - Prob. 5QECh. 11.2 - Prob. 1QECh. 11.2 - Prob. 2QECh. 11.2 - Prob. 3QECh. 11.2 - Prob. 4QECh. 11.2 - Identify the ambiguities involved in translating...
Ch. 11.2 - Prob. 6QECh. 11.2 - Prob. 7QECh. 11.3 - Prob. 1QECh. 11.3 - Prob. 2QECh. 11.3 - Prob. 3QECh. 11.3 - Prob. 4QECh. 11.3 - Prob. 5QECh. 11.3 - Prob. 6QECh. 11.3 - Prob. 7QECh. 11.3 - Prob. 8QECh. 11.3 - Prob. 9QECh. 11.4 - Prob. 1QECh. 11.4 - Prob. 2QECh. 11.4 - Prob. 3QECh. 11.4 - Prob. 4QECh. 11.4 - Prob. 5QECh. 11.5 - Prob. 1QECh. 11.5 - Prob. 2QECh. 11.5 - Prob. 3QECh. 11.5 - Prob. 4QECh. 11.6 - Prob. 1QECh. 11.6 - Prob. 2QECh. 11.6 - Prob. 3QECh. 11.7 - Prob. 1QECh. 11.7 - Prob. 2QECh. 11.7 - Prob. 3QECh. 11 - Prob. 1CRPCh. 11 - Prob. 2CRPCh. 11 - Identify each of the following responses as being...Ch. 11 - Prob. 4CRPCh. 11 - Prob. 5CRPCh. 11 - Prob. 6CRPCh. 11 - Which of the following activities do you expect to...Ch. 11 - Prob. 8CRPCh. 11 - Prob. 9CRPCh. 11 - Prob. 10CRPCh. 11 - Prob. 11CRPCh. 11 - Prob. 12CRPCh. 11 - Prob. 13CRPCh. 11 - Prob. 14CRPCh. 11 - Prob. 15CRPCh. 11 - Prob. 16CRPCh. 11 - Prob. 17CRPCh. 11 - Prob. 18CRPCh. 11 - Give an example in which the closed-world...Ch. 11 - Prob. 20CRPCh. 11 - Prob. 21CRPCh. 11 - Prob. 22CRPCh. 11 - Prob. 23CRPCh. 11 - Prob. 24CRPCh. 11 - Prob. 25CRPCh. 11 - Prob. 26CRPCh. 11 - Prob. 27CRPCh. 11 - Prob. 28CRPCh. 11 - Prob. 29CRPCh. 11 - Prob. 30CRPCh. 11 - Prob. 31CRPCh. 11 - Prob. 32CRPCh. 11 - Prob. 33CRPCh. 11 - What heuristic do you use when searching for a...Ch. 11 - Prob. 35CRPCh. 11 - Prob. 36CRPCh. 11 - Prob. 37CRPCh. 11 - Prob. 38CRPCh. 11 - Suppose your job is to supervise the loading of...Ch. 11 - Prob. 40CRPCh. 11 - Prob. 41CRPCh. 11 - Prob. 42CRPCh. 11 - Prob. 43CRPCh. 11 - Prob. 44CRPCh. 11 - Prob. 45CRPCh. 11 - Prob. 46CRPCh. 11 - Prob. 47CRPCh. 11 - Prob. 48CRPCh. 11 - Draw a diagram similar to Figure 11.5 representing...Ch. 11 - Prob. 50CRPCh. 11 - Prob. 51CRPCh. 11 - Prob. 52CRPCh. 11 - Prob. 53CRPCh. 11 - Prob. 54CRPCh. 11 - Prob. 55CRPCh. 11 - Prob. 56CRPCh. 11 - Prob. 57CRPCh. 11 - Prob. 1SICh. 11 - Prob. 2SICh. 11 - Prob. 3SICh. 11 - Prob. 4SICh. 11 - Prob. 5SICh. 11 - Prob. 6SICh. 11 - Prob. 7SICh. 11 - Prob. 8SICh. 11 - Prob. 9SICh. 11 - Prob. 10SICh. 11 - Prob. 11SICh. 11 - Prob. 12SICh. 11 - A GPS in an automobile provides a friendly voice...Ch. 11 - Prob. 14SI
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- 1. Given the following, can you prove the unicorn is mythical? How about Magi- cal? and Horned? (adapted from Barwise and Etchemendy (1993)). if the unicorn is mythical, then it is immortal, but if it is not mythical, then it is a mortal mammal. If the unicorn is either immortal or a mammal, then it is horned. The unicorn is magical if it is horned. 2. Which of the following are correct? (a) False E True (b) (A A B) E (A + B) (c) A + BEAVB (d) A + BE¬AV B (e) (A V B) ^ (¬A V B) is satisfiablearrow_forwardNeed the right answer among choices and also an explanation of the answer.arrow_forwarda) Determine which amounts of postage can be formed using just 3-cent and 11-cent stamps. b) Using the technique done in class, prove your answer to (a) using the principle of strong induction. Make sure you specify Pen and its domain. SHOW ALL STEPS AND WORKarrow_forward
- Please help me solve this question step by step, The reference textbook for this question is "Artificial Intelligence - A Modern Approach (3rd Edition)" I think the corresponding topic is "logic" thanks!arrow_forwardThere are facts that were found through experiments and careful observation. Is it a well-organized body of knowledge based on these facts?arrow_forwardThe foundation of formal approaches is logic. Propositional and predicate logics are the most common conceptual frameworks. An student in discrete mathematics is looking for propositional and predicate logics to use in software testing. Don't leave this student hanging, please. Justify your stance on the rationale and software testing's pros and downsides. How can official plans be checked? So, which is preferable?arrow_forward
- Solve the following puzzle by translating statements into logical expressions and reasoning fromthese expressions.Four friends have been identified as suspects for an unauthorized access into a computer system.They have made statements to the investigating authorities.1-Alice said Carlos did it.2-John said I did not do it.3-Carlos said Diana did it.4-Diana said Carlos lied when he said that I did it.If the authorities also know that exactly one of the four suspects is telling the truth, who didit?arrow_forwardplease refer to the images thanksarrow_forward1. The representation must be on a linear scale (not logarithmic) Linear scale means each year is given the same weight in your scaling. The student is to present the years in a way that really helps the audience to visualize just how long Earth has been around compared to how short an amount of time humans have been on earth, for example. 2. The must include a legend that allows the audience to interpret how they are representing the time since each event has occurred (e.g., 1cm = 1000 years, 1mL = 100,000 years, 1 second = 10,000 years) 4. The student is to include the following important events: Start of life (~3.8 GYA[1]) Origin of eukaryotes (~2–3.5 GYA - your choice within that range) Origin of multicellularity (~2 GYA) Origin of Homo sapiens(~200 KYA) Present time (0 YA) 5. The student is to include at least 3 other events. The events must relate to the history of Earth, not human history. The student will need to find the dates of these events Formation of Earth…arrow_forward
- Use De Morgan’s Laws, and any other logical equivalence facts you know to simplify the followingstatements. Show all your steps. Your final statements should have negations only appear directly nextto the sentence variables (P, Q, etc.), and no double negations. It would be a good idea to use onlyconjunctions, disjunctions, and negations.(a) ¬((¬P ∧ Q) ∨ ¬(R ∨ ¬Q)).(b) ¬((¬P → ¬Q) ∧ (¬Q → R)) (careful with the implications).(c) For both parts above, verify your answers are correct using truth tables. That is, use a truth tableto check that the given statement and your proposed simplification are actually logically equivalent.arrow_forwardThis is Discrete Math. Please show all work and give explanations for solutions. Thank you!arrow_forwardExercise 2. Use induction to define the followings for a formula o: ForAll (o): The set of universally quantified variables. Predicates(): The set of predicates.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education