You have been charged to develop a computational family tree for the g.pdf

•

0 likes•2 views

You have been charged to develop a computational family tree for the goddesses and godsand in Greek mythology.The figure shows the family relations of 20 individuals. 1.Gaeaand Uranuswere the two primordialdeities (i.e., they are the only two who do nothave any parents). Uranus and Gaea hadt hree off-springs: Cronus, Dione, and Rhea. 2.Rheaand Cronushad six off-springs: Hestia, Demeter, Hera, Hades, Poseidon, and Zeus. 3.Heraand Zeuswere the parents of three children:Ares,Hebe, and Ilithyia. 4.Demeterand Zeushad onechild together:Persephone. 5. Dioneand Zeushad one off-spring, Aphrodite. 6. Aphroditeand Areshad one off-spring Harmonia. 7. Kadmosand Harmoniahad one off-spring, Semele. 8. Semeleand Zeushad one off-spring: Dionysus. Task 1: Create a model of this family in Prolog. Start with facts (i.e., ground axioms) about the family. For the ground axioms choose a consistent scheme of binary predicates.Develop the facts such that there are no redundancies in the facts. Deliver a completecopy of your facts in correct Prolog syntax. Task 2: Analyze the properties and potential dependencies of the following family relations: Parent Child Silbling Grandparent Grandchild greatgrandchild Task 3: Add rules (i.e., logical axioms) for the six family relations(Task 2),using only first-order predicate calculus notation. The rules should be able to determine the relations (as defined by you, but consistent with your cultural norm) for the following concepts). If you use done as your base predicates, then you do not need a rule for that. Define these rules as concisely as possible. It will help if you consult the properties and dependencies of these family relations(Task 3). You do not need to use the setoff predicate to eliminate duplicates in query results. Task 4: Add a discussion of up to one page (double spaced) that addresses why you chose your scheme for the ground axioms. Elaborate what could have been at least one alternative to your chosen design. Provide arguments for why you did not choose that alternative.

base predicates, then you do not need a rule for that. Define these rules as concisely as possible.
It will help if you consult the properties and dependencies of these family relations(Task 3). You
do not need to use the setoff predicate to eliminate duplicates in query results.
Task 4:
Add a discussion of up to one page (double spaced) that addresses why you chose your scheme
for the ground axioms. Elaborate what could have been at least one alternative to your chosen
design. Provide arguments for why you did not choose that alternative

PLEASE USE TuProlog for this. Also the facts need to be Binary Facts. No screenshot please. You have been charged to develop a computational family tree for the goddesses and gods and in Greek mythology. The figure shows the family relations of 20 individuals. 1. Gaea and Uranus were the two primordial deities (i.e., they are the only two who do not have any parents). Uranus and Gaea had three off-springs: Cronus, Dione, and Rhea. 2. Rhea and Cronus had six off-springs: Hestia, Demeter, Hera, Hades, Poseidon, and Zeus. 3. Hera and Zeus were the parents of three children: Ares, Hebe, and Ilithyia. 4. Demeter and Zeus had one child together: Persephone. 5. Dione and Zeus had one off-spring, Aphrodite. 6. Aphrodite and Ares had one off-spring Harmonia. 7. Kadmos and Harmonia had one off- spring, Semele. 8. Semele and Zeus had one off-spring: Dionysus. Task 1: Create a model of this family in Prolog. Start with facts (i.e., ground axioms) about the family. For the ground axioms choose a consistent scheme of BINARY predicates. Develop the facts such that there are no redundancies in the facts. Deliver a complete copy of your facts in correct Prolog syntax. Task 2: Analyze the properties and potential dependencies of the following family relations: parent, child, silbling grandparent grandchild greatgrandchild Task 3: Add rules (i.e., logical axioms) for the six family relations (Task 2), using only first- order predicate calculus notation. The rules should be able to determine the relations (as defined by you, but consistent with your cultural norm) for the following concepts). If you used one as your base predicates, then you do not need a rule for that. Define these rules as concisely as possible. It will help if you consult the properties and dependencies of these family relations (Task 3). You do not need to use the setoff predicate to eliminate duplicates in query results. For all rules that you write, use only basic Prolog statements as introduced in class (i.e., only Horn clauses, with each rule having a single consequent predicate and all antecedent predicates linked by commas representing conjunctions). Do not use any other syntax, even if Prolog parses and processes it. Deliver a complete copy of your rules in correct Prolog syntax. Show one query per relationship, and the results of those queries when executed in Prolog. Task 4: Add a discussion of up to one page (double spaced) that addresses why you chose your scheme for the ground axioms. Elaborate what could have been at least one alternative to your chosen design. Provide arguments for why you did not choose that alternative. *PLEASE TAKE A LOOK AT THE IMAGE AND THE COMMENT(In blue ink) AND PROVIDE THE RIGHT ANSWERS TO THE QUESTIONS ACCORDING TO THE COMMENTS IN the blue ink. binary_fact(pr_deity, gaea, uranus). binary_fact(pr_deity, uranus, gaea). \% Chirdren of Uranus and Gaea binary_fact(parent, uranus, cronos) binary_fact(parent, uranus, dione). binary_fact(parent, uranus, rhea).

HI ! please the assignment is asking for BINARY predicates. Whoeve.pdf

almonardfans

HI ! please the assignment is asking for BINARY predicates. Whoever did this in the attached picture. Please can you redo it using BINARY predicates? You have been charged to develop a computational family tree for the goddesses and gods and in Greek mythology. The figure shows the family relations of 20 individuals. 1. Gaea and Uranus were the two primordial deities (i.e., they are the only two who do not have any parents). Uranus and Gaea had three off-springs: Cronus, Dione, and Rhea. 2. Rhea and Cronus had six off-springs: Hestia, Demeter, Hera, Hades, Poseidon, and Zeus. 3. Hera and Zeus were the parents of three children: Ares, Hebe, and Ilithyia. 4. Demeter and Zeus had one child together: Persephone. 5. Dione and Zeus had one off-spring, Aphrodite. 6. Aphrodite and Ares had one off-spring Harmonia. 7. Kadmos and Harmonia had one off- spring, Semele. 8. Semele and Zeus had one off-spring: Dionysus. Task 1: Create a model of this family in Prolog. Start with facts (i.e., ground axioms) about the family. For the ground axioms choose a consistent scheme of BINARY predicates. Develop the facts such that there are no redundancies in the facts. Deliver a complete copy of your facts in correct Prolog syntax. Task 2: Analyze the properties and potential dependencies of the following family relations: parent, child, silbling grandparent grandchild greatgrandchild Task 3: Add rules (i.e., logical axioms) for the six family relations (Task 2), using only first- order predicate calculus notation. The rules should be able to determine the relations (as defined by you, but consistent with your cultural norm) for the following concepts). If you used one as your base predicates, then you do not need a rule for that. Define these rules as concisely as possible. It will help if you consult the properties and dependencies of these family relations (Task 3). You do not need to use the setoff predicate to eliminate duplicates in query results. For all rules that you write, use only basic Prolog statements as introduced in class (i.e., only Horn clauses, with each rule having a single consequent predicate and all antecedent predicates linked by commas representing conjunctions). Do not use any other syntax, even if Prolog parses and processes it. Deliver a complete copy of your rules in correct Prolog syntax. Show one query per relationship, and the results of those queries when executed in Prolog. Task 4: Add a discussion of up to one page (double spaced) that addresses why you chose your scheme for the ground axioms. Elaborate what could have been at least one alternative to your chosen design. Provide arguments for why you did not choose that alternative. binary_fact(pr_deity, gaea, uranus). binary_fact(pr_deity, uranus, gaea). \% Chirdren of Uranus and Gaea binary_fact(parent, uranus, cronos) binary_fact(parent, uranus, dione). binary_fact(parent, uranus, rhea). binary_fact(parent, gaea, cronos). binary_fact(parent, gaea, dione). binary_fact(parent, gae.

PLEASE USE TuProlog for this Also the facts need to be Bi.pdf

aggarwalopticalsco

You have been charged to develop a computational family tree for the.pdf

amie1085

Concept Visualisation over Multiple Taxonomic Hierarchies

martinjgraham

Two Types of Data for Constructing Trees There are two major different.docx

jobesshirley

Two Types of Data for Constructing Trees There are two major different types of data that can be used to construct phylogenetic trees. One type of data is morphological character data. Using this approach, trees are constructed based on the similarities in morphology that organisms share with each other. For instance, conceptually you would group humans and chimps together because they share many morphological features, and then you would place gorillas outside of this group, because gorillas share fewer features than humans and chimps. Another major type of data is DNA sequence data. A. Morphological Character-Based Parsimony Trees Create a matrix of characters, listing characters possessed by each organism (where 0 = ab se n t and 1 = present for each character). We can then identify organisms with similar characters and build a tree using the data presented in the matrix. Definitions: Chordate = has a spinal column with nerves Tetrapods = has four legs Amniotes = has an additional sac around the Diapsid condition with Synapsid condition with embryo (Amniotic Egg) Single Jaw Bone = mammals have one continuous jaw bone, but many other chordates have multiple bones in Modified from Kardong, 1998 their jaws (like 5 or 6 ). Diapsids = have two holes on the side of their head (see figure above). Humans, and many other chordates, have only one hole in the side of our head (you can feel it on your temple when you chew): 6) Look at the Character \#8 (warm blooded). Redraw your tree exactly as you drew it above, but add character #8 to the tree. Is there more than one possibility with how character \#8 is mapped on the tree? What explanation do you have for this evolutionary pattern? Remember that constructing trees is an inference process, so there may be several explanations for the observed evolutionary pattern. (hint: think of loss and/or gain of characters mapped on the tree) (10 pts.) 1) Build a tree using characters 1 through 7 , but don't use Character \#8 (warm blooded) just yet. Map characters 1-7 on your tree (similar to Fig 4.15 in textbook). (hint: identify characters that organisms share. Shared characters allow you to group taxa into nested sets. See section 4.3 in textbook) (10 pts.) .

45 genetic-algorithms

grskrishna

This document provides an overview of genetic algorithms, which are optimization algorithms inspired by biological evolution. It describes how genetic algorithms use processes like mutation, crossover, selection, and reproduction to "evolve" solutions to problems over multiple generations. Key points covered include representing solutions as genotypes/phenotypes, using fitness functions to evaluate solutions, and techniques like asexual vs sexual reproduction, directed evolution, and genetic programming. The document notes that while genetic algorithms can solve some problems that traditional methods cannot, they are generally very slow optimization methods.

Deductive databases

Dabbal Singh Mahara

The document discusses deductive databases and how they differ from conventional databases. Deductive databases contain facts and rules that allow implicit facts to be deduced from the stored information. This reduces the amount of storage needed compared to explicitly storing all facts. Deductive databases use logic programming through languages like Datalog to specify rules that define virtual relations. The rules allow new facts to be inferred through an inference engine even if they are not explicitly represented.

You are to create a concept map of the urinary system on a separate document. Below is a list of terms that MUST be incorporated into your assignment. However, other words can and SHOULD be added. Terms from the list below (and two connections to another body system(s)) must be identified/highlighted in some way on your concept map. You will need to write in words on the connecting lines, the relationship between the two concepts that you linked together. include these terms: Polycystic Kidney Disease (PKD) Peristalsis Sphincter selective reabsorption Aquaporins Renal Medulla Osmoregulation hemodialysis Hydrogen ions (H*) Rugae Pressure Filtration filtrate Peritubular Capillary Network Natriuresis Stretch Receptors Erythropoietin (EPO) Tubular Excretion Metabolic Wastes Atrial Natriuretic Hormone (ANH) Renal Artery Incontinence Pyelonephritis must include 2 connections to two other body connections All should be diagrammed as a MAP only!!! Example: Concept Maps: General Overview:.

You have isolated a strain of mutant yeast cells that divides normally.pdf

You have been charged to develop a computational family tree for the g.pdf

Recommended

Recommended

More Related Content

More from shivachandalia

More from shivachandalia (20)

Recently uploaded

Recently uploaded (20)

You have been charged to develop a computational family tree for the g.pdf