Computational Analogy Workshop at ICCBR-17

Schedule

10:55 - 11:00Fadi Badra and Tarek Besold - Welcome

Session 1: Analogical Inference

11:00 - 11:25Henri Prade and Gilles Richard: A Discussion of Analogical-Proportion Based Inference
11:25 - 11:50Pierre-Alexandre Murena, Jean-Louis Dessalles, and Antoine Cornuéjols: A Complexity Based Approach for Solving Hofstadter's Analogies
11:50 - 12:15Joseph A Blass, Irina Rabkina, and Kenneth D. Forbus: Towards a Domain-independent Method for Evaluating and Scoring Analogical Inferences

Session 2 - Analogy for Reuse

13:15 - 14:10(Keynote) Enric Plaza: Analogy and Amalgams
14:10 - 14:35Fadi Badra: A Language of Case Differences
14:35 - 15:00Scott Friedman, Mark Burstein, Jeffrey Rye, and Ugur Kuter: Analogical Localization: Flexible Plan Execution in Open Worlds

Session 3 - Analogy and NLP

15:30 - 15:55Rashel Fam and Yves Lepage: A Study of the Saturation of Analogical Grids Agnostically Extracted from Texts
15:55 - 16:20Yves Lepage: Character–Position Arithmetic for Analogy Questions between Word Forms
16:20 - 16:45Rafik Rhouma and Philippe Langlais: Experiments in Learning to Solve Formal Analogical Equations
16:45 - 17:00Concluding remarks and future of the workshop

Accepted papers

  • Fadi Badra: A Language of Case Differences
  • Joseph A Blass, Irina Rabkina, and Kenneth D. Forbus: Towards a Domain-independent Method for Evaluating and Scoring Analogical Inferences
  • Rashel Fam and Yves Lepage: A Study of the Saturation of Analogical Grids Agnostically Extracted from Texts
  • Scott Friedman, Mark Burstein, Jeffrey Rye, and Ugur Kuter: Analogical Localization: Flexible Plan Execution in Open Worlds
  • Yves Lepage: Character–Position Arithmetic for Analogy Questions between Word Forms
  • Pierre-Alexandre Murena, Jean-Louis Dessalles, and Antoine Cornuéjols: A Complexity Based Approach for Solving Hofstadter's Analogies
  • Henri Prade and Gilles Richard: A Discussion of Analogical-Proportion Based Inference
  • Rafik Rhouma and Philippe Langlais: Experiments in Learning to Solve Formal Analogical Equations

Description

Computational Analogy and Case-Based Reasoning (CBR) are closely related research areas. Both employ prior cases to reason in complex situations with incomplete information. Analogy research often focuses on modeling human cognitive processes, the structural alignment between a base/source and target, and adaptation/abstraction of the analogical source content. While CBR research also deals with alignment and adaptation, the field tends to focus more on retrieval, case-base maintenance, and pragmatic solutions to real-world problems. However, despite their obvious overlap in research goals and approaches, cross communication and collaboration between these areas has been progressively diminishing. CBR and Analogy researchers stand to benefit greatly from increased exposure to each other's work and greater cross-pollination of ideas. The objective of this workshop is to promote such communication by bringing together researchers from the two areas, to foster new collaborative endeavors, to stimulate new ideas and avoid reinventing old ones.

Topics of interest include, but are not limited to:

  • General analogical reasoning techniques
    • Adaptation
    • Alignment-based explanation/evaluation
    • Analogical distance
    • Analogical proportions in formal concept analysis
    • Analogical proportions in mathematical structures
    • Analogy in numerical settings
    • Compound analogy
    • Constructing alignments and mappings
    • Feature-based models of analogy and analogical reasoning
    • Logic-based models of analogy and analogical reasoning
    • Modality of representation of case/analogical source
    • The role of expertise in analogical reasoning
    • Segmenting and constructing cases for alignment
    • Solution-based vs. Problem-based approaches
    • Structural models of analogy and analogical reasoning
    • Types of analogical transfer/mapping
  • Analogical retrieval
    • Data mining techniques
    • Data sources for cases/analogies
    • Feature-based vs. structural retrieval
    • Indexing
    • Repository-based approaches
  • Analogical generalization
    • Analogical abstraction
    • CBR and Analogy using generalizations or schemas
    • Constructing generalizations
    • Cross-discipline translation of concepts/vocabulary
  • Applications: Computational Analogy for...
    • Cognitive Modeling
    • Computational Creativity
    • Computational Design
    • Decision-making for robotics or virtual agents
    • Knowledge capture
  • Frontiers in Computational Analogy
    • Assessing models of Computational Analogy
    • Connections to Professional Practice in Engineering and Design
    • Hybrid models
    • Theoretical foundations of Computational Analogy

The call for papers can be found here.

Participation

The workshop will be held on June 26th, 2017, as part of the ICCBR 2017 workshop series in Trondheim, Norway. The workshop is open to all interested conference participants, though available space may set an upper limit on attendance. We welcome longer submissions (up to 10 pages), as well as shorter submissions for work in progress or position papers. The Program Committee will select amongst the submitted papers for oral presentation. We also encourage those who do not want to submit a paper to attend, as one of the primary goals of the workshop is to foster cross-pollination of ideas amongst Computational Analogy and CBR researchers.

Submissions

Paper submissions should be formatted according to the ICCBR Conference format (using the Springer LNCS formatting guidelines). The following submissions are accepted:

  • Full papers: maximum 10 pages in length
  • Short papers (preliminary work): maximum 5 pages in length
  • Position papers: maximum 5 pages in length
These limits include references.

All papers will be reviewed by qualified reviewers drawn from our Workshop's Program Committee.

Please submit papers through the workshop's EasyChair submission site.

Important Dates

Submission deadline: April 24th, 2017
Notification of acceptance:May 8th, 2017
Camera-ready paper: May 29th, 2017

Organizing Committee

Program Committee

  • Fadi Badra (Universit&eactue; Paris 13, France)
  • Joe Blass (Northwestern University, USA)
  • Tarek Besold (University of Bremen, Germany)
  • Myriam Bounhas (LARODEC, Tunisia)
  • Mark Burstein (SIFT, USA)
  • Hernan Casakin (Ariel University, Israel)
  • Amaresh Chakrabarti (Indian Institute of Science, India)
  • Antoine Cornuéjols (LRI, Orsay, France)
  • Mark Finlayson (FIU, USA)
  • Tesca Fitzgerald (Georgia Institute of Technology, USA)
  • Kenneth Forbus (Northwestern University, Chicago, USA)
  • Scott Friedman (SIFT, USA)
  • Katherine Fu (Georgia Institute of Technology, Atlanta, USA)
  • Bipin Indurkhya (Jagiellonian University, Poland)
  • Mark Keane (UC Dublin, Ireland)
  • Philippe Langlais (Université de Montreal, Canada)
  • Yves Lepage (Waseda University, Japan)
  • Vincent Letard (LIMSI CNRS, France)
  • Abhijit Mahabal (Google, USA)
  • Santiago Ontanon (Drexel University, USA)
  • Henri Prade (IRIT, Toulouse, France)
  • Gilles Richard (Université Paul Sabatier, Toulouse, France)
  • Emmanuel Sander (Université Paris 8, Paris, France)
  • Ute Schmid (Universität Bamberg, Germany)
  • Steven Schockaert (Cardiff University, UK)
  • Christian Schunn (University of Pittsburg, USA)
  • Bryan Wiltgen (Georgia Institute of Technology, USA)