Nonmonotonic Abductive – Inductive Learning Oliver Ray Department of Computer Science University of Bristol AIAI'07, September 15th, 2007 Aix-en-Provence.

Slides:



Advertisements
Similar presentations
Explanation-Based Learning (borrowed from mooney et al)
Advertisements

Bayesian Abductive Logic Programs Sindhu Raghavan Raymond J. Mooney The University of Texas at Austin 1.
Ontologies Reasoning Components Agents Simulations Reasoning about actions, change, events and time Jacques Robin.
The Logic of Intelligence Pei Wang Department of Computer and Information Sciences Temple University.
1 Inductive Equivalence of Logic Programs Chiaki Sakama Wakayama University Katsumi Inoue National Institute of Informatics ILP
Rigorous Software Development CSCI-GA Instructor: Thomas Wies Spring 2012 Lecture 11.
Knowledge Representation and Reasoning (KR): A vibrant subfield of AI Jia You.
Reasoning about Actions and Causality Θεωρίες Δράσης και Αιτιότητας Θοδωρής Πάτκος Αναπαράσταση και Επεξεργασία Γνώσης ΗΥ
Knowledge Representation and Reasoning Learning Sets of Rules and Analytical Learning Harris Georgiou – 4.
Logic programming  Combining declarative and procedural representations: Emergencies on the London Underground  Logic programming for proactive rather.
Genetic Regulatory Mechanisms
OUTLINE 3 III.Control of Gene Expression in Prokaryotes A. Regulatory proteins B. The operon model C. Examples 1. the lac operon (substrate induction)
CPSC 322 Introduction to Artificial Intelligence September 15, 2004.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
A Probabilistic Framework for Information Integration and Retrieval on the Semantic Web by Livia Predoiu, Heiner Stuckenschmidt Institute of Computer Science,
Problem Solving What is AI way of solving problem?
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.5 [P]: Propositions and Inference Sections.
Relational Data Mining in Finance Haonan Zhang CFWin /04/2003.
Scientific Thinking - 1 A. It is not what the man of science believes that distinguishes him, but how and why he believes it. B. A hypothesis is scientific.
Introduction to Social Science Research
Welcome!.
Inductive Logic Programming Includes slides by Luis Tari CS7741L16ILP.
2007/9/15AIAI '07 (Aix-en-Provence, France)1 Reconsideration of Circumscriptive Induction with Pointwise Circumscription Koji Iwanuma 1 Katsumi Inoue 2.
Using Abduction and Induction for Operational Requirements Elaboration Dalal Alrajeh Oliver Ray Alessandra RussoSebastian Uchitel AIAI 2007 Sept. 15 th.
Chapter 6: Objections to the Physical Symbol System Hypothesis.
Symbolic Systems Biology: a Roadmap (or, lessons from ISSSB’11) Oliver Ray 1 Marcus Tindall 2 1 University of Bristol, UK 2 University of Reading, UK LDSSB’12,
Ontologies Reasoning Components Agents Simulations Belief Update, Planning and the Fluent Calculus Jacques Robin.
Functional Genomic Hypothesis Generation and Experimentation by a Robot Scientist King et al, Nature : Presented by Monica C. Sleumer February.
1 Abduction and Induction in Scientific Knowledge Development Peter Flach, Antonis Kakas & Oliver Ray AIAI Workshop 2006 ECAI August, 2006.
Kansas State University Department of Computing and Information Sciences CIS 830: Advanced Topics in Artificial Intelligence Wednesday, February 7, 2001.
Combining Inductive Logic Programming, Active Learning and Robotics to Discover the Function of Genes by C.H. Bryant, S.H. Muggleton, S.G. Oliver, D.B.
Chapter 2: The Scientific Method and Environmental Sciences.
Issues for research design Questions to think about as you begin your research (adapted from Hart 1998, page 86)
1 Nonmonotonic Inductive Logic Programming Chiaki Sakama Wakayama University, Japan Invited Talk at LPNMR 2001.
Modelling Adaptive Controllers with Evolving Logic Programs Pierangelo Dell’Acqua Anna Lombardi Dept. of Science and Technology - ITN Linköping University,
Computing & Information Sciences Kansas State University Wednesday, 20 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 12 of 42 Wednesday, 20 September.
Chapter 1 The Science of Biology. Section 1 – What is Science? The goal of science is to investigate and understand nature, to explain events in nature,
Introduction to Chemistry. What is Chemistry? Chemistry is the study of matter and its changes Matter is anything that has mass and occupies space Because.
Learning Metabolic Network Inhibition using Abductive Stochastic Logic Programming Jianzhong Chen, Stephen Muggleton, José Santos Imperial College, London.
Working Group 4 Creative Systems for Knowledge Management in Life Sciences.
Machine Learning Chapter 5. Artificial IntelligenceChapter 52 Learning 1. Rote learning rote( โรท ) n. วิถีทาง, ทางเดิน, วิธีการตามปกติ, (by rote จากความทรงจำ.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 13 of 41 Monday, 20 September.
How Does A Cell Know? Which Gene To Express Which Gene To Express& Which Gene Should Stay Silent? Which Gene Should Stay Silent?
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Kansas State University Department of Computing and Information Sciences CIS 732: Machine Learning and Pattern Recognition Thursday, November 29, 2001.
Introduction to Science.  Science: a system of knowledge based on facts or principles  Science is observing, studying, and experimenting to find the.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Chapter 1 –Defining AI Next Tuesday –Intelligent Agents –AIMA, Chapter 2 –HW: Problem.
Chapter 1.1 – What is Science?. State and explain the goals of science. Describe the steps used in the scientific method. Daily Objectives.
Inverse Entailment in Nonmonotonic Logic Programs Chiaki Sakama Wakayama University, Japan.
1-1 What is Science? Objectives: State the goals of science Describe the steps of the scientific method.
DEDUCTION PRINCIPLES AND STRATEGIES FOR SEMANTIC WEB Chain resolution and its fuzzyfication Dr. Hashim Habiballa University of Ostrava.
1 Reasoning with Infinite stable models Piero A. Bonatti presented by Axel Polleres (IJCAI 2001,
Chapter 1: Section 1 What is Science?. What Science IS and IS NOT.. The goal of Science is to investigate and understand the natural world, to explain.
1 Guess the Covered Word Goal 1 EOC Review 2 Scientific Method A process that guides the search for answers to a question.
Artificial Intelligence 2004 Planning: Situation Calculus Review STRIPS POP Hierarchical Planning Situation Calculus (John McCarthy) situations.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View Basic Concepts and Background.
Copyright © 2008 Pearson Education Inc., publishing as Pearson Benjamin Cummings 18.1: The trp operon.
Disjunctive Bottom Set and Their Computation Dr Wenjin Lu & Dr Ross King Department of Computer Science, The University of Wales, Aberystwyth
On Abductive Equivalence Katsumi Inoue National Institute of Informatics Chiaki Sakama Wakayama University MBR
Inference of Gene Relations from Microarray Data by Abduction Irene Papatheodorou & Marek Sergot Imperial College, London UK.
SCIENTIFIC METHOD NATURE OF SCIENCE AND EXPERIMENTAL DESIGN VANCE
Control of Gene Expression
Programming Languages and Compilers (CS 421)
Science of Biology
George Baryannis and Dimitris Plexousakis
Chapter 1 The Science of Biology.
This Lecture Substitution model
Transcriptional Regulation in Prokaryotes.
Programming Languages and Compilers (CS 421)
Generalized Diagnostics with the Non-Axiomatic Reasoning System (NARS)
Presentation transcript:

Nonmonotonic Abductive – Inductive Learning Oliver Ray Department of Computer Science University of Bristol AIAI'07, September 15th, 2007 Aix-en-Provence

Nonmonotonic Abductive – Inductive Learning Oliver Ray Department of Computer Science University of Bristol AIAI'07, September 15th, 2007 Aix-en-Provence (for temporal process modelling in bioinformatics and AI)

Motivation: Learning Temporal Theories Machine Learning: automated methods needed to handle the volume and complexity of data generated by modern experimental and data logging techniques. Inductive Logic Programming: produces expressive human-understandable hypotheses, exploits prior domain knowledge, and facilitates incremental knowledge update. Abductive–Inductive Learning: combines explanation and generalisation, allows for non-observation predicate learning, supports non-monotonic inference. Non-monotonic Learning of Temporal Theories: Infer temporal models of systems or processes from (partial) domain knowledge and (partial) observations.

Problem: Induction of Process Models Given: temporal logic calculus partial process model scenarios/narratives Find: (more) complete model that extends the partial model and explains the given narratives and scenarios wrt. the temporal calculus

Given: temporal logic calculus…event calculus partial process model…events, fluents, time scenarios/narratives…happens, holds, initially Find: (more) complete model …initiates, terminates Problem: Induction of Process Models that extends the partial model and explains the given narratives and scenarios wrt. the temporal calculus

Given: temporal logic calculus…event calculus partial process model…events, fluents, time scenarios/narratives…happens, holds, initially Find: (more) complete model …initiates, terminates B E H NM ILP Problem: Induction of Process Models that extends the partial model and explains the given narratives and scenarios wrt. the temporal calculus

Example: E. coli Lactose Metabolism E. coli growth medium add_lactose sub_glucose add_glucose sub_lactose ACTIONS (Events) pres_lactose pres_glucose meta_lactose EFFECTS (Fluents)..…TIME..… (Integers)

Transcriptional Regulation of LAC Operon polymeraseactivator cAMP repressor PromOplac(z)lac(y) CAP allolactose PromOplac(z)lac(y)CAP galactosidasepermease (a) Lactose metabolising genes not expressed (b) Lactose metabolising genes expressed (low glucose) (high lactose)

Event Calculus Axioms holdsAt(F,T2)  happens(E,T1), T1<T2, initiates(E,F,T1), not clipped(T1,F,T2). holdsAt(F,T2)  initially(F), not clipped(0,F,T2). clipped(T1,F,T2)  happens(E,T), T1<T, T<T2, terminates(E,F,T).

Partial LAC Process Model % ontology time(0..9). event(add_gluc). event(add_lact). event(sub_gluc). event(sub_lact). fluent(pres_lact). fluent(pres_gluc). fluent(meta_lact). % behaviour initiates(add_gluc, pres_gluc, T). initiates(add_lact, pres_lact, T). terminates(sub_gluc, pres_gluc, T). terminates(sub_lact, pres_lact, T).

LAC Scenario / Narrative % actions initially(pres(gluc)). happens(add(lact),1). happens(sub(gluc),2). happens(sub(lact),3). happens(add(lact),4). happens(add(gluc),5). happens(sub(lact),6). happens(sub(gluc),7). % observations not holdsAt(meta(lact),1), not holdsAt(meta(lact),2), holdsAt(meta(lact),3), not holdsAt(meta(lact),4), holdsAt(meta(lact),5), not holdsAt(meta(lact),6), not holdsAt(meta(lact),7), not holdsAt(meta(lact),8). n.b. in general, could have partial knowledge of actions and/or observations, many actions per timepoint, etc.,

Language and Search Bias % domain specific mode declarations modeh(2, initiates(#event,#fluent,+time) ). modeh(2, terminates(#event,#fluent,+time) ). modeb(3, holdsAt(#fluent,+time) ). modeb(3, not holdsAt(#fluent,+time) ). % built-in preference criterion: Occam’s Razer % (greedily )prefer the simplest (i.e., smallest ) % hypothesis that correctly explains the data n.b. in general, need ways to constrain the search space both syntactically and semantically

Abductive–Inductive Learning Abduction 1 Deduction 2  = a1 :ana1 :an K= a 1  d 1 d 2 … d m 1 : a n  d 1 d 2 … d m n Given: B,E,M Return: H n n n Induction 3 H= A 1  D 1 D 2 … D m 1 : A n  D 1 D 2 … D m n n n n head atoms of K are abductive explanation of the examples E : i.e., B  |= e. body atoms of K are deductive consequences of the theory B: i.e., B |= d i. H is a compressive theory subsuming the theory K : i.e., H  K. IDEA: construct and generalise an initial ground hypothesis K called a Kernel Set

Abductive Phase

Deductive Phase

Inductive Phase

DEMO CLICK ME!

Related Work Sakama Baral Otero & Lorenzo Muggleton & Moyle Inoue, Iwanuma & Nabeshima

Conclusion XHAIL provides a (stable model) semantics and proof procedure for NM-ILP It uses mode declarations in the construction of a Kernel Set to reduce generalisation search space It is well suited to learning temporal theories in the Event Calculus (which provides a more intuitive event-based formalism than pure first order logic) But, still need to investigate stability, noise, confidence, …

END