Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 6, Problem 57CRP
Explanation of Solution
Extended prolog program:
The prolog program to find the family relationship using the prolog rule is shown below:
%"carol" is a female
female(carol).
%"sue" is a female
female(sue).
%"bill" is a male
male(bill).
%"john" is a male
male(john).
%"john" is parent of "carol"
parent(john, carol).
%"sue" is parent of "carol"
parent(sue, carol).
%This rule for find the mother for given child
mother(X, Y) :- parent(X, Y), female(X).
%This rule for find the father for given child
father(X, Y) :- parent(X, Y), male(X).
%This rule for sibling
%It means that X is Y's sibling if X and Y have a common parent
sibling(X, Y) :- parent(Z, X), parent(Z, Y), X\=Y.
%Rule for find the relationship of uncle
uncle(U,N):- male(U),sibling(U,Z),parent(Z,N).
%Rule for find the relationship of aunt
aunt(X,N):- female(X),sibling(X,Z),parent(Z,N).
%Rule for find the relationship of grandParent
grandParent(G,N):- parent(G,P),parent(P,N).
%Rule for find the relationship of cousin
cousin(X1,X2) :-
parent(Y1,X1),
parent(Y2,X2),
sibling(Y1,Y2).
%Rule for find the parents of Z's.
parents(X, Y, Z):- parent(X, Z), parent(Y, Z).
Prolog Code Explanation:
The given program is used to find the family relationship using prolog rule.
- From the above code, first assign the two females “carol” and “sue” by using prolog rule “female(carol)” and “female(sue)” respectively.
- Then assign the two males “bill” and “john” by using prolog rule “male(bill)” and “male(john)” respectively.
- The rule “parent(john, carol)” implies “john” is parent of “carol”.
- The rule “parent(sue, carol)” implies “sue” is parent of “carol”...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
A database of Prolog facts for a group of people contains the following two types of facts:
male([, , ... ] ).
female ([, , ... ] ).
age( , )
E.g., male([alex, tom, vic, ...]).
E.g., female([ann, sara, ella, ..]).
E.g. age(ann, 66).
For these facts write the following rules (you may use Prolog library functions):
person(, ).
gender(, gender>).
oldest(, , ).
meanAgeM().
count(, , ).
Find the name and the age of a person
Find the name and the gender (male or female)
Find the name/age/gender of the oldest person
Find the mean age of male people
Find the number of male, female, and total people
Module 6 Journal. Please complete each of the proofs below. The proofs below may use any of the rules of inference or replacement rules given in Chapter 8. (D→C) • (C→ D), E → -(D → C) :. -E F • (G V H), -F V -H : F. G -U → ~B, S → ~B, ~(U • -S), TV B .:. T 3. (QR) V (-Q • -R), N → ~(Q ↔ R), EV N.. E -X → -Y, -Xv -Y, Z →Y: -Z -M V N, -R→-N : M → R
Write a recursive function in Prolog that can be used to determine whether a given number is a prime number or not (for example 7 is a prime number, but 6 isn't).
Chapter 6 Solutions
Computer Science: An Overview (12th Edition)
Ch. 6.1 - In what sense is a program in a third-generation...Ch. 6.1 - We can summarize the imperative programming...Ch. 6.1 - Prob. 4QECh. 6.2 - Why is the use of a constant considered better...Ch. 6.2 - Prob. 2QECh. 6.2 - Prob. 3QECh. 6.2 - Identity some common control structures found in...Ch. 6.2 - What is the difference between an array and an...Ch. 6.3 - Prob. 1QECh. 6.3 - Prob. 2QE
Ch. 6.3 - Why do many programming languages implement I/O...Ch. 6.3 - Prob. 4QECh. 6.3 - Prob. 5QECh. 6.4 - Prob. 1QECh. 6.4 - What is a symbol table?Ch. 6.4 - What is the difference between a terminal and a...Ch. 6.4 - Prob. 4QECh. 6.4 - Prob. 5QECh. 6.4 - Prob. 6QECh. 6.5 - What is the difference between an object and a...Ch. 6.5 - Prob. 2QECh. 6.5 - Suppose the classes PartTimeEmployee and...Ch. 6.5 - What is a constructor?Ch. 6.5 - Why are some items within a class designated as...Ch. 6.6 - Prob. 1QECh. 6.6 - Prob. 2QECh. 6.6 - Prob. 3QECh. 6.7 - Prob. 2QECh. 6.7 - Prob. 3QECh. 6.7 - Prob. 4QECh. 6 - Prob. 1CRPCh. 6 - Translate the following Python program into the...Ch. 6 - Prob. 3CRPCh. 6 - Why was it necessary to identify the type of data...Ch. 6 - Prob. 6CRPCh. 6 - Suppose the function f expects two numeric values...Ch. 6 - Suppose f is a function that returns the result of...Ch. 6 - Prob. 9CRPCh. 6 - Summarize the distinction between a machine...Ch. 6 - John Programmer argues that the ability to declare...Ch. 6 - Summarize the distinction between declarative...Ch. 6 - Explain the differences between a literal, a...Ch. 6 - a. What is operator precedence? b. Depending on...Ch. 6 - Prob. 16CRPCh. 6 - What is the difference between the meaning of the...Ch. 6 - Draw a flowchart representing the structure...Ch. 6 - Prob. 19CRPCh. 6 - Prob. 20CRPCh. 6 - Draw a flowchart representing the structure...Ch. 6 - Rewrite the following program segment using a...Ch. 6 - Summarize the following rats-nest routine with a...Ch. 6 - Prob. 24CRPCh. 6 - Prob. 25CRPCh. 6 - Suppose the variable X in a program was declared...Ch. 6 - Prob. 27CRPCh. 6 - Why would a large array probably not be passed to...Ch. 6 - Sometimes an actual parameter is passed to a...Ch. 6 - Prob. 32CRPCh. 6 - What ambiguity exists in the statement X = 3 + 2 ...Ch. 6 - Suppose a small company has five employees and is...Ch. 6 - Prob. 35CRPCh. 6 - Prob. 36CRPCh. 6 - Prob. 37CRPCh. 6 - Prob. 38CRPCh. 6 - Prob. 39CRPCh. 6 - Design a set of syntax diagrams that describes the...Ch. 6 - Prob. 41CRPCh. 6 - Prob. 42CRPCh. 6 - Add syntax diagrams to those in Question 5 of...Ch. 6 - Prob. 44CRPCh. 6 - What code optimization could be performed by a...Ch. 6 - Simplify the following program segment Y = 5 if (Y...Ch. 6 - Simplify the following program segment while (X !=...Ch. 6 - In an object-oriented programming environment, how...Ch. 6 - Describe how inheritance might be used to develop...Ch. 6 - What is the difference between the public and...Ch. 6 - a. Give an example of a situation in which an...Ch. 6 - Describe some objects that might be found in a...Ch. 6 - Prob. 53CRPCh. 6 - Prob. 54CRPCh. 6 - Prob. 55CRPCh. 6 - Prob. 56CRPCh. 6 - Prob. 57CRPCh. 6 - Prob. 58CRPCh. 6 - Prob. 59CRPCh. 6 - In general copyright laws support ownership rights...Ch. 6 - By using a high-level programming language, a...Ch. 6 - Prob. 3SICh. 6 - Prob. 4SICh. 6 - Prob. 5SICh. 6 - Suppose an amateur programmer writes a program for...Ch. 6 - Prob. 7SI
Knowledge Booster
Similar questions
- Define a Prolog predicate project/3 that selects elements from a list by their position and collects them in a result list. For example, the goal of project( [2,4],[a,b,c,d],L) should produce the answer L=[b,d]. You can assume that the numbers in the first list are strictly increasing, that is, your implementation does not have to care about situations like project([1,1,2],..) or project([2,5,3],.).arrow_forwardIn This Assignment, You Need To Solve The Following Problems Using Prolog 1. Design Rules To Find Out If A Value Is A Member Of A List. The Predicate Should Be In The Format: Mymember(value, List). For Example, Mymember(X, [1, 2, 3, 4]) Should Return X = 1. 2. Design Rules To Check If An Integer Is An Even Number Or Not. The Predicates ... This problem has been solved! See the answer Description:In this assignment, you need to solve the following problems using Prolog. 1. Design rules to find out if a value is a member of a list. The predicate should be in the format: mymember(value, list). For example, mymember(X, [1, 2, 3, 4]) should return X = 1.2. Design rules to check if an integer is an even number or not. The predicates should be in the format: myeven(a_number).3. Design rules to find out the number of even values in a list of integers. The predicates should be in the format: myevennumber(a_number, list). For example, myevennumber(X, [1, 2, 3, 4, 5, 6]) should return X = 3.4.…arrow_forwardDevelop a system/application in Prolog that will allow grader to: load a set of student’s grades (see samples from the Table C below) query student’s final letter grade (A, B, C, etc.) by a given student’s name. query student(s) whose grade matches to the input letter grade (e.g., A). For example, show student(s) whose final letter grade is A. There are 3 types of grades for each student—HWs, Exams, and Project, with a weight of 20%, 40% and 40%, respectively, to the 100-point final. Table A and B show how the final grades (in points and letter) are computed. Table C shows samples of students’ grades. You will define the execution instructions to answer the following questions so that grader can test out your application in Prolog: how to load your source code to Prolog runtime/compiler how to load students’ grades to Prolog runtime/compiler how to query student’s letter grade how to query student(s) whose letter grade matches to an input letter grade Please DO NOT hard code any…arrow_forward
- Write a single rule in the below Prolog program to have the answer shown in the result window. The comments are provided to give you a better understanding of the program. greater(a,b). /* a is greater than b */ greater(b,c). /* b is greater than c */ /* Need to write a single rule*/ ?- superGreater(a,c). /* is a greater than c? */ /* Result window*/ truearrow_forwardFor this assignment you need to implement 2 DFA’s using prolog. DFA needs to take any lowercase string and check if it contains your first name. The string can contain any number of characters before and after your name. As long as the string contains your first name it needs to be accepted.arrow_forwardQuestion 13 Write a function in Scheme or rules in Prolog called countlt that takes a list of numbers, L. and another number. N. and returns the count of numbers less than N in the list L. Example calls Scheme: (countlt '(6 1 9) 4) -> 1 (countlt '(50 27 13) 1) -> 0 Prolog ?- countlt (I6, 1, 91, 4, X) . X = 1. ?- countlt ( [50, 27, 131, 1, X). X = 0. Edit View Insert Format Tools Table 12pt v Paragraph v В I U ※ 总 !!arrow_forward
- The language composed of all strings over the alphabet {a,b} of the form: zero or more a's followed by zero or more b's, i.e., {"", a, b, aa, ab, bb, aaa, aab, abb, bbb, ...}, where "" is the empty string, is a regular language: show why this is. Note that you may use any line of argument on regular languages, e.g., by showing that it can be constructed using the properties ("Regular Language: a formal definition"), or by drawing the finite state automaton (FSA), or giving its description.arrow_forward2- Write a prolog program to take a nested list and return the number of elements in the list. For instance ?- elements ([b, [a, [d, c], e]], X). X = 5 Please also show tracing model for the above examplearrow_forwardI am trying to learn Prolog and am having a hard time getting this example to work. Could you show me how to write a function in Prolog to check if an element X is occurring N times in a list? For example 'occur(e, [e,e,a,t,f,t,e],3)' would be true, 'occur(a, [e,e,a,t,f,t,e],3)' would be false.arrow_forward
- 2For this assignment you need to implement 2 DFA’s using prolog. 1. First DFA needs to take a number and process it digit by digit and accept it if it is divisible by 7. To do this you will need 7 states (0,1,2,3,4,5,6) and your alphabet needs to be the 10 possible digits.arrow_forwardSuppose a Prolog database exists that gives information about the parts in an automobile engine. Predicates of big, small, and partof are included.a. Write a query to find all small items that are part of other items.b. Write a query to find all big items that have small subitems.c. Formulate a recursive rule to define componentof.arrow_forwardPlease ASAP, it's important Design a CFG which recognizes the language L={ w | all the letters on the first half of w are the same, and the second half is a substring where no consecutive letters are the same } over the alphabet Σ={0,1,2}. Explain your derivation rules. Note: consecutive means two letters which follow each other, " no consecutive letters are the same" means you can't repeat letters, so you can't have "00", "11" or "22" on the second half.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