Problem: Predicate logic expressions form a simple language: they are composed of terms involving conjunction (and), disjunction (or), implication (implies), biconditional (iff), and negation (not) operators; two constants, "true" and "false"; an infinite set of predicate variables of the form Pn where n is a positive integer; and parenthesis. For example, (P1 implies P2) iff P3 or false is a valid expression, but P3 and (P2 or) is not. Write a program that is given as input a string of ASCII characters E a) Determine if E is a valid predicate logic expression, b) IfE is valid, calculate its Boolean value, asking the user to provide values for each predicate variable. For example, (P1 or P2) implies P3 evaluates to false when P1 is set to true, P2 to false, and P3 to false.

Problem: Predicate logic expressions form a simple language: they are composed of terms involving conjunction (and), disjunction (or), implication (implies), biconditional (iff), and negation (not) operators; two constants, "true" and "false"; an infinite set of predicate variables of the form Pn where n is a positive integer; and parenthesis. For example, (P1 implies P2) iff P3 or false is a valid expression, but P3 and (P2 or) is not. Write a program that is given as input a string of ASCII characters E a) Determine if E is a valid predicate logic expression, b) IfE is valid, calculate its Boolean value, asking the user to provide values for each predicate variable. For example, (P1 or P2) implies P3 evaluates to false when P1 is set to true, P2 to false, and P3 to false.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

1. Simplify the statements so that no negation is outside a quantifier or an expression involving logical connectives. Onge ?(y)ith, CamScanner
Material : Fuzzy Logic As a member of an excellent engineering team, you and the team are asked to design a futuristic car capable of automatically controlling the speed of the car based on the variable linguistic inputs such as temperature and weather (cloud-cover). Now, given three variable linguistics namely: temp = (freezing, cool, warm, hot); cloud-cover = (sunny, partly, overcast); speed = (slow, fast) With each of membership function is as follows (See First Picture): Determine what is the speed of the car if the variable input temp=55oF and the cloudcover = 35% with fuzzy inference rules applied are: If cloud_cover = sunny & temp = warm → speed = fast If cloud_cover = cloudy & temp = cool → speed = slow
A normal function typically does not store data, while functors can preserve information in its member variables. is it true or false
1. (10 points) This is a classical Prolog application. Given the following graph of possible flights between eight US cities: New York Chicago $75 San Francisco $25 $20 $75 $100 $45 $100 Denver $125 $90 LA $80 Dallas $45 $90 San Diego $50 Miami a) Build a knowledge base using the predicate directFlight/2 which encodes one city has direct flight to another city. b) Add to rule that checks if there is a route between two cities. Routes of length zero are allowed. Example queries: route (chicago, chicago). should return yes. route (chicago,la). should return yes. route (la,'San Fracisco'). should return no. c) Add a rule that checks if a route has two legs. route_of_2_legs (chicago,la). should return yes route of 2 legs(chicago,denver). should return no Example queries: d) (optional, 3 extra points)Add cost factor to directFlight, route, and route of 2 legs so that the knowledge base can tell the cost associated with each flight. For example, route(chicago, X, Y). tells all the cities…
. avoid plagiarism Write a rule in Prolog called hailstone(x) that, given a positive integer x, returns the number of elements in the hailstone sequence starting with that x. So, for example, for n=35, the function would return 14.
Recursive Descent subprogram with EBNF rule, using C or Java syntax (syntax) Type (Recursive-Descent Subprogram): -> while () ; The lex method to be used reads a single lexeme, and the lexemes' token code is in the nextToken variable is to the left. Suppose that the defined tokens are respectively: while - WHILE_CODE left parantex - LEFTPAREN_CODE right parenthesis - RIGHTPAREN_CODE semicolon - SEMICOLON_CODE If any error is caught, create the function that calls the error function.
Explain how coercion rules can weaken the beneficial effect of strong typing.
Topic: Concepts of programming Language Compute the weakest precondition for the following selection construct andthe postconditions.b = 5 * (2 * a + b);a = 3 * b + 1 {a > 10}
Define the term Overloading Unary Operators.
Formal Specification Predicate Logic By quantificationA quantifier is a mechanism for specifying an expression about a set of values. Thereare three quantifiers that we can use, each with its own symbol:–The universal quantifier ∀This quantifier enables a predicate to make a statement about all the elements ina particular set. For example, if M(x) is the predicate x chases mice, we could write:∀x Cats ● M(x)This reads For all the x which are members of the set Cats, x chases mice, or, moresimply, All cats chase mice.– The existential quantifier ∃In this case, a statement is made about whether or not at least one element of a setmeets a particular criterion. For example, if, as above, P(n) is the predicate n is aprime number, then we could write:∃n ● P(n)This reads There exists an n in the set of natural numbers such that n is a primenumber, or, put another way, There exists at least one prime number in the set ofnatural numbers.–The unique existential quantifier !This quantifier…
Give at least one example of injective, surjective and bijective
Suppose that: • variable X can represent any creature, • the predicate tove(X) is true if and only if X is a tove, • the predicate slithy(X) is true if and only if X is slithy, and • the function action(X) is a function that returns the kind of action that X is able to perform. Write a statement in predicate logic with the following meaning: "Any tove that can gyre or gimble must also be slithy." The following symbols are provided for you to copy if you wish (though not many of them are needed in this question, and you are not limited to using only the symbols that are listed here): 3 V A V ¬ A → € e ± Answer: