added citations to support spider
diagrams as logic and theorem proving tools
This commit is contained in:
parent
ed1aacb71a
commit
7281c3ba4c
33
mybib.bib
33
mybib.bib
@ -321,7 +321,22 @@ doi={10.1109/RAMS.2009.4914732},
|
|||||||
ISSN={0149-144X}}
|
ISSN={0149-144X}}
|
||||||
%%#%%
|
%%#%%
|
||||||
|
|
||||||
|
@article{Fish200553,
|
||||||
|
title = "Investigating Reasoning with Constraint Diagrams ",
|
||||||
|
journal = "Electronic Notes in Theoretical Computer Science ",
|
||||||
|
volume = "127",
|
||||||
|
number = "4",
|
||||||
|
pages = "53 - 69",
|
||||||
|
year = "2005",
|
||||||
|
note = "Proceedings of the Workshop on Visual Languages and Formal Methods (VLFM 2004) Visual Languages and Formal Methods 2004",
|
||||||
|
issn = "1571-0661",
|
||||||
|
doi = "http://dx.doi.org/10.1016/j.entcs.2004.08.047",
|
||||||
|
url = "http://www.sciencedirect.com/science/article/pii/S1571066105001787",
|
||||||
|
author = "Andrew Fish and Jean Flower",
|
||||||
|
keywords = "Diagrammatic reasoning",
|
||||||
|
keywords = "constraint diagrams",
|
||||||
|
keywords = "logical inference "
|
||||||
|
}
|
||||||
|
|
||||||
@INPROCEEDINGS{incrementalfmea,
|
@INPROCEEDINGS{incrementalfmea,
|
||||||
author={Price, C.J.},
|
author={Price, C.J.},
|
||||||
@ -343,6 +358,22 @@ ISSN={0149-144X},}
|
|||||||
YEAR = "2008"
|
YEAR = "2008"
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
@MISC{theoremflower,
|
||||||
|
year={2004},
|
||||||
|
isbn={978-3-540-21268-3},
|
||||||
|
booktitle={Diagrammatic Representation and Inference},
|
||||||
|
volume={2980},
|
||||||
|
series={Lecture Notes in Computer Science},
|
||||||
|
editor={Blackwell, AlanF. and Marriott, Kim and Shimojima, Atsushi},
|
||||||
|
doi={10.1007/978-3-540-25931-2_17},
|
||||||
|
title={Generating Readable Proofs: A Heuristic Approach to Theorem Proving With Spider Diagrams},
|
||||||
|
url={http://dx.doi.org/10.1007/978-3-540-25931-2_17},
|
||||||
|
publisher={Springer Berlin Heidelberg},
|
||||||
|
author={Flower, Jean and Masthoff, Judith and Stapleton, Gem},
|
||||||
|
pages={166-181}
|
||||||
|
}
|
||||||
|
|
||||||
% my bib file.
|
% my bib file.
|
||||||
@INPROCEEDINGS{automatingFMEA1281774,
|
@INPROCEEDINGS{automatingFMEA1281774,
|
||||||
author={Papadopoulos, Y. and Parker, D. and Grante, C.},
|
author={Papadopoulos, Y. and Parker, D. and Grante, C.},
|
||||||
|
@ -101,10 +101,15 @@ I had recently completed an
|
|||||||
MSc and my project was to create an Euler/Spider~Diagram~\cite{howse:spider} editor in Java.
|
MSc and my project was to create an Euler/Spider~Diagram~\cite{howse:spider} editor in Java.
|
||||||
This editor allowed the user to draw Euler/Spider diagrams, and could then
|
This editor allowed the user to draw Euler/Spider diagrams, and could then
|
||||||
represent these as abstract---i.e. mathematical---definitions.
|
represent these as abstract---i.e. mathematical---definitions.
|
||||||
|
%
|
||||||
The primary motive for writing the Spider diagram editor was to provide an alternative
|
The primary motive for writing the Spider diagram editor was to provide an alternative
|
||||||
to formal languages for software specification.
|
to formal languages for software specification.
|
||||||
%
|
%
|
||||||
Because of my daily work exposure to FMEA, I started thinking of ways to apply formal languages and spider diagrams to
|
An added attraction for using spider diagrams was that they could be used in
|
||||||
|
proving logic~\cite{stapleton:atpieds} and theorems~\cite{theoremflower,Fish200553} in an intuitive way.
|
||||||
|
%
|
||||||
|
Because of my daily work exposure to FMEA,
|
||||||
|
I started thinking of ways to apply formal languages and spider diagrams to
|
||||||
failure mode analysis.
|
failure mode analysis.
|
||||||
%
|
%
|
||||||
%
|
%
|
||||||
@ -127,9 +132,10 @@ Any of the components that could, in failing, create a dangerous state were alre
|
|||||||
documented and approved using failure mode effects analysis (FMEA).
|
documented and approved using failure mode effects analysis (FMEA).
|
||||||
%
|
%
|
||||||
This new requirement
|
This new requirement
|
||||||
effectively meant that all single and double component failures
|
effectively meant that all single and double component failures were
|
||||||
%double combinations of component failures were
|
now required to be analysed.
|
||||||
now required to be analysed. This, from a state explosion problem alone,
|
%
|
||||||
|
This, from a state explosion problem alone,
|
||||||
meant that it was going to be virtually impossible to perform.
|
meant that it was going to be virtually impossible to perform.
|
||||||
%
|
%
|
||||||
To compound the problem, %state explosion problem
|
To compound the problem, %state explosion problem
|
||||||
|
@ -44,8 +44,7 @@
|
|||||||
|
|
||||||
|
|
||||||
%%%%%%%%%%%%%%%%%%%%%%% WEB SITES ONLY %%%%%%%%%%%%%%%%%%%%
|
%%%%%%%%%%%%%%%%%%%%%%% WEB SITES ONLY %%%%%%%%%%%%%%%%%%%%
|
||||||
|
%site,
|
||||||
@MISC{dau:website,
|
|
||||||
author = {{F.~Dau}},
|
author = {{F.~Dau}},
|
||||||
howpublished = "{http://www.dr-dau.net/eg\_readings.shtml}",
|
howpublished = "{http://www.dr-dau.net/eg\_readings.shtml}",
|
||||||
year = "2006"
|
year = "2006"
|
||||||
|
Loading…
Reference in New Issue
Block a user