Creative Logic Programming Simon Colton Computational Bioinformatics Laboratory Imperial College London.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Some Prolog Prolog is a logic programming language
Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
Automated Reasoning Systems For first order Predicate Logic.
13 Automated Reasoning 13.0 Introduction to Weak Methods in Theorem Proving 13.1 The General Problem Solver and Difference Tables 13.2 Resolution.
Logic CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
Constraint Logic Programming Ryan Kinworthy. Overview Introduction Logic Programming LP as a constraint programming language Constraint Logic Programming.
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
Models -1 Scientists often describe what they do as constructing models. Understanding scientific reasoning requires understanding something about models.
1 Automated Reasoning Introduction to Weak Methods in Theorem Proving 13.1The General Problem Solver and Difference Tables 13.2Resolution Theorem.
Knoweldge Representation & Reasoning
Developing Ideas for Research and Evaluating Theories of Behavior
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2.1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
Copyright © Cengage Learning. All rights reserved.
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
Propositional Logic Reasoning correctly computationally Chapter 7 or 8.
ILP for Mathematical Discovery Simon Colton & Stephen Muggleton Computational Bioinformatics Laboratory Imperial College.
17.5 Rule Learning Given the importance of rule-based systems and the human effort that is required to elicit good rules from experts, it is natural to.
The HOMER System for Discovery in Number Theory Simon Colton Imperial College, London.
C OURSE : D ISCRETE STRUCTURE CODE : ICS 252 Lecturer: Shamiel Hashim 1 lecturer:Shamiel Hashim second semester Prepared by: amani Omer.
Inductive Logic Programming Includes slides by Luis Tari CS7741L16ILP.
Lakatos-style Methods in Automated Reasoning Alison Pease University of Edinburgh Simon Colton Imperial College, London.
Automated Theory Formation: First Steps in Bioinformatics Simon Colton Computational Bioinformatics Laboratory.
The TM System for Repairing Non-Theorems Alison Pease – University of Edinburgh Simon Colton – Imperial College, London.
Artificial Intelligence 4. Knowledge Representation Course V231 Department of Computing Imperial College, London © Simon Colton.
Automated Reasoning for Classifying Finite Algebras Simon Colton Computational Bioinformatics Laboratory Imperial College, London.
CSNB234 ARTIFICIAL INTELLIGENCE
A Theory of Theory Formation Simon Colton Universities of Edinburgh and York.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
1 Knowledge Representation. 2 Definitions Knowledge Base Knowledge Base A set of representations of facts about the world. A set of representations of.
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Developing and Evaluating Theories of Behavior.
Working Group 4 Creative Systems for Knowledge Management in Life Sciences.
A Theory of Theory Formation Simon Colton Universities of Edinburgh and York.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 13 of 41 Monday, 20 September.
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 14 of 41 Wednesday, 22.
CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.
The Homer System Simon Colton – Imperial College, London Sophie Huczynska – University of Edinburgh.
Artificial Intelligence 7. Making Deductive Inferences Course V231 Department of Computing Imperial College, London Jeremy Gow.
Computer Science CPSC 322 Lecture 22 Logical Consequences, Proof Procedures (Ch 5.2.2)
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
1 Knowledge Based Systems (CM0377) Introductory lecture (Last revised 28th January 2002)
11 Artificial Intelligence CS 165A Thursday, October 25, 2007  Knowledge and reasoning (Ch 7) Propositional logic 1.
Building Blocks of Scientific Research Chapter 5 References:  Business Research (Duane Davis)  Business Research Methods (Cooper/Schindler) Resource.
Mathematical Induction
CS104:Discrete Structures Chapter 2: Proof Techniques.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: Proofs and Set theory.
Automated Theorem Discovery Simon Colton Universities of Edinburgh and York.
Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Calculation Invention and Deduction Dr. Simon Colton Imperial College London (Formerly at Edinburgh) YVR in Karlsruhe & Saarbrucken.
Machine Creativity Edinburgh Simon Colton Universities of Edinburgh and York.
Theory of Knowledge: Mathematics. What is maths? In order to discuss what maths is, it is helpful to look back at how maths as a discipline developed.
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.
Proof Methods for Propositional Logic CIS 391 – Intro to Artificial Intelligence.
Artificial Intelligence Knowledge Representation.
Mathematical Induction
By Muhammad Safdar MCS [E-Section].  There are times in life when you are faced with challenging decisions to make. You have rules to follow and general.
ESFOR Panel Application Developers’ Wish Lists for Automated Theorem Provers.
Artificial Intelligence Logical Agents Chapter 7.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Lecture 2: Proofs and Recursion. Lecture 2-1: Proof Techniques Proof methods : –Inductive reasoning Lecture 2-2 –Deductive reasoning Using counterexample.
Artificial Intelligence 4. Knowledge Representation
The Foundations: Logic and Proofs
Developing and Evaluating Theories of Behavior
Direct Proof and Counterexample I
This Lecture Substitution model
ONTOMERGE Ontology translations by merging ontologies Paper: Ontology Translation on the Semantic Web by Dejing Dou, Drew McDermott and Peishen Qi 2003.
Presentation transcript:

Creative Logic Programming Simon Colton Computational Bioinformatics Laboratory Imperial College London

A Grand Challenge A mathematical/computational/scientific –Theory of creative reasoning Not unimaginable –Think about the theory of deductive reasoning Challenge for the machine creativity community as a whole

First Challenge Re-unite “Automated Reasoning” –Learning and deduction have been separated –And many other forms of reasoning… Aims: –Build creative programs to find things in data that you didn’t know you were looking for I’m interested in the application to mathematics/biology –Demystify some notions associated with creativity

“I didn’t know I was looking for that!” Goal-based approach unlikely to deliver –Predictive Inductive Logic Programming Know what you’re looking for (concept) –But don’t know what it looks like –Similar: Automated Theorem Provers –Answer may be surprising and interesting But you knew what you wanted Descriptive Logic Programming perhaps better –Find association/classification rules –Designed to explore the domain –E.g., WARMR, CLAUDIEN, HR

Example #1 From HR Hypothesise something interesting about: –Dividing two numbers! An answer: –Odd refactorable numbers are perfect squares Invention and calculation: –Odd, even, square and refactorable numbers Induction: –Odd & refactorable implies square

Example #2 From HR Prove me something interesting about: –QG3-quasigroups (Latin squares + axioms) Answer: they are Anti-Abelian –If x*y = y*x then x=y –Very useful constraint for CSPs Invention and Calculation: Anti-Abelian Induction: True for all Deduction: Proved true from Axioms –Uses Otter theorem prover to do this

Moving on from HR HR may be a good start…? –But it is surely just the tip of the iceberg What other forms of reasoning can be harnessed for creative discovery? Approach I’ve taken: –Give a framework for progress –Look at terms associated with creativity Build up a catalogue of how an agent could reason –Look at a case study (mutilated grid) –Think of combination/conglomeration of reasoning

General Framework Start with a seed knowledge base –Represented as logic programs Use forms of reasoning to add new knowledge –Interesting and novel information Hopefully the user didn’t know they were looking for it Why logic programs? –I’m in Stephen Muggleton’s group!! –But really: Rich, flexible, well known representation schema Deductive, inductive, abductive methods already known Possibility to implement techniques in Prolog Cut down representation has it’s advantages

What Forms of Reasoning to Look At Take inspiration from terminology associated with creative thought –E.g., deduction, induction, serendipity, etc. Present situations with an agent adding knowledge to the KB –So that it is difficult to argue that the particular word we’re looking at does not apply to the agent’s actions Important: I’m not saying only in these situations does the word apply –Just identifying some concrete situations Added bonus: demystification of terminology

Word 1: “Experimentation” Suppose an agent is looking at this LP: –a(X) :- b(X), c(X,X,Y). –a(X) :- b(Y), c(X,Y,X). It may wish to determine whether this is in fact true of the data in the KB –Repeatedly look at constants, k, for which a(k) is true (in the success set for a(X)) And check that one or both of these is also true: – b(k), c(k,k,Y) or b(Y), c(k,Y,k) Agent is experimenting to show that the statement is false (cannot show true like this) –Can do this in the general case for an LP

Words 2 & 3: Deduction and Proving Applying a deductive rule of inference –Such as Modus Ponens, Resolution, etc. –Will create new logic programs Proving (deductive) –Have a logic program for which the agent doesn’t know the truth –Have a set of LPs which are known to be true –Find a set of LPs, which form a chain via deductive steps from the true LPs to the unknown LP Proving (exhaustive experimentation) –Know that there is only a finite set of examples –Check all possibilities for an unknown LP –Show there are no counterexamples

Word 4: Induction Use success sets of LPs –To find empirical relationships between them –Induce a generalised hypothesis In HR: –(Near)Equality of success sets –(Near)Subsumption of success sets –(Near)Non-existence of success sets In ILP: –(Near)Match of success set to target concept

Word 5: Serendipity Not just random chance –Given a novel artefact, A, need to construct a problem solvable only by A Situation: –A new LP, X, has been added to the KB –Agent constructs an LP, T, such that T is entailed by X and the knowledge base T is not entailed by the knowledge base alone –So, X solves the problem of proving T But T was invented for this reason

Word 6: Invention HR’s concept production rules Example: given –a(X) :- b(X), c(Y,Y,X) –d(X) :- b(X), e(X,X) –Generate: n 1 (X) :- b(X), c(Y,Y,X), e(X,X) [compose] n 2 (X) :- b(X), c(Y,Y,X), \+ e(X,X) [negate] n 3 (X) :- b(X), c(Y,Y,X) => e(X,X) [forall] Also W-operator in ILP systems See Colton and Muggleton (ILP’03) –“ILP for Mathematical Discovery”

Word 7: Reparation Scenario: start with a LP which is not entirely true (few counterexamples) Possibilities –Specialise the body of the clause Simple way to do this: exception barring –Monster-barring Say that the counterexample shouldn’t be there Lakatos-style methods –Studied by Alison Pease –See Colton and Pease (IJCAI’03 agents+reasoning) “Lakatos-style Methods in Automated Reasoning”

More Words Exploitation Exploration Abduction Innovation Analogy See paper

Case Study: Mutilated Checkerboard John McCarthy’s famous memo At AISB’99 he proposed it as a –`Drosophilia’ for creative reasoning –“A solution is creative if it contains concepts not present in the problem statement (informal defn)” Point is not to solve the problem –But rather to beat McCarthy –i.e., to show creativity in the program which solves the problem –Time is ripe to finish this problem off…

Mutilated Checkerboard and Grid Can an 8x8 checkerboard with two opposite corners removed be covered by dominoes? Can an 8x8 grid be covered? –We’ll look at four scenarios for solving this problem

Solving Scenario 1 Agent is given: ability to place dominoes on a mutilated grid Then exhausts all possible ways to put a set of dominoes on the board –And reports that there are always some squares which remain uncovered Hence the board cannot be covered Two questions: –Problem solved  –Agent acted creatively  Techniques: –proof by exhaustive experimentation

Solving Scenario 2 Agent is given plethora of information –Including concept of black and white squares –And solution has no uncovered black and no uncovered white squares Given the hypothesis that there is no solution Proceeds to prove deductively that the hypothesis is correct Two questions: –Problem solved  –Agent acted creatively  Techniques employed –Deductive proving and possibly abduction

Solving Scenario 3 Given ability to put dominoes on board Very limited background knowledge –Not given concept of black and white squares –Given both hypothesis (covering poss. & not) –Axiom that no squares are uncovered in a solution Explores possible board states –Then invents concept of black & white squares –And concept of boards where number of black and number of white uncovered is equal –Induces the hypothesis that this concept is never true –Imagines consequence of this induced rule: Proves that hypothesis is inconsistent with the axiom Problem solved:  Agent creative:  (poss)

Solving Scenario 4 Same background as scenario 3 Invents same concepts as before –And induces same hypothesis as before Also induces the hypothesis that a domino always covers both a black & white square –Proves this fact by exhaustive experimentation –(Another possibility: mathematical induction) Exploits the new fact: –Proves that the new fact, the hypothesis that a board can be covered and the axiom are inconsistent (hence board cannot be covered) Problem solved:  Agent acted creatively: 

HR and Mutilated Checkerboard We’ve been running experiments Given coordinates of board squares –And examples of partially covered boards Able to invent concept of black and white squares (using equal parity of coords) –And induces the hypothesis that the number of uncovered black is never equal to the number of uncovered white squares Need to give it the ability to perform exhaustive experimentation (+ lots more)

Next Steps: Interesting Questions Can this study help us to: –Assess the creativity of systems? –Build more creativity into existing systems? Which creativity words cannot easily be interpreted within this framework? –And what extensions to LPs are needed –Possible extensions: Meta-level, multiple KBs, distance metrics

Next Steps: Combination HR’s standard cycle of activity: –Invent, calculate, induce, deduce, assess Predictive ILP standard cycle of activity: –Invent, assess, induce What other cycles are there? But I believe we shouldn’t be thinking of combination, but conglomeration –Induce with an eye to deducing & vice-versa

Next Steps: Creative Prolog? Why should a Prolog system be idle –Between queries it can search for interesting facts in the ways prescribed About the current Prolog database Can respond to user queries –User: ?- mammal(X). –Program says: Mammal(X) :- covering(X,fur)? Covering(X,fur) :- mammal(X)? Here the user doesn’t even know s/he is looking for something!

For Discussion… Does this framework have application to the creative construction of artefacts –In arts/literature etc? Which of the situations do you agree that the particular words fit to? –What alternative situations are there? Which other words should we look at? Are there other scenarios for solving the mutilated checkerboard problem? Is Creative Prolog a good idea???