Alan Bundy

Alan Bundy

Auto-generated profile, based on publicly available information

Alan Bundy

School of Informatics University of Edinburgh

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 November 2016 in AI & SOCIETY
Verified
Journal Article
Closed access
PDF file
ABAlan Bundy
Alan Bundy

1 March 1996 in Journal of Automated Reasoning
Verified
Journal Article
Closed access
PDF file
AIAndrew Ireland
Andrew Ireland
ABAlan Bundy
Alan Bundy

30 June 2005
Verified
Book
Closed access
ABAlan Bundy
Alan Bundy
DBDavid Basin
David Basin
DHDieter Hutter
Dieter Hutter
AIAndrew Ireland
Andrew Ireland
Rippling is a radically new technique for the automation of mathematical reasoning. It is widely applicable whenever a goal is to be proved from one or more syntactically similar givens. It was originally developed for inductive proofs, where the goal was the induction conclusion and the givens were the induction hypotheses. It has proved to be applicable to a much wider class of tasks, from summing series via analysis to general equational reasoning. The application to induction has especially important practical implications in the building of dependable IT systems, and provides solutions to issues such as the problem of combinatorial explosion. Rippling is the first of many new search control techniques based on formula annotation; some additional annotated reasoning techniques are also described here. This systematic and comprehensive introduction to rippling, and to the wider subject of automated inductive theorem proving, will be welcomed by researchers and graduate students alike.

24 July 2010 in Journal of Automated Reasoning
Verified
Journal Article
Closed access
PDF file
MJMoa Johansson
Moa Johansson
LDLucas Dixon
Lucas Dixon
ABAlan Bundy
Alan Bundy

1 July 2007 in International Journal on Semantic Web and Information Systems
Verified
Journal Article
Open access
PDF file
FMFiona McNeill
Fiona McNeill
ABAlan Bundy
Alan Bundy
We describe ORS, an ontology repair system. In contrast to most ontology matching systems, ORS is designed to repair an ontology that does not accurately model its domain. ORS’s ontology repairs include belief revisions, but more often makes signature repairs. It does not require full access to the ontologies of other agents and works entirely automatically and dynamically. ORS is the first example of a new breed of dynamic, automatic ontology-repair mechanisms, which we believe will be essential to realise the vision of autonomous, interacting agents, such as envisaged in the emantic Web. Full access to another (potentially rival) agent’s ontology is unrealistic; static and interactive matching mechanisms are unrealistic in the context of huge, dynamic populations of agents and full ontological agreement is pragmatically unrealistic. We present encouraging experimental results, plus an analysis of current limitations to be addressed in future work.

1 January 2010
Verified
Book Chapter
Closed access
PDF file
MJMoa Johansson
Moa Johansson
LDLucas Dixon
Lucas Dixon
ABAlan Bundy
Alan Bundy