#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2001

2016

- This year (0)
- Last 5 years (12)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Manfred Eppe, Roberto Confalonieri, +5 authors Kai-Uwe Kühnberger
- IJCAI
- 2015

We present a computational framework for chord invention based on a cognitive-theoretic perspective on conceptual blending. The framework builds on algebraic specifications, and solves two musicological problems. It automatically finds transitions between chord progressions of different keys or idioms, and it substitutes chords in a chord progression by… (More)

- Ewen Maclean, Jacques D. Fleuriot, Alan Smaill
- ISAIM
- 2002

We describe how non-standard analysis can be used to prove real analysis theorems, and how these proofs can be automated using proof-planning. In particular we borrow from the constructive analysis notions of inductive partitioning, and show how transferring to the non-standard model for the reals allows us a simple proof of the correctness of partitioning… (More)

We present a novel technique for combining statistical machine learning for proof-pattern recognition with symbolic methods for lemma discovery. The resulting tool, ACL2(ml), gathers proof statistics and uses statistical pattern-recognition to pre-processes data from libraries, and then suggests auxiliary lemmas in new proofs by analogy with already seen… (More)

- Félix Bou, Marco Schorlemmer, +4 authors Alison Pease
- ICCC
- 2015

We model the mathematical process whereby new mathematical theories are invented. Here we explain the use of conceptual blending for this purpose, and show examples to illustrate the process in action. Our longerterm goal is to support machine and human mathemat-

- Ewen Maclean, Andrew Ireland, Gudmund Grov
- WING@ETAPS/IJCAR
- 2010

In [2] we introduced a system which used term synthesis to generate correct loop invariants. The CORE system extends this and is capable of automatically proving fully functional properties of programs involving pointers, by utilising existing systems to eliminate shape parts, and extracting function from the structural statements. The system is capable of… (More)

- Ewen Maclean, Andrew Ireland, Gudmund Grov
- 2011 26th IEEE/ACM International Conference on…
- 2011

Pointers are a powerful and widely used programming mechanism, but developing and maintaining correct pointer programs is notoriously hard. Here we describe the CORE

- Ewen Maclean, Andrew Ireland, Lucas Dixon, Robert Atkey
- WING@ETAPS/IJCAR
- 2010

We present a technique for refining incorrect or insufficiently strong loop invariants in correctness proofs for imperative programs. We rely on previous work [16] in combining program analysis and Proof Planning, and exploit IsaPlanner’s use of meta-variables and goal-naming to generate correct loop invariants. We present a simple example in detail and… (More)

- Gudmund Grov, Ewen Maclean
- ArXiv
- 2013

The ability to automatically generalise (interactive) proofs and use such generalisations to discharge related conjectures is a very hard problem which remains unsolved; this paper shows how we hope to make a start on solving this problem. We develop a notion of goal types to capture key properties of goals, which enables abstractions over the specific… (More)

We present a framework for conceptual blending – a concept invention method that is advocated in cognitive science as a fundamental, and uniquely human engine for creative thinking. Herein, we employ the search capabilities of ASP to find commonalities among input concepts as part of the blending process, and we show how our approach fits within a… (More)

- Ewen Maclean, Andrew Ireland
- ICFEM
- 2011