Ch. 15 Acquiring First-order Knowledge About Air Traffic Control Yves Kodratoff and Christel Vrain 발표자 : 권 용 식.

Slides:



Advertisements
Similar presentations
1 PHARE Operational Scenarios J-P. Nicolaon, Operational Task Force Chairman EUROCONTROL Experimental Centre.
Advertisements

Kees van Deemter Matthew Stone Formal Issues in Natural Language Generation Lecture 4 Shieber 1993; van Deemter 2002.
In need of a model for complexity assessment of highly automated human machine systems Fredrik Barchéus, Pernilla Ulfvengren, Johan Rignér.
Machine Learning: Lecture 9
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
Logic Use mathematical deduction to derive new knowledge.
The design process IACT 403 IACT 931 CSCI 324 Human Computer Interface Lecturer:Gene Awyzio Room:3.117 Phone:
Knowledge Representation and Reasoning Learning Sets of Rules and Analytical Learning Harris Georgiou – 4.
ArchE Presented By Samanvitha Ramayanam. TOPICS 1. Introduction 2. Theoretical assumptions 3. ArchE as an expert system 4. Overall flow of ArchE 5. Key.
The Semantic Web Week 17 Knowledge Engineering – Real Example: Accuracy of Ontologies Module Website: Practical this.
Lecture 04 Rule Representation
1 A Framework for Measurement Valérie Paulus, Miguel Lopez, Gregory Seront, Simon Alexandre.
Center for Evolutionary Computation and Automated Design Rich Terrile Symposium on Complex Systems Engineering Rand Corp. January 11, 2007 Rich Terrile.
AI – CS364 Hybrid Intelligent Systems Overview of Hybrid Intelligent Systems 07 th November 2005 Dr Bogdan L. Vrusias
Writing Instructional Objectives
Presenter: Miguel Garzon Torres CrUise Lab - SITE SQL Coverage Measurement for Testing Database Applications María José Suárez-Cabal University of Oviedo.
ANSWERING CONTROLLED NATURAL LANGUAGE QUERIES USING ANSWER SET PROGRAMMING Syeed Ibn Faiz.
Romaric GUILLERM Hamid DEMMOU LAAS-CNRS Nabil SADOU SUPELEC/IETR ESM'2009, October 26-28, 2009, Holiday Inn Leicester, Leicester, United Kingdom.
Background Data validation, a critical issue for the E.S.S.
CSCI2110 – Discrete Mathematics Tutorial 9 First Order Logic Wong Chung Hoi (Hollis)
The design process z Software engineering and the design process for interactive systems z Standards and guidelines as design rules z Usability engineering.
Romaric GUILLERM Hamid DEMMOU LAAS-CNRS Nabil SADOU SUPELEC/IETR.
Some Thoughts to Consider 6 What is the difference between Artificial Intelligence and Computer Science? What is the difference between Artificial Intelligence.
Robert Tairas, Marjan Mernik, Jeff Gray Using Ontologies in the Domain Analysis of Domain-Specific Languages Workshop on Transformation and Weaving Ontologies.
INTRODUCTION TO MACHINE LEARNING. $1,000,000 Machine Learning  Learn models from data  Three main types of learning :  Supervised learning  Unsupervised.
1 Automation Adoption and Adaptation in the Air Traffic Control, URET Case Study Tatjana Bolic.
Ming Fang 6/12/2009. Outlines  Classical logics  Introduction to DL  Syntax of DL  Semantics of DL  KR in DL  Reasoning in DL  Applications.
 Predicate: A sentence that contains a finite number of variables and becomes a statement when values are substituted for the variables. ◦ Domain: the.
HCI in Software Process Material from Authors of Human Computer Interaction Alan Dix, et al.
The V  I Relationship for a Resistor Let the current through the resistor be a sinusoidal given as Is also sinusoidal with amplitude amplitudeAnd.
1/26/2004TCSS545A Isabelle Bichindaritz1 Database Management Systems Design Methodology.
Value Set Resolution: Build generalizable data normalization pipeline using LexEVS infrastructure resources Explore UIMA framework for implementing semantic.
Logic CL4 Episode 16 0 The language of CL4 The rules of CL4 CL4 as a conservative extension of classical logic The soundness and completeness of CL4 The.
MINISTRY OF EDUCATION AND SCIENCE OF UKRAINE NATIONAL AVIATION UNIVERSITY Air Navigation System Department.
Objectives:1. Classes and Objects 2. Attributes 3. Services 4. Subjects Object-Oriented Analysis – Finding Class-&-Obects.
Multi-Relational Data Mining: An Introduction Joe Paulowskey.
September Bound Computation for Adaptive Systems V&V Giampiero Campa September 2008 West Virginia University.
Automatization of air traffic control sector capacity indicators determination process (Автоматизація процесу визначення показників пропускної спроможності.
Kansas Early Learning Standards and Cognitive Domain Chapter 11.
Behavior Control of Virtual Vehicle
CONCLUSION The conclusion of this work is that it is possible to develop a problem-solving method providing evolutionary computational support to general.
KNOWLEDGE BASED SYSTEMS
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
RE-ENGINEERING AND DOMAIN ANALYSIS BY- NISHANTH TIRUVAIPATI.
Guidance and Control Programs at Honeywell Sanjay Parthasarathy Honeywell Aerospace Advanced Technology October 11, 2006
Ch 9 – Properties and Attributes of Functions 9.4 – Operations with Functions.
Section 1.1 Propositions and Logical Operations. Introduction Remember that discrete is –the study of decision making in non-continuous systems. That.
DeSIRE Workshop, Pisa, 25-26/11/2002 1/7 A Case Study in Air Traffic Control Alberto Pasquini Deep Blue Srl.
Formal Methods: for All or for Chosen? Victor Kuliamin 1 Vitaliy Omelchenko 1 Olga Petrenko 2 1 Institute for System Programming 2 Institute of Open Education.
Terminal Airspace Traffic Complexity Fedja Netjasov University of Belgrade Faculty of Traffic and Transport Engineering Division of Airports and Air Traffic.
Metalogic Soundness and Completeness. Two Notions of Logical Consequence Validity: If the premises are true, then the conclusion must be true. Provability:
EUROCONTROL EXPERIMENTAL CENTRE1 / 29/06/2016  Raphaël CHRISTIEN  Network Capacity & Demand Management  5 th USA/Europe ATM 2003 R&D seminar  23 rd.
CPSC 121: Models of Computation REVIEW. Course Learning Outcomes You should be able to: – model important problems so that they are easier to discuss,
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
EXPERT SYSTEMS.
COmbining Probable TRAjectories — COPTRA
§ 3.2 The Chain Rule and the General Power Rule.
Introduction to Logic for Artificial Intelligence Lecture 2
Control Flow Testing Handouts
Propositional Logic Session 3
Test of a risk judgments model in Air Traffic Control
Outline of the Chapter Basic Idea Outline of Control Flow Testing
Logic Use mathematical deduction to derive new knowledge.
Logic Coverage for Source Code CS 4501 / 6501 Software Testing
Encoding Knowledge with First Order Predicate Logic
§ 3.2 The Chain Rule and the General Power Rule.
Scalable and Efficient Reasoning for Enforcing Role-Based Access Control
Ch 1-2 Order of Operations
Presentation transcript:

Ch. 15 Acquiring First-order Knowledge About Air Traffic Control Yves Kodratoff and Christel Vrain 발표자 : 권 용 식

Contents. Problem Domain Overall Learning Process Application of ATC

Air Traffic Control(ATC) avoid the crash of an aircraft –if collision is possible, modify the route of the planes AF2470(1) (2) BR1667(1) (2)

Representation of Knowledge and Generalization Trade-off –expressive power –computational complexity Generalization –By using background knowledge BK  x  y owns(x,y)  car(y)  driver(x,y)  x new_driver(x)  driving_license(x) driving_license(John)  owns(John, C1)  car(C1) new_driver(Bob)  owns(Bob,C2)  car(C2)  driving_license(X)  owns(X,C)  car(C)

Overall Learning Process determine the concepts to learn acquire background knowledge gather positive and negative examples generalize validate the knowledge Determination of the Concepts Rules: if G(x) then C(x) Positive and Negative Examples Background Knowledge Generalization Tool Validation Concept C(x)

Choose the Language Representation choosing the basic vocabulary choosing the formalism, propositional or predicate, attribute-value representation etc. –ex) (color_eyes, John, Brown) attribute(OBJECT,VALUE) –color_eyes(John, Brown) value(OBJECT, ATTRIBUTE) –brown(John, color_eyes) pred(OBJECT, ATTRIBUTE, VALUE) –physical_descr(John, color_eyes, Brown) attribute(OBJECT, C)  value(C) –color_eyes(John, C)  brown(C)

Determine the Concepts to Learn The aim of this application is to learn decision rules used by a human controller. Define some actions that can be performed on aircraft to avoid an impending accident –Do nothing: the action is performed on the other aircraft –Change of direction which is a temporary modification of the route –Change of route of the aircraft –... A solution of a conflict is a combination of these actions

Obtain the Examples and Rewriting Them Obtain the “Raw” Examples Rewrite (  (present_work_load PWL1)(steady PWL1) (destination AF2470 DESTINATION1)(west_european DESTINATION1) (destination AF2470 DESTINATION2)(far_away DESTINATION2) (solution AF2470 SOLUTION1)(change_direction SOLUTION1) (right SOLUTION1) (solution BR1667 SOLUTION2))

Rewrite BK as Horn Clauses IF a given plan has a steady trajectory when entering, exiting the sector and inside the sector, THEN it is on cruise  x  y  z  t[[traj_enter(x,y)  steady(y)  traj_in(x,z)  steady(z)  traj_exit(x,t)  steady(t)]  fl[flight(x,fl)  cruising(fl)]]  x  y  z  t[[traj_enter(x,y)  steady(y)  traj_in(x,z)  steady(z)  traj_exit(x,t)  steady(t)]  flight(x,f(x,y,z,t)]]  x  y  z  t  fl[[traj_enter(x,y)  steady(y)  traj_in(x,z)  steady(z)  traj_exit(x,t)  steady(t)  flight(x,fl)]  cruising(fl)]

Generalize and Rewrite G = (  (present_work_load vg3)(steady vg3)(destination vg1, vg21) (destination vg2 vg22)…(solution vg1 vg26)(change_direction vg26) (solution vg2 vg27) Foreseen work load - steady Estimation of the angle of the routes of the aircraft before conflict occurrence - sharp convergence Solution - vg1: change of direction...

Conclusion Transformation of the examples and the expert’s knowledge in first order, and transformation of learning back into a representation are not trivial. The success of the learning process often relies on a proper choice of the formalism Background knowledge is often incomplete, so validation of learning is important. There is still no full automation of ATC.