GENETICA The problem-solving approach proposed here, largely based on the previous remarks, is implemented through the computer language GENETICA. GENETICA.

Slides:



Advertisements
Similar presentations
GENETICA’S BASIC SYNTACTIC AND SEMANTIC PROPERTIES In order to answer these questions we should start from GENETICA's syntax and semantics.
Advertisements

DEVELOPING LANGUAGES IN GENETICA A general and effective approach to domain-specific problem-solving is to use a high-level language specialized on the.
Problem Solving and Search in AI Part I Search and Intelligence Search is one of the most powerful approaches to problem solving in AI Search is a universal.
THE COMPUTATIONAL SYSTEM The evolutionary computational system, which will be presented now, performs calls to the root formula, creates genotypes for.
1 Project Ideas in Computer Science Keld Helsgaun.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
02/03/07DePaul University, HON2071 Evolutionary Computation Module for HON207.
Temporal Specification Chris Patel Vinay Viswanathan.
Constraint Logic Programming Ryan Kinworthy. Overview Introduction Logic Programming LP as a constraint programming language Constraint Logic Programming.
Estimation of Distribution Algorithms Let’s review what have done in EC so far: We have studied EP and found that each individual searched via Gaussian.
Search Heuristic Search vs. Evolutionary Search Prepared by Kirque Leung 18 Mar 05.
Uninformed Search Reading: Chapter 3 by today, Chapter by Wednesday, 9/12 Homework #2 will be given out on Wednesday DID YOU TURN IN YOUR SURVEY?
Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Logical Agents Chapter 7 Feb 26, Knowledge and Reasoning Knowledge of action outcome enables problem solving –a reflex agent can only find way from.
Genetic Art. Network Record Using Network Information Chicago Evanston ParisMoscow.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
CS 447 Advanced Topics in Artificial Intelligence Fall 2002.
Genetic Programming. Agenda What is Genetic Programming? Background/History. Why Genetic Programming? How Genetic Principles are Applied. Examples of.
Data Evolution in General Formal Problem Statement A General Approach to Evolutionary Problem Solving, Implemented in the Computer Language GENETICA.
Genetic Programming.
Slides are based on Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming n Evolution.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Katanosh Morovat.   This concept is a formal approach for identifying the rules that encapsulate the structure, constraint, and control of the operation.
Genetic Programming on Program Traces as an Inference Engine for Probabilistic Languages Vita Batishcheva, Alexey Potapov
Genetic Algorithm.
ENGLISH LANGUAGE ARTS AND READING K-5 Curriculum Overview.
Lecture 1 What is Modeling? What is Modeling? Creating a simplified version of reality Working with this version to understand or control some.
1 Paper Review for ENGG6140 Memetic Algorithms By: Jin Zeng Shaun Wang School of Engineering University of Guelph Mar. 18, 2002.
© Negnevitsky, Pearson Education, Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Evolution strategies Evolution.
Graphics and Procedures Programming Right from the Start with Visual Basic.NET 1/e 5.
Study on Genetic Network Programming (GNP) with Learning and Evolution Hirasawa laboratory, Artificial Intelligence section Information architecture field.
CS 484 – Artificial Intelligence1 Announcements Lab 3 due Tuesday, November 6 Homework 6 due Tuesday, November 6 Lab 4 due Thursday, November 8 Current.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Genetic Algorithms Michael J. Watts
Cognitive Psychology: Thinking, Intelligence, and Language
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
110/19/2015CS360 AI & Robotics AI Application Areas  Neural Networks and Genetic Algorithms  These model the structure of neurons in the brain  Humans.
Modeling and simulation of systems Model building Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Problem Solving Techniques. Compiler n Is a computer program whose purpose is to take a description of a desired program coded in a programming language.
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
1 Introduction to Software Engineering Lecture 1.
Definition of Terms Software/Programs Programs that directs the operation of a computer system Set of instructions Codes Programming Process of planning,
Programming Language 1. Programming language A programming language is a machine-readable artificial language designed to express computations that can.
Strongly Formed Genetic Programming 06/19/2013. Agenda Strongly formed genetic programming (SFGP) Where it fits Current progress Next steps.
Learning from Positive and Unlabeled Examples Investigator: Bing Liu, Computer Science Prime Grant Support: National Science Foundation Problem Statement.
Lecture 2: 11/4/1435 Problem Solving Agents Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Machine Learning A Quick look Sources: Artificial Intelligence – Russell & Norvig Artifical Intelligence - Luger By: Héctor Muñoz-Avila.
CONCLUSION The conclusion of this work is that it is possible to develop a problem-solving method providing evolutionary computational support to general.
Computer Science CPSC 322 Lecture 22 Logical Consequences, Proof Procedures (Ch 5.2.2)
8.4 Use Scientific Notation Algebra. Scientific Notation Numbers such as 1,000,000, 153,000 and are written in standard form. Another way to write.
RULES Patty Nordstrom Hien Nguyen. "Cognitive Skills are Realized by Production Rules"
Evolving RBF Networks via GP for Estimating Fitness Values using Surrogate Models Ahmed Kattan Edgar Galvan.
Chapter 11 Introduction to Computational Complexity Copyright © 2011 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1.
Some Thoughts to Consider 5 Take a look at some of the sophisticated toys being offered in stores, in catalogs, or in Sunday newspaper ads. Which ones.
ACCOUNTING THEORY AND STANDARDS
MDD-Kurs / MDA Cortex Brainware Consulting & Training GmbH Copyright © 2007 Cortex Brainware GmbH Bild 1Ver.: 1.0 How does intelligent functionality implemented.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithm(GA)
Paper Review for ENGG6140 Memetic Algorithms
Selected Topics in CI I Genetic Programming Dr. Widodo Budiharto 2014.
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
Object-Oriented Software Engineering Using UML, Patterns, and Java,
Evolution strategies and genetic programming
Introduction to Genetic Algorithm (GA)
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult.
Engineering design is the process of devising a system, component, or process to meet desired needs. It is a decision-making process in which the basic.
EE368 Soft Computing Genetic Algorithms.
Chapter 2: Analysis and Verification of Non-Real-Time Systems
Presentation transcript:

GENETICA The problem-solving approach proposed here, largely based on the previous remarks, is implemented through the computer language GENETICA. GENETICA is integrated in a programming environment that includes an evolutionary computational system.

The respective data-generation scenarios are evaluated with respect to either confirmation or optimization goals formulated in the program. Evaluation provides fitness values which are assigned to the genotypes. These decisions depend on genes both created and structured by the computational system at run-time. GenesElementary decisions Genotypes Data Generation Scenarios Fitness New Genotypes New Data Generation Scenarios Fitness Structuring Genetic Operations Substitution Population Comparison Solution Given a GENETICA program, different executions lead to different data-generation scenarios. Differences are caused by the non deterministic elementary decisions occurring during the execution. Each gene-structure constitutes genotype of a data-generation scenario. Different program executions result in a population of genotypes. The computational system evolves the population by performing genetic operations on high fitness genotypes, … … realizing the data-generation scenarios defined by the resulting genotypes, … … estimating their fitness, …… and substituting low-fitness genotypes in the population. The best fitness genotype after the evolution procedure, defines the data-generation scenario that produces the solution. The solution is a data structure constructed by a specific formula within the program.

GENETICA includes predicate logic, while provides high-order modes of expression by allowing formulas to be treated as terms. Atomic terms are integers, reals and symbols, while non atomic terms are lists. All the modes of expression practically used in computer languages are either included or can be constructed in GENETICA, while practically all kinds of data structures can be represented as nested lists. BENEFITS OF GENETICA-BASED PROBLEM SOLVING Expressiveness in problem representation Creativity Combined confirmation & optimization goals Development of domain-specific languages and implementation of Genetic Programming Considering the main features of evolutionary methods, the proposed approach could offer the following benefits: The problem formulation is supported by the expressive power of formal logic. As a consequence, formally expressed knowledge can be incorporated in the problem formulation allowing an accurate, arbitrarily sophisticated problem statement and search space organization. Involvement of formal logic does not limit creativity: existing knowledge, specifying the domain of evolving entities, can be formulated in terms of formal logic, while novel features of these entities emerge by evolution. The problem-solving method can cope with general confirmation problems, as well as problems combining both confirmation and optimization goals. An important aspect of the proposed approach is the possibility to consider evolving data structures as computer programs written in languages developed in GENETICA. This makes possible to develop GP methods where problem specific knowledge could be fully incorporated in the problem representation.

GenesElementary decisions Genotypes Data Generation Scenarios Fitness New Genotypes New Data Generation Scenarios Fitness Structuring Genetic Operations Substitution Population Comparison Solution Note that in the flowchart presented before …

GenesElementary decisions Genotypes Data Generation Scenarios Fitness New Genotypes New Data Generation Scenarios Fitness Genetic Operations Substitution Population Solution Structuring Comparison … some procedures (marked in blue) are typical in any kind of computer-aided problem-solving, …

GenesElementary decisions Data Generation Scenarios Fitness New Genotypes New Data Generation Scenarios Fitness Genetic Operations Substitution Population Solution Structuring Comparison Genotypes … while others (marked in green) are typical in evolutionary methods.In order to implement the proposed approach, the following questions should be answered:

GenesElementary decisions Genotypes Data Generation Scenarios Fitness New Data Generation Scenarios Fitness Genetic Operations Substitution Population Solution Structuring Comparison New Genotypes how elementary decisions can be determined by genes, …

GenesElementary decisions Genotypes Data Generation Scenarios Fitness New Data Generation Scenarios Fitness Genetic Operations Substitution Population Solution Structuring Comparison New Genotypes how these genes can be structured in genotypes determining data- generation scenarios, …

GenesElementary decisions Genotypes Data Generation Scenarios Fitness New Data Generation Scenarios Fitness Genetic Operations Substitution Population Solution Structuring Comparison New Genotypes what kind of genetic operations can be applied on these genotypes, …

GenesElementary decisions Genotypes Data Generation Scenarios Fitness New Data Generation Scenarios Fitness Genetic Operations Substitution Population Solution Structuring Comparison New Genotypes … and how fitness can be estimated on data-generation scenarios, especially with respect to confirmation goals.

Continued in Section_3.PPS