Upward Refinement Operators for Conceptual Blending in the Description Logic EL TR-IIIA-2016-01

Conceptual blending is a mental process that serves a variety cognitive purposes, including human creativity. In this line of thinking, human creativity is modeled as a process that takes different mental spaces as input and combines them into a new mental space, called a blend. According to this form of combinational creativity, a blend is constructed by taking the commonalities among the input mental spaces into account, to form a so-called Generic Space, and by projecting the non-common structure of the input spaces in a selective way to the novel blended space. Since input spaces for interesting blends are often initially incompatible, a generalisation step is needed before they can be blended. In this paper, we apply this idea to blend input spaces specified in the description logic EL and propose an upward refinement operator for generalising EL concepts. We show how the generalisation operator is translated to Answer Set Programming (ASP) in order to implement a search process that finds possible generalisations of input concepts. The generalisations obtained by the ASP process are used in a conceptual blending algorithm that generates and evaluates possible combinations of blends. We exemplify our approach in the domain of computer icons.

[1]  Tarek Richard Besold,et al.  Generalize and Blend: Concept Blending Based on Generalization, Analogy, and Amalgams , 2015, ICCC.

[2]  Santiago Ontañón,et al.  Amalgams: A Formal Approach for Combining Multiple Case Solutions , 2010, ICCBR.

[3]  Paul Sambre,et al.  Gilles Fauconnier & Mark Turner, " The way we think: conceptual blending and the mind's hidden complexities" , 2002 .

[4]  Leora Morgenstern,et al.  An Epistemic Event Calculus for ASP-based Reasoning About Knowledge of the Past, Present and Future , 2013, LPAR.

[5]  Juan Carlos Nieves,et al.  Nested Preferences in Answer Set Programming , 2011, Fundam. Informaticae.

[6]  G. Fauconnier,et al.  The Way We Think: Conceptual Blending and the Mind''s Hidden Complexities. Basic Books , 2002 .

[7]  Kai-Uwe Kühnberger,et al.  Computational Invention of Cadences and Chord Progressions by Conceptual Chord-Blending , 2015, IJCAI.

[8]  Shan-Hwei Nienhuys-Cheng,et al.  Completeness and Properness of Refinement Operators in Inductive Logic Programming , 1998, J. Log. Program..

[9]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.

[10]  Theresa Swift,et al.  Deduction in Ontologies via ASP , 2004, LPNMR.

[11]  Anni-Yasmin Turhan,et al.  Most Specific Generalizations w.r.t. General EL-TBoxes , 2013, IJCAI.

[12]  Jens Lehmann,et al.  Ideal Downward Refinement in the EL Description Logic , 2009, ILP.

[13]  Martin Gebser,et al.  Clingo = ASP + Control: Preliminary Report , 2014, ArXiv.

[14]  Marco Schorlemmer,et al.  ASP, Amalgamation, and the Conceptual Blending Workflow , 2015, LPNMR.

[15]  Mehul Bhatt,et al.  ExpCog : Experiments in Commonsense Cognitive Robotics , 2014 .

[16]  Jens Lehmann,et al.  Concept learning in description logics using refinement operators , 2009, Machine Learning.

[17]  Henri Prade,et al.  Using possibilistic logic for modeling qualitative decision: Answer Set Programming algorithms , 2014, Int. J. Approx. Reason..

[18]  Franz Baader Computing the Least Common Subsumer in the Description Logic EL w.r.t. Terminological Cycles with Descriptive Semantics , 2003, ICCS.

[19]  Santiago Ontañón,et al.  Refinement-Based Similarity Measure over DL Conjunctive Queries , 2013, ICCBR.

[20]  Kent A. Spackman,et al.  SNOMED RT: a reference terminology for health care , 1997, AMIA.

[21]  Mehul Bhatt,et al.  Narrative based Postdictive Reasoning for Cognitive Robotics , 2013, ArXiv.

[22]  Franz Baader,et al.  Unification in the Description Logic EL , 2009, Description Logics.

[23]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[24]  Mehul Bhatt,et al.  Approximate Epistemic Planning with Postdiction as Answer-Set Programming , 2013, LPNMR.

[25]  Franz Baader,et al.  Computing the Least Common Subsumer w.r.t. a Background Terminology , 2004, Description Logics.

[26]  Ian Horrocks,et al.  The Even More Irresistible SROIQ , 2006, KR.

[27]  Anni-Yasmin Turhan,et al.  Computing the lcs w.r.t. General EL+-TBoxes , 2013, Description Logics.

[28]  Mehul Bhatt,et al.  Approximate postdictive reasoning with answer set programming , 2015, J. Appl. Log..

[29]  Alison Pease,et al.  Using Argumentation to Evaluate Concept Blends in Combinatorial Creativity , 2015, ICCC.

[30]  Hannu Toivonen,et al.  Data mining and machine learning in computational creativity , 2015, Wiley Interdiscip. Rev. Data Min. Knowl. Discov..

[31]  Franz Baader,et al.  Pushing the EL Envelope Further , 2008, OWLED.

[32]  A. Smaill,et al.  The role of blending in mathematical invention , 2015 .

[33]  Rafael Peñaloza,et al.  Upward Refinement for Conceptual Blending in Description Logic: An ASP-based Approach and Case Study in EL++ , 2015, JOWO@IJCAI.

[34]  Franz Baader A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL , 2004, WG.

[35]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[36]  Santiago Ontañón,et al.  Similarity measures over refinement graphs , 2012, Machine Learning.

[37]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[38]  Nicolette de Keizer,et al.  Forty years of SNOMED: a literature review , 2008, BMC Medical Informatics Decis. Mak..

[39]  Roman Schindlauer,et al.  OntoDLV: An ASP-based System for Enterprise Ontologies , 2009, J. Log. Comput..

[40]  Julian Mendez,et al.  jcel: A Modular Rule-based Reasoner , 2012, ORE.

[41]  Till Mossakowski,et al.  Towards Ontological Blending , 2010, AIMSA.

[42]  Joohyung Lee,et al.  Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming , 2014, J. Artif. Intell. Res..

[43]  F. Baader Non-Standard Inferences in Description Logics : The Story So Far , 2005 .

[44]  Michael Gelfond,et al.  Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach , 2014 .

[45]  Narciso Martí-Oliet,et al.  The Maude 2.0 System , 2003, RTA.

[46]  Hans Tompits,et al.  Combining answer set programming with description logics for the Semantic Web , 2004, Artif. Intell..