Completing causal networks by meta-level abduction

Meta-level abduction is a method to abduce missing rules in explaining observations. By representing rule structures of a problem in a form of causal networks, meta-level abduction infers missing links and unknown nodes from incomplete networks to complete paths for observations. We examine applicability of meta-level abduction on networks containing both positive and negative causal effects. Such networks appear in many domains including biology, in which inhibitory effects are important in several biological pathways. Reasoning in networks with inhibition involves nonmonotonic inference, which can be realized by making default assumptions in abduction. We show that meta-level abduction can consistently produce both positive and negative causal relations as well as invented nodes. Case studies of meta-level abduction are presented in p53 signaling networks, in which causal relations are abduced to suppress a tumor with a new protein and to stop DNA synthesis when damage has occurred. Effects of our method are also analyzed through experiments of completing networks randomly generated with both positive and negative links.

[1]  Stephen Muggleton,et al.  Theory Completion Using Inverse Entailment , 2000, ILP.

[2]  Katsumi Inoue,et al.  In defense of PDDL axioms , 2003, Artif. Intell..

[3]  Ron Shamir,et al.  Chain functions and scoring functions in genetic networks , 2003, ISMB.

[4]  Katsumi Inoue,et al.  Hypothesizing about Causal Networks with Positive and Negative Effects by Meta-level Abduction , 2010, ILP.

[5]  Stephen Muggleton,et al.  TopLog: ILP Using a Logic Program Declarative Bias , 2008, ICLP.

[6]  Stephen Muggleton,et al.  Machine Invention of First Order Predicates by Inverting Resolution , 1988, ML.

[7]  Murray Shanahan,et al.  An abductive event calculus planner , 2000, J. Log. Program..

[8]  Chris Cornelis,et al.  Extending boolean regulatory network models with answer set programming , 2010, 2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW).

[9]  Ulrich Berger,et al.  Computational Logic , 2001, NATO ASI Series.

[10]  C. Damásio,et al.  A survey of paraconsistent semantics for logic programs , 1998 .

[11]  Fabrizio Riguzzi,et al.  Learning with Abduction , 1997, ILP.

[12]  Thomas G. Dietterich,et al.  Structured machine learning: the next ten years , 2008, Machine Learning.

[13]  Katsumi Inoue,et al.  A Consequence Finding Approach for Full Clausal Abduction , 2007, Discovery Science.

[14]  Katsumi Inoue,et al.  Consequence finding and computing answers with defaults , 2006, Journal of Intelligent Information Systems.

[15]  Katsumi Inoue,et al.  Learning Abductive and Nonmonotonic Logic Programs , 2000 .

[16]  Akihiro Yamamoto.  Using Abduction for Induction Based on Bottom Generalization , 2000 .

[17]  Ivan Bratko,et al.  GenePath: a system for automated construction of genetic networks from mutant data , 2003, Bioinform..

[18]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[19]  Dov M. Gabbay,et al.  Handbook of defeasible reasoning and uncertainty management systems: volume 2: reasoning with actual and potential contradictions , 1998 .

[20]  Hannes Leitgeb,et al.  Nonmonotonic reasoning by inhibition nets , 2001, Artif. Intell..

[21]  Chitta Baral,et al.  Hypothesizing about signaling networks , 2009, J. Appl. Log..

[22]  P. M. Hill,et al.  Meta-Programming in Logic Progamming , 1998 .

[23]  David Poole,et al.  A Logical Framework for Default Reasoning , 1988, Artif. Intell..

[24]  Oliver Ray,et al.  Towards a Rational Approach for the Logical Modelling of Inhibition in Metabolic Networks , 2009, 2009 International Conference on Advanced Information Networking and Applications Workshops.

[25]  Stefania Costantini,et al.  Meta-reasoning: A Survey , 2002, Computational Logic: Logic Programming and Beyond.

[26]  Katsumi Inoue,et al.  Discovering Rules by Meta-level Abduction , 2009, ILP.

[27]  Stephen Muggleton,et al.  Application of abductive ILP to learning metabolic network inhibition from temporal data , 2006, Machine Learning.

[28]  D. Meek.  Tumour suppression by p53: a role for the DNA damage response? , 2009, Nature Reviews Cancer.

[29]  Stephen Moyle,et al.  Using Theory Completion to Learn a Robot Navigation Control Program , 2002, ILP.

[30]  J. Pearl.  Causality: Models, Reasoning and Inference , 2000 .

[31]  C. Prives,et al.  The p53 pathway , 1999, The Journal of pathology.

[32]  Gerhard Schurz,et al.  Patterns of abduction , 2008, Synthese.

[33]  Christopher H. Bryant,et al.  Functional genomic hypothesis generation and experimentation by a robot scientist , 2004, Nature.

[34]  Dov M. Gabbay,et al.  Handbook of logic in artificial intelligence and logic programming (vol. 1) , 1993 .

[35]  H. Mori,et al.  Systematic phenome analysis of Escherichia coli multiple-knockout mutants reveals hidden reactions in central carbon metabolism , 2009, Molecular systems biology.

[36]  Tatsuya Akutsu,et al.  Completing Networks Using Observed Data , 2009, ALT.

[37]  Utpal Banerjee,et al.  Mitochondrial regulation of cell cycle progression during development as revealed by the tenured mutation in Drosophila. , 2005, Developmental cell.

[38]  Stephen Muggleton,et al.  Developing a Logical Model of Yeast Metabolism , 2001, Electron. Trans. Artif. Intell..

[39]  Kave Eshghi,et al.  Abductive Planning with Event Calculus , 1988, ICLP/SLP.

[40]  Katsumi Inoue,et al.  Mode-Directed Inverse Entailment for Full Clausal Theories , 2007, ILP.

[41]  W. van der Hoek,et al.  Proceedings of IJCAI-09 , 2009 .

[42]  Edward R. Dougherty,et al.  Probabilistic Boolean networks: a rule-based uncertainty model for gene regulatory networks , 2002, Bioinform..

[43]  Katsumi Inoue,et al.  Integrating Abduction and Induction in Biological Inference Using CF‐Induction , 2010 .

[44]  Katsumi Inoue,et al.  Inducing Causal Laws by Regular Inference , 2005, ILP.

[45]  Katsumi Inoue,et al.  SOLAR: An automated deduction system for consequence finding , 2010, AI Commun..

[46]  Marek J. Sergot,et al.  A logic-based calculus of events , 1989, New Generation Computing.

[47]  Raymond J. Mooney,et al.  Integrating Abduction and Induction in Machine Learning , 2000 .

[48]  Stephen Muggleton,et al.  Elements of computational systems biology , 2010 .

[49]  Krysia Broda,et al.  Hybrid Abductive Inductive Learning: A Generalisation of Progol , 2003, ILP.

[50]  Luc De Raedt,et al.  Biography and future challenges , 2011 .

[51]  Stephen Muggleton,et al.  Inverse entailment and progol , 1995, New Generation Computing.

[52]  Stuart A. Kauffman,et al.  The origins of order , 1993 .

[53]  Evelina Lamma,et al.  Cooperation of Abduction and Induction in Logic Programming , 2000 .

[54]  De Raedt,et al.  Advances in Inductive Logic Programming , 1996 .

[55]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[56]  Alessandra Russo,et al.  Inductive Logic Programming as Abductive Search , 2010, ICLP.

[57]  P. Smets,et al.  Handbook of Defeasible Reasoning and Uncertainty Management Systems, Vol 3 , 1998 .

[58]  Henning Christiansen.  Abduction and Induction Combined in a Metalogic Framework , 2000 .

[59]  Robert A. Kowalski,et al.  Problems and Promises of Computational Logic , 1990 .

[60]  Chiaki Sakama.  Abductive Generalization and Specialization , 2000 .

[61]  C. Wilke,et al.  Robustness and Evolvability in Living Systems , 2006 .

[62]  Katsumi Inoue,et al.  ILP turns 20 - Biography and future challenges , 2012, Mach. Learn..

[63]  Katsumi Inoue,et al.  Application of Meta-level Abduction for the Treatment of Hypertension Using SOLAR , 2011, 2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications.

[64]  Utpal Banerjee,et al.  Metabolic control of G1–S transition: cyclin E degradation by p53-induced activation of the ubiquitin–proteasome system , 2010, The Journal of cell biology.

[65]  Antonis C. Kakas,et al.  Computational Logic: Logic Programming and Beyond: Essays in Honour of Robert A. Kowalski, Part I , 2002 .

[66]  Katsumi Inoue,et al.  Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Logic Programming for Boolean Networks , 2022 .

[67]  Pei Yee Ho,et al.  Multiple High-Throughput Analyses Monitor the Response of E. coli to Perturbations , 2007, Science.

[68]  Katsumi Inoue,et al.  Minimal Answer Computation and SOL , 2002, JELIA.

[69]  Katsumi Inoue,et al.  Linear Resolution for Consequence Finding , 1992, Artif. Intell..

[70]  Vincent T'Kindt,et al.  Counting and enumeration complexity with application to multicriteria scheduling , 2005, 4OR.

[71]  Peter A. Flach,et al.  Abduction and induction: essays on their relation and integration , 2000 .

[72]  Ramón P. Otero,et al.  Induction of the Indirect Effects of Actions by Monotonic Methods , 2005, ILP.

[73]  Katsumi Inoue,et al.  SOLAR: A Consequence Finding System for Advanced Reasoning , 2003, TABLEAUX.

[74]  Torsten Schaub,et al.  Metabolic Network Expansion with Answer Set Programming , 2009, ICLP.

[75]  Luc De Raedt,et al.  ILP turns 20 , 2011, Machine Learning.

[76]  Oliver Ray,et al.  Logic-Based Steady-State Analysis and Revision of Metabolic Networks with Inhibition , 2010, 2010 International Conference on Complex, Intelligent and Software Intensive Systems.

[77]  Katsumi Inoue,et al.  Induction as Consequence Finding , 2004, Machine Learning.

[78]  Krysia Broda,et al.  Induction on Failure: Learning Connected Horn Theories , 2009, LPNMR.